./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem14_label07_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem14_label07_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f9a2fcb1012f2ff72c6593976c4936a90359f50 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 04:24:31,803 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:24:31,805 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:24:31,821 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:24:31,822 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:24:31,823 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:24:31,824 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:24:31,826 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:24:31,829 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:24:31,830 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:24:31,831 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:24:31,832 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:24:31,838 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:24:31,839 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:24:31,845 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:24:31,846 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:24:31,847 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:24:31,849 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:24:31,856 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:24:31,857 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:24:31,860 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:24:31,863 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:24:31,865 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:24:31,866 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:24:31,866 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:24:31,867 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:24:31,867 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:24:31,869 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:24:31,869 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:24:31,871 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:24:31,871 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:24:31,872 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:24:31,872 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:24:31,872 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:24:31,873 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:24:31,874 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:24:31,874 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:24:31,896 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:24:31,896 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:24:31,897 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:24:31,898 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:24:31,899 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:24:31,899 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:24:31,899 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:24:31,900 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:24:31,900 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:24:31,900 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:24:31,901 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:24:31,901 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:24:31,901 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:24:31,901 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:24:31,902 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:24:31,902 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:24:31,902 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:24:31,903 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:24:31,903 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:24:31,903 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:24:31,903 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:24:31,903 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:24:31,903 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:24:31,906 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:24:31,906 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:24:31,907 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:24:31,907 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:24:31,907 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:24:31,907 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f9a2fcb1012f2ff72c6593976c4936a90359f50 [2019-01-12 04:24:31,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:24:31,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:24:31,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:24:31,999 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:24:32,000 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:24:32,001 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem14_label07_true-unreach-call_false-termination.c [2019-01-12 04:24:32,053 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e15d21462/1dee1f554d27497bb25dfd4158558ad7/FLAG4283e26f7 [2019-01-12 04:24:32,610 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:24:32,611 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem14_label07_true-unreach-call_false-termination.c [2019-01-12 04:24:32,635 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e15d21462/1dee1f554d27497bb25dfd4158558ad7/FLAG4283e26f7 [2019-01-12 04:24:32,832 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e15d21462/1dee1f554d27497bb25dfd4158558ad7 [2019-01-12 04:24:32,836 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:24:32,837 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:24:32,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:24:32,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:24:32,842 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:24:32,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:24:32" (1/1) ... [2019-01-12 04:24:32,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e32109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:24:32, skipping insertion in model container [2019-01-12 04:24:32,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:24:32" (1/1) ... [2019-01-12 04:24:32,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:24:32,919 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:24:33,359 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:24:33,364 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:24:33,509 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:24:33,625 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:24:33,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:24:33 WrapperNode [2019-01-12 04:24:33,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:24:33,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:24:33,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:24:33,628 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:24:33,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:24:33" (1/1) ... [2019-01-12 04:24:33,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:24:33" (1/1) ... [2019-01-12 04:24:33,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:24:33,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:24:33,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:24:33,761 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:24:33,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:24:33" (1/1) ... [2019-01-12 04:24:33,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:24:33" (1/1) ... [2019-01-12 04:24:33,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:24:33" (1/1) ... [2019-01-12 04:24:33,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:24:33" (1/1) ... [2019-01-12 04:24:33,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:24:33" (1/1) ... [2019-01-12 04:24:33,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:24:33" (1/1) ... [2019-01-12 04:24:33,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:24:33" (1/1) ... [2019-01-12 04:24:33,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:24:33,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:24:33,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:24:33,852 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:24:33,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:24:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:24:33,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:24:33,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:24:37,587 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:24:37,587 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 04:24:37,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:24:37 BoogieIcfgContainer [2019-01-12 04:24:37,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:24:37,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:24:37,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:24:37,593 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:24:37,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:24:32" (1/3) ... [2019-01-12 04:24:37,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b510e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:24:37, skipping insertion in model container [2019-01-12 04:24:37,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:24:33" (2/3) ... [2019-01-12 04:24:37,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b510e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:24:37, skipping insertion in model container [2019-01-12 04:24:37,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:24:37" (3/3) ... [2019-01-12 04:24:37,598 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label07_true-unreach-call_false-termination.c [2019-01-12 04:24:37,606 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:24:37,614 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:24:37,631 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:24:37,664 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:24:37,665 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:24:37,665 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:24:37,665 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:24:37,666 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:24:37,666 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:24:37,666 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:24:37,666 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:24:37,666 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:24:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-01-12 04:24:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 04:24:37,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:24:37,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:24:37,703 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:24:37,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:24:37,710 INFO L82 PathProgramCache]: Analyzing trace with hash 433832817, now seen corresponding path program 1 times [2019-01-12 04:24:37,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:24:37,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:24:37,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:24:37,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:24:37,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:24:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:24:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:24:38,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:24:38,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:24:38,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:24:38,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:24:38,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:24:38,127 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-01-12 04:24:42,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:24:42,008 INFO L93 Difference]: Finished difference Result 866 states and 1574 transitions. [2019-01-12 04:24:42,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:24:42,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-01-12 04:24:42,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:24:42,032 INFO L225 Difference]: With dead ends: 866 [2019-01-12 04:24:42,032 INFO L226 Difference]: Without dead ends: 538 [2019-01-12 04:24:42,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:24:42,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-01-12 04:24:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 360. [2019-01-12 04:24:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-01-12 04:24:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2019-01-12 04:24:42,113 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 47 [2019-01-12 04:24:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:24:42,114 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2019-01-12 04:24:42,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:24:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2019-01-12 04:24:42,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-12 04:24:42,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:24:42,120 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:24:42,121 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:24:42,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:24:42,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1697201153, now seen corresponding path program 1 times [2019-01-12 04:24:42,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:24:42,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:24:42,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:24:42,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:24:42,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:24:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:24:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:24:42,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:24:42,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:24:42,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:24:42,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:24:42,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:24:42,592 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand 4 states. [2019-01-12 04:24:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:24:44,642 INFO L93 Difference]: Finished difference Result 1430 states and 2032 transitions. [2019-01-12 04:24:44,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:24:44,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-01-12 04:24:44,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:24:44,653 INFO L225 Difference]: With dead ends: 1430 [2019-01-12 04:24:44,653 INFO L226 Difference]: Without dead ends: 1072 [2019-01-12 04:24:44,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:24:44,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2019-01-12 04:24:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 894. [2019-01-12 04:24:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-01-12 04:24:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1212 transitions. [2019-01-12 04:24:44,717 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1212 transitions. Word has length 126 [2019-01-12 04:24:44,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:24:44,718 INFO L480 AbstractCegarLoop]: Abstraction has 894 states and 1212 transitions. [2019-01-12 04:24:44,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:24:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1212 transitions. [2019-01-12 04:24:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-12 04:24:44,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:24:44,730 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:24:44,730 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:24:44,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:24:44,733 INFO L82 PathProgramCache]: Analyzing trace with hash 704948234, now seen corresponding path program 1 times [2019-01-12 04:24:44,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:24:44,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:24:44,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:24:44,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:24:44,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:24:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:24:45,114 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 04:24:45,567 WARN L181 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2019-01-12 04:24:45,691 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2019-01-12 04:24:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:24:45,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:24:45,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:24:45,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:24:45,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:24:45,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:24:45,800 INFO L87 Difference]: Start difference. First operand 894 states and 1212 transitions. Second operand 6 states. [2019-01-12 04:24:49,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:24:49,377 INFO L93 Difference]: Finished difference Result 2854 states and 3917 transitions. [2019-01-12 04:24:49,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:24:49,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-01-12 04:24:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:24:49,390 INFO L225 Difference]: With dead ends: 2854 [2019-01-12 04:24:49,390 INFO L226 Difference]: Without dead ends: 1962 [2019-01-12 04:24:49,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:24:49,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-01-12 04:24:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2019-01-12 04:24:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-01-12 04:24:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2348 transitions. [2019-01-12 04:24:49,439 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2348 transitions. Word has length 155 [2019-01-12 04:24:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:24:49,439 INFO L480 AbstractCegarLoop]: Abstraction has 1784 states and 2348 transitions. [2019-01-12 04:24:49,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:24:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2348 transitions. [2019-01-12 04:24:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-01-12 04:24:49,443 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:24:49,444 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:24:49,444 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:24:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:24:49,445 INFO L82 PathProgramCache]: Analyzing trace with hash -2059303942, now seen corresponding path program 1 times [2019-01-12 04:24:49,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:24:49,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:24:49,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:24:49,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:24:49,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:24:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:24:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-12 04:24:49,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:24:49,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:24:49,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:24:49,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:24:49,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:24:49,673 INFO L87 Difference]: Start difference. First operand 1784 states and 2348 transitions. Second operand 4 states. [2019-01-12 04:24:52,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:24:52,029 INFO L93 Difference]: Finished difference Result 5702 states and 7593 transitions. [2019-01-12 04:24:52,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:24:52,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-01-12 04:24:52,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:24:52,049 INFO L225 Difference]: With dead ends: 5702 [2019-01-12 04:24:52,050 INFO L226 Difference]: Without dead ends: 3920 [2019-01-12 04:24:52,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:24:52,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-01-12 04:24:52,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3030. [2019-01-12 04:24:52,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-01-12 04:24:52,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3805 transitions. [2019-01-12 04:24:52,115 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3805 transitions. Word has length 221 [2019-01-12 04:24:52,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:24:52,115 INFO L480 AbstractCegarLoop]: Abstraction has 3030 states and 3805 transitions. [2019-01-12 04:24:52,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:24:52,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3805 transitions. [2019-01-12 04:24:52,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-01-12 04:24:52,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:24:52,120 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:24:52,120 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:24:52,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:24:52,122 INFO L82 PathProgramCache]: Analyzing trace with hash 578378333, now seen corresponding path program 1 times [2019-01-12 04:24:52,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:24:52,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:24:52,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:24:52,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:24:52,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:24:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:24:52,518 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-12 04:24:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 148 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-12 04:24:52,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:24:52,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:24:52,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:24:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:24:52,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:24:52,982 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-12 04:24:53,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:24:53,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-12 04:24:53,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:24:53,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:24:53,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:24:53,002 INFO L87 Difference]: Start difference. First operand 3030 states and 3805 transitions. Second operand 6 states. [2019-01-12 04:24:53,922 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-01-12 04:24:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:24:56,143 INFO L93 Difference]: Finished difference Result 7006 states and 8640 transitions. [2019-01-12 04:24:56,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 04:24:56,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 235 [2019-01-12 04:24:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:24:56,161 INFO L225 Difference]: With dead ends: 7006 [2019-01-12 04:24:56,162 INFO L226 Difference]: Without dead ends: 3920 [2019-01-12 04:24:56,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:24:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-01-12 04:24:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3030. [2019-01-12 04:24:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-01-12 04:24:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3337 transitions. [2019-01-12 04:24:56,238 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3337 transitions. Word has length 235 [2019-01-12 04:24:56,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:24:56,238 INFO L480 AbstractCegarLoop]: Abstraction has 3030 states and 3337 transitions. [2019-01-12 04:24:56,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:24:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3337 transitions. [2019-01-12 04:24:56,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-01-12 04:24:56,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:24:56,248 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:24:56,249 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:24:56,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:24:56,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1338618204, now seen corresponding path program 1 times [2019-01-12 04:24:56,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:24:56,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:24:56,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:24:56,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:24:56,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:24:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:24:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2019-01-12 04:24:56,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:24:56,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:24:56,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:24:56,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:24:56,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:24:56,760 INFO L87 Difference]: Start difference. First operand 3030 states and 3337 transitions. Second operand 3 states. [2019-01-12 04:24:58,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:24:58,500 INFO L93 Difference]: Finished difference Result 3744 states and 4112 transitions. [2019-01-12 04:24:58,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:24:58,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 435 [2019-01-12 04:24:58,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:24:58,516 INFO L225 Difference]: With dead ends: 3744 [2019-01-12 04:24:58,516 INFO L226 Difference]: Without dead ends: 3742 [2019-01-12 04:24:58,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:24:58,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2019-01-12 04:24:58,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3208. [2019-01-12 04:24:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2019-01-12 04:24:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3538 transitions. [2019-01-12 04:24:58,579 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3538 transitions. Word has length 435 [2019-01-12 04:24:58,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:24:58,580 INFO L480 AbstractCegarLoop]: Abstraction has 3208 states and 3538 transitions. [2019-01-12 04:24:58,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:24:58,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3538 transitions. [2019-01-12 04:24:58,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2019-01-12 04:24:58,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:24:58,598 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:24:58,599 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:24:58,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:24:58,599 INFO L82 PathProgramCache]: Analyzing trace with hash -708643242, now seen corresponding path program 1 times [2019-01-12 04:24:58,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:24:58,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:24:58,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:24:58,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:24:58,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:24:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:24:59,017 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 04:24:59,282 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-12 04:24:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 803 proven. 130 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-01-12 04:24:59,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:24:59,709 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:24:59,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:24:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:24:59,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:25:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 787 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-01-12 04:25:00,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:25:00,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2019-01-12 04:25:00,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 04:25:00,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 04:25:00,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-01-12 04:25:00,588 INFO L87 Difference]: Start difference. First operand 3208 states and 3538 transitions. Second operand 14 states. [2019-01-12 04:25:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:25:04,113 INFO L93 Difference]: Finished difference Result 7004 states and 7696 transitions. [2019-01-12 04:25:04,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 04:25:04,114 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 582 [2019-01-12 04:25:04,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:25:04,132 INFO L225 Difference]: With dead ends: 7004 [2019-01-12 04:25:04,132 INFO L226 Difference]: Without dead ends: 3748 [2019-01-12 04:25:04,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 578 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2019-01-12 04:25:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2019-01-12 04:25:04,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 3030. [2019-01-12 04:25:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-01-12 04:25:04,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3250 transitions. [2019-01-12 04:25:04,201 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3250 transitions. Word has length 582 [2019-01-12 04:25:04,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:25:04,202 INFO L480 AbstractCegarLoop]: Abstraction has 3030 states and 3250 transitions. [2019-01-12 04:25:04,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 04:25:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3250 transitions. [2019-01-12 04:25:04,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2019-01-12 04:25:04,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:25:04,258 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:25:04,258 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:25:04,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:25:04,258 INFO L82 PathProgramCache]: Analyzing trace with hash 729403087, now seen corresponding path program 1 times [2019-01-12 04:25:04,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:25:04,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:25:04,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:25:04,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:25:04,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:25:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:25:04,960 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 04:25:05,646 WARN L181 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2019-01-12 04:25:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1840 backedges. 1361 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2019-01-12 04:25:06,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:25:06,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:25:06,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:25:06,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:25:06,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:25:06,483 INFO L87 Difference]: Start difference. First operand 3030 states and 3250 transitions. Second operand 7 states. [2019-01-12 04:25:08,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:25:08,915 INFO L93 Difference]: Finished difference Result 7375 states and 7853 transitions. [2019-01-12 04:25:08,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 04:25:08,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 824 [2019-01-12 04:25:08,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:25:08,930 INFO L225 Difference]: With dead ends: 7375 [2019-01-12 04:25:08,930 INFO L226 Difference]: Without dead ends: 4347 [2019-01-12 04:25:08,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:25:08,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4347 states. [2019-01-12 04:25:08,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4347 to 3208. [2019-01-12 04:25:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2019-01-12 04:25:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3431 transitions. [2019-01-12 04:25:08,999 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3431 transitions. Word has length 824 [2019-01-12 04:25:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:25:09,001 INFO L480 AbstractCegarLoop]: Abstraction has 3208 states and 3431 transitions. [2019-01-12 04:25:09,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:25:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3431 transitions. [2019-01-12 04:25:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2019-01-12 04:25:09,011 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:25:09,012 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:25:09,012 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:25:09,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:25:09,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1264885244, now seen corresponding path program 1 times [2019-01-12 04:25:09,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:25:09,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:25:09,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:25:09,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:25:09,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:25:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:25:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2226 backedges. 1480 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2019-01-12 04:25:09,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:25:09,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:25:09,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:25:09,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:25:09,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:25:09,482 INFO L87 Difference]: Start difference. First operand 3208 states and 3431 transitions. Second operand 3 states. [2019-01-12 04:25:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:25:10,198 INFO L93 Difference]: Finished difference Result 7482 states and 7979 transitions. [2019-01-12 04:25:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:25:10,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 840 [2019-01-12 04:25:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:25:10,212 INFO L225 Difference]: With dead ends: 7482 [2019-01-12 04:25:10,212 INFO L226 Difference]: Without dead ends: 4276 [2019-01-12 04:25:10,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:25:10,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-01-12 04:25:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4098. [2019-01-12 04:25:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-01-12 04:25:10,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4342 transitions. [2019-01-12 04:25:10,284 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4342 transitions. Word has length 840 [2019-01-12 04:25:10,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:25:10,285 INFO L480 AbstractCegarLoop]: Abstraction has 4098 states and 4342 transitions. [2019-01-12 04:25:10,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:25:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4342 transitions. [2019-01-12 04:25:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 925 [2019-01-12 04:25:10,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:25:10,298 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:25:10,298 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:25:10,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:25:10,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1229948962, now seen corresponding path program 1 times [2019-01-12 04:25:10,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:25:10,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:25:10,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:25:10,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:25:10,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:25:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:25:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2393 backedges. 1184 proven. 4 refuted. 0 times theorem prover too weak. 1205 trivial. 0 not checked. [2019-01-12 04:25:11,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:25:11,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:25:11,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:25:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:25:11,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:25:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2393 backedges. 1165 proven. 23 refuted. 0 times theorem prover too weak. 1205 trivial. 0 not checked. [2019-01-12 04:25:12,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:25:12,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-01-12 04:25:12,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:25:12,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:25:12,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:25:12,540 INFO L87 Difference]: Start difference. First operand 4098 states and 4342 transitions. Second operand 8 states. [2019-01-12 04:25:14,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:25:14,815 INFO L93 Difference]: Finished difference Result 9693 states and 10219 transitions. [2019-01-12 04:25:14,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 04:25:14,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 924 [2019-01-12 04:25:14,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:25:14,836 INFO L225 Difference]: With dead ends: 9693 [2019-01-12 04:25:14,836 INFO L226 Difference]: Without dead ends: 5597 [2019-01-12 04:25:14,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 932 GetRequests, 922 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:25:14,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2019-01-12 04:25:14,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 4098. [2019-01-12 04:25:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-01-12 04:25:14,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4341 transitions. [2019-01-12 04:25:14,915 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4341 transitions. Word has length 924 [2019-01-12 04:25:14,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:25:14,916 INFO L480 AbstractCegarLoop]: Abstraction has 4098 states and 4341 transitions. [2019-01-12 04:25:14,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:25:14,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4341 transitions. [2019-01-12 04:25:14,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1014 [2019-01-12 04:25:14,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:25:14,932 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:25:14,932 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:25:14,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:25:14,932 INFO L82 PathProgramCache]: Analyzing trace with hash 409254035, now seen corresponding path program 1 times [2019-01-12 04:25:14,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:25:14,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:25:14,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:25:14,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:25:14,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:25:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:25:15,463 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 04:25:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3061 backedges. 2054 proven. 199 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-01-12 04:25:16,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:25:16,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:25:16,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:25:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:25:17,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:25:18,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3061 backedges. 1961 proven. 93 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2019-01-12 04:25:18,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:25:18,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-01-12 04:25:18,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:25:18,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:25:18,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:25:18,866 INFO L87 Difference]: Start difference. First operand 4098 states and 4341 transitions. Second operand 8 states. [2019-01-12 04:25:20,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:25:20,827 INFO L93 Difference]: Finished difference Result 10225 states and 10803 transitions. [2019-01-12 04:25:20,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 04:25:20,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1013 [2019-01-12 04:25:20,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:25:20,829 INFO L225 Difference]: With dead ends: 10225 [2019-01-12 04:25:20,830 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:25:20,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 1012 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:25:20,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:25:20,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:25:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:25:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:25:20,838 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1013 [2019-01-12 04:25:20,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:25:20,838 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:25:20,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:25:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:25:20,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:25:20,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:25:21,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:25:21,679 WARN L181 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 201 [2019-01-12 04:25:22,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:25:22,412 WARN L181 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 277 DAG size of output: 200 [2019-01-12 04:25:23,996 WARN L181 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 191 DAG size of output: 29 [2019-01-12 04:25:25,098 WARN L181 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 190 DAG size of output: 29 [2019-01-12 04:25:25,102 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-01-12 04:25:25,103 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-01-12 04:25:25,103 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,103 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,103 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,103 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-01-12 04:25:25,103 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:25:25,103 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:25:25,103 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:25:25,103 INFO L448 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-01-12 04:25:25,104 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-01-12 04:25:25,104 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-01-12 04:25:25,104 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-01-12 04:25:25,104 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,104 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,104 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,104 INFO L448 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-01-12 04:25:25,104 INFO L448 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-01-12 04:25:25,104 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:25:25,104 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:25:25,104 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:25:25,105 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-01-12 04:25:25,105 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-01-12 04:25:25,105 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-01-12 04:25:25,105 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,105 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,105 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,105 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-01-12 04:25:25,105 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:25:25,105 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:25:25,105 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:25:25,105 INFO L448 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-01-12 04:25:25,106 INFO L448 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-01-12 04:25:25,106 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-01-12 04:25:25,106 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-01-12 04:25:25,106 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-01-12 04:25:25,106 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,106 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,106 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,106 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-01-12 04:25:25,106 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:25:25,106 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:25:25,106 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:25:25,107 INFO L448 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-01-12 04:25:25,107 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-01-12 04:25:25,107 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-01-12 04:25:25,107 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,107 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,107 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,107 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-01-12 04:25:25,107 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:25:25,107 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:25:25,107 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:25:25,108 INFO L448 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-01-12 04:25:25,108 INFO L448 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-01-12 04:25:25,108 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-01-12 04:25:25,108 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-01-12 04:25:25,108 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-01-12 04:25:25,108 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,108 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,108 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,108 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-01-12 04:25:25,108 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:25:25,109 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:25:25,109 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:25:25,109 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-01-12 04:25:25,109 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-01-12 04:25:25,109 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-01-12 04:25:25,109 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-01-12 04:25:25,109 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,109 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,109 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,109 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:25:25,110 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:25:25,110 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:25:25,110 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-01-12 04:25:25,110 INFO L448 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-01-12 04:25:25,110 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-01-12 04:25:25,110 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-01-12 04:25:25,110 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-01-12 04:25:25,110 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,110 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,110 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,110 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-01-12 04:25:25,111 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-01-12 04:25:25,111 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:25:25,111 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:25:25,111 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:25:25,111 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:25:25,111 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-01-12 04:25:25,111 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-01-12 04:25:25,111 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-01-12 04:25:25,111 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,111 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,111 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,111 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:25:25,112 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:25:25,112 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:25:25,112 INFO L448 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-01-12 04:25:25,112 INFO L448 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-01-12 04:25:25,112 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-01-12 04:25:25,112 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-01-12 04:25:25,112 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-01-12 04:25:25,112 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,112 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,112 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,112 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-01-12 04:25:25,112 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-01-12 04:25:25,113 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:25:25,113 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:25:25,113 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:25:25,113 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-01-12 04:25:25,113 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:25:25,113 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-01-12 04:25:25,113 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-01-12 04:25:25,113 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,113 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,113 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,113 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-01-12 04:25:25,114 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:25:25,114 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:25:25,114 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:25:25,114 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-01-12 04:25:25,114 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-01-12 04:25:25,114 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-01-12 04:25:25,114 INFO L448 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-01-12 04:25:25,114 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,114 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,114 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,114 INFO L448 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-01-12 04:25:25,115 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:25:25,115 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:25:25,115 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:25:25,115 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-01-12 04:25:25,115 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-01-12 04:25:25,115 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-01-12 04:25:25,115 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-01-12 04:25:25,115 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,115 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,115 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-01-12 04:25:25,115 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:25:25,115 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:25:25,116 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-01-12 04:25:25,116 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-01-12 04:25:25,116 INFO L448 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-01-12 04:25:25,116 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-01-12 04:25:25,116 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-01-12 04:25:25,116 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,116 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,116 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-01-12 04:25:25,116 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:25:25,116 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:25:25,116 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-01-12 04:25:25,116 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-01-12 04:25:25,117 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-01-12 04:25:25,117 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,117 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,117 INFO L444 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse0 (= ~a24~0 1)) (.cse1 (<= ~a15~0 8))) (or (and .cse0 (and (not (= ~a15~0 5)) .cse1)) (and (< 11 ~a12~0) .cse0) (and (not (= ~a21~0 9)) .cse0) (and (<= (+ ~a12~0 43) 0) .cse1 (not (= ~a21~0 10))))) [2019-01-12 04:25:25,117 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-01-12 04:25:25,117 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-01-12 04:25:25,118 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:25:25,118 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:25:25,118 INFO L448 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-01-12 04:25:25,118 INFO L448 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-01-12 04:25:25,118 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-01-12 04:25:25,118 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-01-12 04:25:25,118 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,118 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,118 INFO L451 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-01-12 04:25:25,118 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-01-12 04:25:25,118 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-01-12 04:25:25,119 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:25:25,119 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:25:25,119 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-01-12 04:25:25,119 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-01-12 04:25:25,119 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-01-12 04:25:25,119 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,119 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,119 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-01-12 04:25:25,119 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-01-12 04:25:25,119 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:25:25,119 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:25:25,119 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:25:25,120 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-01-12 04:25:25,120 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-01-12 04:25:25,120 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,120 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,120 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-01-12 04:25:25,120 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,120 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-01-12 04:25:25,120 INFO L444 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse0 (= ~a24~0 1)) (.cse1 (<= ~a15~0 8))) (or (and .cse0 (and (not (= ~a15~0 5)) .cse1)) (and (< 11 ~a12~0) .cse0) (and (not (= ~a21~0 9)) .cse0) (and (<= (+ ~a12~0 43) 0) .cse1 (not (= ~a21~0 10))))) [2019-01-12 04:25:25,120 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-01-12 04:25:25,120 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-01-12 04:25:25,121 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:25:25,121 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:25:25,121 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-12 04:25:25,121 INFO L448 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-01-12 04:25:25,121 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-01-12 04:25:25,121 INFO L448 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-01-12 04:25:25,121 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-01-12 04:25:25,121 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,121 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,121 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,121 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-01-12 04:25:25,122 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:25:25,122 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:25:25,122 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:25:25,122 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-01-12 04:25:25,122 INFO L448 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-01-12 04:25:25,122 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-01-12 04:25:25,122 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-01-12 04:25:25,122 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-01-12 04:25:25,122 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,122 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,122 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,122 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-01-12 04:25:25,123 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-01-12 04:25:25,123 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:25:25,123 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:25:25,123 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:25:25,123 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:25:25,123 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-01-12 04:25:25,123 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-01-12 04:25:25,123 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2019-01-12 04:25:25,123 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-01-12 04:25:25,124 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,124 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,124 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,124 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-01-12 04:25:25,124 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:25:25,124 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:25:25,124 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:25:25,124 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-01-12 04:25:25,124 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-01-12 04:25:25,124 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-01-12 04:25:25,124 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-01-12 04:25:25,124 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-01-12 04:25:25,125 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,125 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,125 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:25:25,125 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-01-12 04:25:25,125 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:25:25,125 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:25:25,125 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:25:25,125 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-01-12 04:25:25,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:25:25 BoogieIcfgContainer [2019-01-12 04:25:25,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:25:25,154 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:25:25,154 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:25:25,154 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:25:25,157 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:24:37" (3/4) ... [2019-01-12 04:25:25,161 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:25:25,203 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 04:25:25,205 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:25:25,473 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:25:25,473 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:25:25,474 INFO L168 Benchmark]: Toolchain (without parser) took 52637.85 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-01-12 04:25:25,475 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:25:25,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 942.0 MB in the beginning and 1.2 GB in the end (delta: -212.7 MB). Peak memory consumption was 54.8 MB. Max. memory is 11.5 GB. [2019-01-12 04:25:25,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-12 04:25:25,476 INFO L168 Benchmark]: Boogie Preprocessor took 90.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 04:25:25,476 INFO L168 Benchmark]: RCFGBuilder took 3737.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 126.3 MB). Peak memory consumption was 126.3 MB. Max. memory is 11.5 GB. [2019-01-12 04:25:25,477 INFO L168 Benchmark]: TraceAbstraction took 47563.81 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -115.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-01-12 04:25:25,477 INFO L168 Benchmark]: Witness Printer took 319.26 ms. Allocated memory is still 2.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2019-01-12 04:25:25,480 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 788.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 942.0 MB in the beginning and 1.2 GB in the end (delta: -212.7 MB). Peak memory consumption was 54.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 133.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3737.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 126.3 MB). Peak memory consumption was 126.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47563.81 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -115.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 319.26 ms. Allocated memory is still 2.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 145]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((a24 == 1 && !(a15 == 5) && a15 <= 8) || (11 < a12 && a24 == 1)) || (!(a21 == 9) && a24 == 1)) || ((a12 + 43 <= 0 && a15 <= 8) && !(a21 == 10)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((a24 == 1 && !(a15 == 5) && a15 <= 8) || (11 < a12 && a24 == 1)) || (!(a21 == 9) && a24 == 1)) || ((a12 + 43 <= 0 && a15 <= 8) && !(a21 == 10)) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. SAFE Result, 47.4s OverallTime, 11 OverallIterations, 9 TraceHistogramMax, 27.8s AutomataDifference, 0.0s DeadEndRemovalTime, 4.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 533 SDtfs, 5538 SDslu, 230 SDs, 0 SdLazy, 14206 SolverSat, 1700 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2826 GetRequests, 2757 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4098occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 6382 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 130 NumberOfFragments, 83 HoareAnnotationTreeSize, 3 FomulaSimplifications, 124126 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 41393 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 8156 NumberOfCodeBlocks, 8156 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 8141 ConstructedInterpolants, 0 QuantifiedInterpolants, 26173176 SizeOfPredicates, 16 NumberOfNonLiveVariables, 3402 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 18060/18513 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...