java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 20:27:37,032 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 20:27:37,034 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 20:27:37,048 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 20:27:37,049 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 20:27:37,052 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 20:27:37,054 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 20:27:37,057 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 20:27:37,060 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 20:27:37,060 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 20:27:37,063 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 20:27:37,063 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 20:27:37,065 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 20:27:37,065 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 20:27:37,066 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 20:27:37,069 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 20:27:37,070 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 20:27:37,072 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 20:27:37,081 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 20:27:37,084 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 20:27:37,086 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 20:27:37,088 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 20:27:37,091 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 20:27:37,091 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 20:27:37,091 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 20:27:37,094 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 20:27:37,095 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 20:27:37,095 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 20:27:37,098 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 20:27:37,100 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 20:27:37,100 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 20:27:37,100 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 20:27:37,101 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 20:27:37,101 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 20:27:37,104 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 20:27:37,105 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 20:27:37,105 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 20:27:37,121 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 20:27:37,122 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 20:27:37,122 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 20:27:37,123 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 20:27:37,126 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 20:27:37,126 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 20:27:37,126 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 20:27:37,127 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 20:27:37,127 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 20:27:37,127 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 20:27:37,127 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 20:27:37,127 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 20:27:37,127 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 20:27:37,129 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 20:27:37,129 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 20:27:37,129 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 20:27:37,129 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 20:27:37,129 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 20:27:37,130 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 20:27:37,130 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 20:27:37,130 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 20:27:37,130 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 20:27:37,131 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 20:27:37,131 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 20:27:37,131 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 20:27:37,131 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 20:27:37,131 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 20:27:37,132 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 20:27:37,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 20:27:37,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 20:27:37,196 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 20:27:37,199 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 20:27:37,200 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 20:27:37,201 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c [2018-10-23 20:27:37,264 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5ac86d07d/7f6fe87c143541ada4b6edf4d74e5a5b/FLAGc25064da3 [2018-10-23 20:27:37,821 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 20:27:37,822 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c [2018-10-23 20:27:37,848 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5ac86d07d/7f6fe87c143541ada4b6edf4d74e5a5b/FLAGc25064da3 [2018-10-23 20:27:37,869 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5ac86d07d/7f6fe87c143541ada4b6edf4d74e5a5b [2018-10-23 20:27:37,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 20:27:37,880 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 20:27:37,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 20:27:37,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 20:27:37,885 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 20:27:37,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:27:37" (1/1) ... [2018-10-23 20:27:37,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436ba03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:37, skipping insertion in model container [2018-10-23 20:27:37,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:27:37" (1/1) ... [2018-10-23 20:27:37,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 20:27:37,960 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 20:27:38,491 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:27:38,496 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 20:27:38,665 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:27:38,682 INFO L193 MainTranslator]: Completed translation [2018-10-23 20:27:38,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:38 WrapperNode [2018-10-23 20:27:38,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 20:27:38,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 20:27:38,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 20:27:38,684 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 20:27:38,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:38" (1/1) ... [2018-10-23 20:27:38,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:38" (1/1) ... [2018-10-23 20:27:38,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 20:27:38,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 20:27:38,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 20:27:38,910 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 20:27:38,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:38" (1/1) ... [2018-10-23 20:27:38,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:38" (1/1) ... [2018-10-23 20:27:38,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:38" (1/1) ... [2018-10-23 20:27:38,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:38" (1/1) ... [2018-10-23 20:27:38,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:38" (1/1) ... [2018-10-23 20:27:38,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:38" (1/1) ... [2018-10-23 20:27:39,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:38" (1/1) ... [2018-10-23 20:27:39,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 20:27:39,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 20:27:39,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 20:27:39,017 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 20:27:39,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-23 20:27:39,088 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 20:27:39,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 20:27:39,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 20:27:42,459 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 20:27:42,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:27:42 BoogieIcfgContainer [2018-10-23 20:27:42,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 20:27:42,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 20:27:42,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 20:27:42,467 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 20:27:42,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:27:37" (1/3) ... [2018-10-23 20:27:42,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f546f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:27:42, skipping insertion in model container [2018-10-23 20:27:42,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:38" (2/3) ... [2018-10-23 20:27:42,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f546f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:27:42, skipping insertion in model container [2018-10-23 20:27:42,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:27:42" (3/3) ... [2018-10-23 20:27:42,472 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label55_true-unreach-call_false-termination.c [2018-10-23 20:27:42,482 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 20:27:42,494 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 20:27:42,512 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 20:27:42,549 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 20:27:42,550 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 20:27:42,550 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 20:27:42,550 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 20:27:42,550 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 20:27:42,551 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 20:27:42,551 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 20:27:42,551 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 20:27:42,551 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 20:27:42,582 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2018-10-23 20:27:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-23 20:27:42,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:27:42,594 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:27:42,596 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:27:42,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:27:42,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1482679290, now seen corresponding path program 1 times [2018-10-23 20:27:42,603 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:27:42,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:27:42,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:27:42,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:27:42,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:27:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:27:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:27:43,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:27:43,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:27:43,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:27:43,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:27:43,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:27:43,183 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 4 states. [2018-10-23 20:27:46,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:27:46,178 INFO L93 Difference]: Finished difference Result 870 states and 1578 transitions. [2018-10-23 20:27:46,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:27:46,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-10-23 20:27:46,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:27:46,204 INFO L225 Difference]: With dead ends: 870 [2018-10-23 20:27:46,204 INFO L226 Difference]: Without dead ends: 617 [2018-10-23 20:27:46,210 INFO L605 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 [2018-10-23 20:27:46,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-23 20:27:46,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2018-10-23 20:27:46,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-10-23 20:27:46,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 985 transitions. [2018-10-23 20:27:46,298 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 985 transitions. Word has length 58 [2018-10-23 20:27:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:27:46,298 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 985 transitions. [2018-10-23 20:27:46,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:27:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 985 transitions. [2018-10-23 20:27:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-23 20:27:46,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:27:46,308 INFO L375 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, 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] [2018-10-23 20:27:46,309 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:27:46,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:27:46,309 INFO L82 PathProgramCache]: Analyzing trace with hash 100657665, now seen corresponding path program 1 times [2018-10-23 20:27:46,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:27:46,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:27:46,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:27:46,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:27:46,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:27:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:27:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:27:46,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:27:46,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 20:27:46,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 20:27:46,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 20:27:46,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-23 20:27:46,947 INFO L87 Difference]: Start difference. First operand 617 states and 985 transitions. Second operand 6 states. [2018-10-23 20:27:52,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:27:52,294 INFO L93 Difference]: Finished difference Result 2487 states and 3857 transitions. [2018-10-23 20:27:52,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 20:27:52,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2018-10-23 20:27:52,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:27:52,309 INFO L225 Difference]: With dead ends: 2487 [2018-10-23 20:27:52,309 INFO L226 Difference]: Without dead ends: 1872 [2018-10-23 20:27:52,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-23 20:27:52,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2018-10-23 20:27:52,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1691. [2018-10-23 20:27:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1691 states. [2018-10-23 20:27:52,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2279 transitions. [2018-10-23 20:27:52,392 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2279 transitions. Word has length 167 [2018-10-23 20:27:52,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:27:52,393 INFO L481 AbstractCegarLoop]: Abstraction has 1691 states and 2279 transitions. [2018-10-23 20:27:52,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 20:27:52,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2279 transitions. [2018-10-23 20:27:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-23 20:27:52,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:27:52,403 INFO L375 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 20:27:52,403 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:27:52,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:27:52,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1768355921, now seen corresponding path program 1 times [2018-10-23 20:27:52,404 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:27:52,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:27:52,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:27:52,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:27:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:27:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:27:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-23 20:27:52,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:27:52,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:27:52,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:27:52,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:27:52,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:27:52,614 INFO L87 Difference]: Start difference. First operand 1691 states and 2279 transitions. Second operand 4 states. [2018-10-23 20:27:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:27:55,041 INFO L93 Difference]: Finished difference Result 4454 states and 6277 transitions. [2018-10-23 20:27:55,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:27:55,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2018-10-23 20:27:55,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:27:55,056 INFO L225 Difference]: With dead ends: 4454 [2018-10-23 20:27:55,056 INFO L226 Difference]: Without dead ends: 2765 [2018-10-23 20:27:55,059 INFO L605 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 [2018-10-23 20:27:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2018-10-23 20:27:55,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 2765. [2018-10-23 20:27:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2765 states. [2018-10-23 20:27:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2765 states and 3622 transitions. [2018-10-23 20:27:55,113 INFO L78 Accepts]: Start accepts. Automaton has 2765 states and 3622 transitions. Word has length 234 [2018-10-23 20:27:55,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:27:55,113 INFO L481 AbstractCegarLoop]: Abstraction has 2765 states and 3622 transitions. [2018-10-23 20:27:55,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:27:55,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 3622 transitions. [2018-10-23 20:27:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-23 20:27:55,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:27:55,119 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:27:55,120 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:27:55,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:27:55,120 INFO L82 PathProgramCache]: Analyzing trace with hash 819584340, now seen corresponding path program 1 times [2018-10-23 20:27:55,120 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:27:55,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:27:55,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:27:55,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:27:55,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:27:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:27:55,543 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-23 20:27:55,883 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-10-23 20:27:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 160 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-23 20:27:56,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:27:56,055 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-23 20:27:56,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:27:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:27:56,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:27:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-23 20:27:56,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:27:56,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-23 20:27:56,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 20:27:56,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 20:27:56,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 20:27:56,407 INFO L87 Difference]: Start difference. First operand 2765 states and 3622 transitions. Second operand 6 states. [2018-10-23 20:28:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:28:05,247 INFO L93 Difference]: Finished difference Result 8081 states and 10627 transitions. [2018-10-23 20:28:05,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 20:28:05,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2018-10-23 20:28:05,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:28:05,269 INFO L225 Difference]: With dead ends: 8081 [2018-10-23 20:28:05,269 INFO L226 Difference]: Without dead ends: 4747 [2018-10-23 20:28:05,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-23 20:28:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4747 states. [2018-10-23 20:28:05,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4747 to 2748. [2018-10-23 20:28:05,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2748 states. [2018-10-23 20:28:05,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2748 states and 3108 transitions. [2018-10-23 20:28:05,335 INFO L78 Accepts]: Start accepts. Automaton has 2748 states and 3108 transitions. Word has length 248 [2018-10-23 20:28:05,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:28:05,335 INFO L481 AbstractCegarLoop]: Abstraction has 2748 states and 3108 transitions. [2018-10-23 20:28:05,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 20:28:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 3108 transitions. [2018-10-23 20:28:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-10-23 20:28:05,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:28:05,343 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-10-23 20:28:05,343 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:28:05,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:28:05,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2018352760, now seen corresponding path program 1 times [2018-10-23 20:28:05,343 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:28:05,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:28:05,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:05,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:28:05,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:28:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 310 proven. 46 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-23 20:28:06,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:28:06,158 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-23 20:28:06,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:28:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:28:06,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:28:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-10-23 20:28:06,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:28:06,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-23 20:28:06,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 20:28:06,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 20:28:06,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-23 20:28:06,429 INFO L87 Difference]: Start difference. First operand 2748 states and 3108 transitions. Second operand 8 states. [2018-10-23 20:28:10,697 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-10-23 20:28:14,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:28:14,616 INFO L93 Difference]: Finished difference Result 6763 states and 7755 transitions. [2018-10-23 20:28:14,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-23 20:28:14,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 365 [2018-10-23 20:28:14,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:28:14,635 INFO L225 Difference]: With dead ends: 6763 [2018-10-23 20:28:14,635 INFO L226 Difference]: Without dead ends: 4016 [2018-10-23 20:28:14,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 367 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-10-23 20:28:14,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2018-10-23 20:28:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 3821. [2018-10-23 20:28:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3821 states. [2018-10-23 20:28:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 4244 transitions. [2018-10-23 20:28:14,707 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 4244 transitions. Word has length 365 [2018-10-23 20:28:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:28:14,708 INFO L481 AbstractCegarLoop]: Abstraction has 3821 states and 4244 transitions. [2018-10-23 20:28:14,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 20:28:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 4244 transitions. [2018-10-23 20:28:14,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2018-10-23 20:28:14,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:28:14,724 INFO L375 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, 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:28:14,724 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:28:14,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:28:14,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1724717669, now seen corresponding path program 1 times [2018-10-23 20:28:14,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:28:14,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:28:14,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:14,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:28:14,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:28:15,160 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-23 20:28:15,340 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-10-23 20:28:15,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 786 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-10-23 20:28:15,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:28:15,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 20:28:15,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 20:28:15,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 20:28:15,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-23 20:28:15,620 INFO L87 Difference]: Start difference. First operand 3821 states and 4244 transitions. Second operand 7 states. [2018-10-23 20:28:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:28:17,579 INFO L93 Difference]: Finished difference Result 7896 states and 8791 transitions. [2018-10-23 20:28:17,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 20:28:17,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 533 [2018-10-23 20:28:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:28:17,604 INFO L225 Difference]: With dead ends: 7896 [2018-10-23 20:28:17,605 INFO L226 Difference]: Without dead ends: 3639 [2018-10-23 20:28:17,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-23 20:28:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2018-10-23 20:28:17,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 3639. [2018-10-23 20:28:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3639 states. [2018-10-23 20:28:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 3996 transitions. [2018-10-23 20:28:17,664 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 3996 transitions. Word has length 533 [2018-10-23 20:28:17,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:28:17,665 INFO L481 AbstractCegarLoop]: Abstraction has 3639 states and 3996 transitions. [2018-10-23 20:28:17,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 20:28:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 3996 transitions. [2018-10-23 20:28:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-10-23 20:28:17,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:28:17,681 INFO L375 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:28:17,682 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:28:17,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:28:17,685 INFO L82 PathProgramCache]: Analyzing trace with hash -976634756, now seen corresponding path program 1 times [2018-10-23 20:28:17,685 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:28:17,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:28:17,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:17,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:28:17,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:28:18,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 835 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-10-23 20:28:18,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:28:18,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:28:18,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:28:18,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:28:18,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:28:18,164 INFO L87 Difference]: Start difference. First operand 3639 states and 3996 transitions. Second operand 4 states. [2018-10-23 20:28:19,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:28:19,389 INFO L93 Difference]: Finished difference Result 9245 states and 10428 transitions. [2018-10-23 20:28:19,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:28:19,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 603 [2018-10-23 20:28:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:28:19,412 INFO L225 Difference]: With dead ends: 9245 [2018-10-23 20:28:19,413 INFO L226 Difference]: Without dead ends: 5787 [2018-10-23 20:28:19,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:28:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5787 states. [2018-10-23 20:28:19,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5787 to 5787. [2018-10-23 20:28:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5787 states. [2018-10-23 20:28:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5787 states to 5787 states and 6398 transitions. [2018-10-23 20:28:19,496 INFO L78 Accepts]: Start accepts. Automaton has 5787 states and 6398 transitions. Word has length 603 [2018-10-23 20:28:19,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:28:19,497 INFO L481 AbstractCegarLoop]: Abstraction has 5787 states and 6398 transitions. [2018-10-23 20:28:19,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:28:19,497 INFO L276 IsEmpty]: Start isEmpty. Operand 5787 states and 6398 transitions. [2018-10-23 20:28:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-10-23 20:28:19,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:28:19,519 INFO L375 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, 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, 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, 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, 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] [2018-10-23 20:28:19,519 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:28:19,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:28:19,520 INFO L82 PathProgramCache]: Analyzing trace with hash 949822707, now seen corresponding path program 1 times [2018-10-23 20:28:19,520 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:28:19,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:28:19,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:19,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:28:19,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:28:20,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1298 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 1019 trivial. 0 not checked. [2018-10-23 20:28:20,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:28:20,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:28:20,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:28:20,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:28:20,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:28:20,054 INFO L87 Difference]: Start difference. First operand 5787 states and 6398 transitions. Second operand 4 states. [2018-10-23 20:28:21,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:28:21,567 INFO L93 Difference]: Finished difference Result 13004 states and 14454 transitions. [2018-10-23 20:28:21,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:28:21,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 689 [2018-10-23 20:28:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:28:21,594 INFO L225 Difference]: With dead ends: 13004 [2018-10-23 20:28:21,594 INFO L226 Difference]: Without dead ends: 7398 [2018-10-23 20:28:21,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:28:21,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7398 states. [2018-10-23 20:28:21,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7398 to 7219. [2018-10-23 20:28:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7219 states. [2018-10-23 20:28:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7219 states to 7219 states and 7848 transitions. [2018-10-23 20:28:21,694 INFO L78 Accepts]: Start accepts. Automaton has 7219 states and 7848 transitions. Word has length 689 [2018-10-23 20:28:21,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:28:21,695 INFO L481 AbstractCegarLoop]: Abstraction has 7219 states and 7848 transitions. [2018-10-23 20:28:21,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:28:21,695 INFO L276 IsEmpty]: Start isEmpty. Operand 7219 states and 7848 transitions. [2018-10-23 20:28:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2018-10-23 20:28:21,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:28:21,706 INFO L375 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, 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, 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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:28:21,707 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:28:21,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:28:21,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1433926491, now seen corresponding path program 1 times [2018-10-23 20:28:21,707 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:28:21,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:28:21,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:21,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:28:21,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:28:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1784 backedges. 1239 proven. 0 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2018-10-23 20:28:22,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:28:22,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:28:22,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:28:22,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:28:22,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:28:22,337 INFO L87 Difference]: Start difference. First operand 7219 states and 7848 transitions. Second operand 3 states. [2018-10-23 20:28:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:28:24,095 INFO L93 Difference]: Finished difference Result 16584 states and 18081 transitions. [2018-10-23 20:28:24,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:28:24,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 750 [2018-10-23 20:28:24,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:28:24,116 INFO L225 Difference]: With dead ends: 16584 [2018-10-23 20:28:24,116 INFO L226 Difference]: Without dead ends: 9546 [2018-10-23 20:28:24,123 INFO L605 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 [2018-10-23 20:28:24,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9546 states. [2018-10-23 20:28:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9546 to 9367. [2018-10-23 20:28:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9367 states. [2018-10-23 20:28:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9367 states to 9367 states and 10147 transitions. [2018-10-23 20:28:24,214 INFO L78 Accepts]: Start accepts. Automaton has 9367 states and 10147 transitions. Word has length 750 [2018-10-23 20:28:24,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:28:24,215 INFO L481 AbstractCegarLoop]: Abstraction has 9367 states and 10147 transitions. [2018-10-23 20:28:24,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:28:24,215 INFO L276 IsEmpty]: Start isEmpty. Operand 9367 states and 10147 transitions. [2018-10-23 20:28:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 925 [2018-10-23 20:28:24,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:28:24,231 INFO L375 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-23 20:28:24,231 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:28:24,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:28:24,232 INFO L82 PathProgramCache]: Analyzing trace with hash -518137389, now seen corresponding path program 1 times [2018-10-23 20:28:24,232 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:28:24,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:28:24,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:24,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:28:24,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:28:24,861 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-23 20:28:25,102 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-23 20:28:25,278 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-23 20:28:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2529 backedges. 1782 proven. 201 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2018-10-23 20:28:26,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:28:26,790 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-23 20:28:26,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:28:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:28:27,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:28:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2529 backedges. 1689 proven. 93 refuted. 0 times theorem prover too weak. 747 trivial. 0 not checked. [2018-10-23 20:28:28,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:28:28,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 [2018-10-23 20:28:28,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 20:28:28,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 20:28:28,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-10-23 20:28:28,241 INFO L87 Difference]: Start difference. First operand 9367 states and 10147 transitions. Second operand 9 states. [2018-10-23 20:28:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:28:31,333 INFO L93 Difference]: Finished difference Result 19396 states and 21040 transitions. [2018-10-23 20:28:31,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-23 20:28:31,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 924 [2018-10-23 20:28:31,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:28:31,368 INFO L225 Difference]: With dead ends: 19396 [2018-10-23 20:28:31,369 INFO L226 Difference]: Without dead ends: 10210 [2018-10-23 20:28:31,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 934 GetRequests, 923 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-10-23 20:28:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10210 states. [2018-10-23 20:28:31,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10210 to 9903. [2018-10-23 20:28:31,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9903 states. [2018-10-23 20:28:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9903 states to 9903 states and 10666 transitions. [2018-10-23 20:28:31,500 INFO L78 Accepts]: Start accepts. Automaton has 9903 states and 10666 transitions. Word has length 924 [2018-10-23 20:28:31,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:28:31,500 INFO L481 AbstractCegarLoop]: Abstraction has 9903 states and 10666 transitions. [2018-10-23 20:28:31,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 20:28:31,501 INFO L276 IsEmpty]: Start isEmpty. Operand 9903 states and 10666 transitions. [2018-10-23 20:28:31,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1003 [2018-10-23 20:28:31,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:28:31,517 INFO L375 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, 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, 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, 5, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-23 20:28:31,517 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:28:31,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:28:31,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1971508901, now seen corresponding path program 1 times [2018-10-23 20:28:31,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:28:31,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:28:31,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:31,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:28:31,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:28:32,365 WARN L179 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-10-23 20:28:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3125 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 1969 trivial. 0 not checked. [2018-10-23 20:28:33,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:28:33,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:28:33,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:28:33,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:28:33,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:28:33,062 INFO L87 Difference]: Start difference. First operand 9903 states and 10666 transitions. Second operand 4 states. [2018-10-23 20:28:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:28:34,626 INFO L93 Difference]: Finished difference Result 19625 states and 21150 transitions. [2018-10-23 20:28:34,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:28:34,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1002 [2018-10-23 20:28:34,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:28:34,643 INFO L225 Difference]: With dead ends: 19625 [2018-10-23 20:28:34,644 INFO L226 Difference]: Without dead ends: 9903 [2018-10-23 20:28:34,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:28:34,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9903 states. [2018-10-23 20:28:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9903 to 9903. [2018-10-23 20:28:34,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9903 states. [2018-10-23 20:28:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9903 states to 9903 states and 10490 transitions. [2018-10-23 20:28:34,764 INFO L78 Accepts]: Start accepts. Automaton has 9903 states and 10490 transitions. Word has length 1002 [2018-10-23 20:28:34,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:28:34,765 INFO L481 AbstractCegarLoop]: Abstraction has 9903 states and 10490 transitions. [2018-10-23 20:28:34,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:28:34,766 INFO L276 IsEmpty]: Start isEmpty. Operand 9903 states and 10490 transitions. [2018-10-23 20:28:34,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1079 [2018-10-23 20:28:34,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:28:34,787 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 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, 5, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-23 20:28:34,787 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:28:34,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:28:34,788 INFO L82 PathProgramCache]: Analyzing trace with hash 598154360, now seen corresponding path program 1 times [2018-10-23 20:28:34,788 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:28:34,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:28:34,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:34,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:28:34,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:28:35,599 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-23 20:28:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3785 backedges. 1288 proven. 0 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2018-10-23 20:28:36,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:28:36,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:28:36,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:28:36,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:28:36,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:28:36,690 INFO L87 Difference]: Start difference. First operand 9903 states and 10490 transitions. Second operand 4 states. [2018-10-23 20:28:38,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:28:38,208 INFO L93 Difference]: Finished difference Result 19625 states and 20798 transitions. [2018-10-23 20:28:38,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:28:38,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1078 [2018-10-23 20:28:38,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:28:38,228 INFO L225 Difference]: With dead ends: 19625 [2018-10-23 20:28:38,228 INFO L226 Difference]: Without dead ends: 9543 [2018-10-23 20:28:38,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:28:38,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9543 states. [2018-10-23 20:28:38,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9543 to 9185. [2018-10-23 20:28:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9185 states. [2018-10-23 20:28:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9185 states to 9185 states and 9571 transitions. [2018-10-23 20:28:38,346 INFO L78 Accepts]: Start accepts. Automaton has 9185 states and 9571 transitions. Word has length 1078 [2018-10-23 20:28:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:28:38,347 INFO L481 AbstractCegarLoop]: Abstraction has 9185 states and 9571 transitions. [2018-10-23 20:28:38,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:28:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 9185 states and 9571 transitions. [2018-10-23 20:28:38,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1127 [2018-10-23 20:28:38,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:28:38,367 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 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] [2018-10-23 20:28:38,367 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:28:38,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:28:38,368 INFO L82 PathProgramCache]: Analyzing trace with hash -830247680, now seen corresponding path program 1 times [2018-10-23 20:28:38,368 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:28:38,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:28:38,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:38,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:28:38,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:28:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4022 backedges. 2648 proven. 0 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2018-10-23 20:28:39,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:28:39,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 20:28:39,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:28:39,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:28:39,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:28:39,700 INFO L87 Difference]: Start difference. First operand 9185 states and 9571 transitions. Second operand 5 states. [2018-10-23 20:28:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:28:41,452 INFO L93 Difference]: Finished difference Result 19089 states and 19901 transitions. [2018-10-23 20:28:41,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:28:41,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1126 [2018-10-23 20:28:41,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:28:41,467 INFO L225 Difference]: With dead ends: 19089 [2018-10-23 20:28:41,468 INFO L226 Difference]: Without dead ends: 10085 [2018-10-23 20:28:41,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:28:41,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10085 states. [2018-10-23 20:28:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10085 to 9364. [2018-10-23 20:28:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9364 states. [2018-10-23 20:28:41,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9364 states to 9364 states and 9751 transitions. [2018-10-23 20:28:41,554 INFO L78 Accepts]: Start accepts. Automaton has 9364 states and 9751 transitions. Word has length 1126 [2018-10-23 20:28:41,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:28:41,554 INFO L481 AbstractCegarLoop]: Abstraction has 9364 states and 9751 transitions. [2018-10-23 20:28:41,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:28:41,555 INFO L276 IsEmpty]: Start isEmpty. Operand 9364 states and 9751 transitions. [2018-10-23 20:28:41,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1668 [2018-10-23 20:28:41,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:28:41,582 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:28:41,583 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:28:41,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:28:41,583 INFO L82 PathProgramCache]: Analyzing trace with hash -942637433, now seen corresponding path program 1 times [2018-10-23 20:28:41,583 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:28:41,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:28:41,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:41,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:28:41,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:28:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8851 backedges. 3726 proven. 504 refuted. 0 times theorem prover too weak. 4621 trivial. 0 not checked. [2018-10-23 20:28:44,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:28:44,462 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-23 20:28:44,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:28:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:28:44,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:28:45,778 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-23 20:28:46,128 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 26 [2018-10-23 20:28:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 8851 backedges. 3876 proven. 354 refuted. 0 times theorem prover too weak. 4621 trivial. 0 not checked. [2018-10-23 20:28:48,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:28:48,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-10-23 20:28:48,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-23 20:28:48,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-23 20:28:48,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-10-23 20:28:48,738 INFO L87 Difference]: Start difference. First operand 9364 states and 9751 transitions. Second operand 12 states. [2018-10-23 20:28:58,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:28:58,534 INFO L93 Difference]: Finished difference Result 20910 states and 21804 transitions. [2018-10-23 20:28:58,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-23 20:28:58,535 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1667 [2018-10-23 20:28:58,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:28:58,550 INFO L225 Difference]: With dead ends: 20910 [2018-10-23 20:28:58,550 INFO L226 Difference]: Without dead ends: 11529 [2018-10-23 20:28:58,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1691 GetRequests, 1672 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-10-23 20:28:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11529 states. [2018-10-23 20:28:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11529 to 11169. [2018-10-23 20:28:58,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11169 states. [2018-10-23 20:28:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11169 states to 11169 states and 11551 transitions. [2018-10-23 20:28:58,690 INFO L78 Accepts]: Start accepts. Automaton has 11169 states and 11551 transitions. Word has length 1667 [2018-10-23 20:28:58,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:28:58,692 INFO L481 AbstractCegarLoop]: Abstraction has 11169 states and 11551 transitions. [2018-10-23 20:28:58,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-23 20:28:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 11169 states and 11551 transitions. [2018-10-23 20:28:58,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1842 [2018-10-23 20:28:58,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:28:58,728 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 9, 9, 9, 9, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:28:58,729 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:28:58,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:28:58,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1395705905, now seen corresponding path program 1 times [2018-10-23 20:28:58,730 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:28:58,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:28:58,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:58,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:28:58,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:28:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:29:01,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10494 backedges. 4634 proven. 0 refuted. 0 times theorem prover too weak. 5860 trivial. 0 not checked. [2018-10-23 20:29:01,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:29:01,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:29:01,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:29:01,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:29:01,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:29:01,029 INFO L87 Difference]: Start difference. First operand 11169 states and 11551 transitions. Second operand 4 states. [2018-10-23 20:29:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:29:02,140 INFO L93 Difference]: Finished difference Result 23212 states and 23993 transitions. [2018-10-23 20:29:02,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:29:02,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1841 [2018-10-23 20:29:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:29:02,141 INFO L225 Difference]: With dead ends: 23212 [2018-10-23 20:29:02,141 INFO L226 Difference]: Without dead ends: 0 [2018-10-23 20:29:02,148 INFO L605 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 [2018-10-23 20:29:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-23 20:29:02,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-23 20:29:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-23 20:29:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-23 20:29:02,149 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1841 [2018-10-23 20:29:02,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:29:02,150 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-23 20:29:02,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:29:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-23 20:29:02,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-23 20:29:02,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-23 20:29:02,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,438 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 309 DAG size of output: 182 [2018-10-23 20:29:02,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:29:02,697 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 309 DAG size of output: 182 [2018-10-23 20:29:04,315 WARN L179 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 153 DAG size of output: 95 [2018-10-23 20:29:05,514 WARN L179 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 153 DAG size of output: 95 [2018-10-23 20:29:05,518 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-10-23 20:29:05,518 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-10-23 20:29:05,518 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,518 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,518 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,519 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-10-23 20:29:05,519 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-10-23 20:29:05,519 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-10-23 20:29:05,519 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-10-23 20:29:05,519 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-10-23 20:29:05,519 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-10-23 20:29:05,519 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-10-23 20:29:05,519 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-10-23 20:29:05,519 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,519 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,519 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,519 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-10-23 20:29:05,519 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-10-23 20:29:05,520 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-23 20:29:05,520 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-10-23 20:29:05,520 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-10-23 20:29:05,520 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-10-23 20:29:05,520 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-10-23 20:29:05,520 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-10-23 20:29:05,520 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,520 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,520 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,520 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-10-23 20:29:05,520 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-10-23 20:29:05,521 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-10-23 20:29:05,521 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-10-23 20:29:05,521 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-10-23 20:29:05,521 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-10-23 20:29:05,521 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-10-23 20:29:05,521 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-10-23 20:29:05,521 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-10-23 20:29:05,521 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,522 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,522 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,522 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-10-23 20:29:05,522 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-10-23 20:29:05,522 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-10-23 20:29:05,522 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-10-23 20:29:05,522 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-10-23 20:29:05,522 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-10-23 20:29:05,523 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-10-23 20:29:05,523 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,523 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,523 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,523 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-10-23 20:29:05,523 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-10-23 20:29:05,523 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-10-23 20:29:05,523 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-10-23 20:29:05,524 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-10-23 20:29:05,524 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-10-23 20:29:05,524 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-10-23 20:29:05,524 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-10-23 20:29:05,524 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-10-23 20:29:05,524 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,524 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,524 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,524 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-10-23 20:29:05,525 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-10-23 20:29:05,525 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-10-23 20:29:05,525 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-10-23 20:29:05,525 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-10-23 20:29:05,525 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-10-23 20:29:05,525 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-10-23 20:29:05,525 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-10-23 20:29:05,525 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,526 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,526 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,526 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-10-23 20:29:05,526 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-10-23 20:29:05,526 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-10-23 20:29:05,526 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-10-23 20:29:05,526 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-10-23 20:29:05,526 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-10-23 20:29:05,526 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-10-23 20:29:05,527 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-10-23 20:29:05,527 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,527 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,527 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,527 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-10-23 20:29:05,527 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-10-23 20:29:05,527 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-23 20:29:05,527 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-10-23 20:29:05,527 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-10-23 20:29:05,528 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-10-23 20:29:05,528 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-10-23 20:29:05,528 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-10-23 20:29:05,528 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-10-23 20:29:05,528 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,528 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,528 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,528 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-10-23 20:29:05,529 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-10-23 20:29:05,529 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-10-23 20:29:05,529 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-10-23 20:29:05,529 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-10-23 20:29:05,529 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-10-23 20:29:05,529 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-10-23 20:29:05,529 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-10-23 20:29:05,529 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,529 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,530 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,530 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-10-23 20:29:05,530 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-10-23 20:29:05,530 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-10-23 20:29:05,530 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-10-23 20:29:05,530 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-10-23 20:29:05,530 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-10-23 20:29:05,530 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-23 20:29:05,530 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-10-23 20:29:05,531 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-10-23 20:29:05,531 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,531 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,531 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,531 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-10-23 20:29:05,531 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-10-23 20:29:05,531 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-10-23 20:29:05,531 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-10-23 20:29:05,531 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-10-23 20:29:05,532 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-10-23 20:29:05,532 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-10-23 20:29:05,532 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-10-23 20:29:05,532 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,532 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,532 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,532 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-10-23 20:29:05,532 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-10-23 20:29:05,533 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-10-23 20:29:05,533 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-10-23 20:29:05,533 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-10-23 20:29:05,533 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-10-23 20:29:05,533 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-10-23 20:29:05,533 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-10-23 20:29:05,533 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,533 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,533 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-10-23 20:29:05,533 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-10-23 20:29:05,534 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-10-23 20:29:05,534 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-10-23 20:29:05,534 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-10-23 20:29:05,534 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-10-23 20:29:05,534 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-10-23 20:29:05,534 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-10-23 20:29:05,534 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,534 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,534 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-10-23 20:29:05,535 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-10-23 20:29:05,535 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-10-23 20:29:05,535 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-10-23 20:29:05,535 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-10-23 20:29:05,535 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-10-23 20:29:05,535 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,535 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,536 INFO L421 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse14 (= ~a21~0 7)) (.cse0 (= ~a24~0 1)) (.cse15 (= ~a15~0 8)) (.cse21 (+ ~a12~0 43))) (let ((.cse1 (<= ~a12~0 72)) (.cse4 (<= 19 ~a12~0)) (.cse11 (<= 9 ~a15~0)) (.cse16 (< 0 .cse21)) (.cse5 (= ~a15~0 5)) (.cse10 (<= ~a12~0 11)) (.cse18 (<= ~a12~0 95434)) (.cse2 (not .cse15)) (.cse19 (<= (+ ~a12~0 49) 0)) (.cse7 (<= ~a21~0 6)) (.cse13 (< 80 ~a12~0)) (.cse9 (= ~a21~0 10)) (.cse6 (= ~a15~0 7)) (.cse20 (or (< 11 ~a12~0) (and .cse0 (or (<= .cse21 0) .cse15)))) (.cse3 (<= ~a15~0 8)) (.cse17 (not .cse14)) (.cse12 (= ~a21~0 8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~a21~0 6) .cse0 .cse5) (and .cse6 .cse0 .cse7) (and (exists ((v_prenex_2 Int)) (let ((.cse8 (* 9 v_prenex_2))) (and (<= 0 .cse8) (< 80 v_prenex_2) (<= (+ ~a12~0 546123) (div .cse8 10)) (<= v_prenex_2 95434)))) .cse6 .cse0) (and .cse0 .cse9 .cse10) (and (or (and .cse11 .cse12 .cse13) (and .cse11 .cse14 .cse13)) .cse0) (and .cse15 .cse0 .cse10 .cse16) (and .cse0 .cse2 .cse13 (= ~a21~0 9)) (and .cse0 .cse12 (<= (+ ~a12~0 526767) 0)) (and .cse0 .cse12 .cse1 .cse4) (and .cse0 .cse11 .cse12 .cse10 .cse16) (and (not .cse5) .cse0 .cse10 .cse3 .cse17) (and .cse15 .cse0 .cse7) (and .cse18 (<= 95381 ~a12~0) .cse0 .cse7) (and .cse15 .cse0 .cse19) (and .cse18 .cse0 .cse20 .cse3 .cse7) (and .cse2 (or (and .cse3 .cse19 .cse7) (and .cse0 .cse9 .cse13))) (and .cse0 .cse9 .cse3) (and .cse6 .cse0 .cse12) (and (<= ~a12~0 80) .cse0 .cse20 .cse3 .cse17) (and (<= ~a12~0 73282) .cse15 .cse0 .cse12)))) [2018-10-23 20:29:05,536 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-10-23 20:29:05,536 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-10-23 20:29:05,536 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-10-23 20:29:05,536 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-10-23 20:29:05,536 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-10-23 20:29:05,537 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-10-23 20:29:05,537 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-10-23 20:29:05,537 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-10-23 20:29:05,537 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,537 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-10-23 20:29:05,537 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,537 INFO L428 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-10-23 20:29:05,537 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-10-23 20:29:05,538 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-10-23 20:29:05,538 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-10-23 20:29:05,538 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-10-23 20:29:05,538 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-10-23 20:29:05,538 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-10-23 20:29:05,538 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-10-23 20:29:05,538 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,538 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,538 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-10-23 20:29:05,538 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-10-23 20:29:05,539 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-10-23 20:29:05,539 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-10-23 20:29:05,539 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-23 20:29:05,539 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-10-23 20:29:05,539 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-10-23 20:29:05,539 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,539 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,539 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-10-23 20:29:05,539 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,539 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-10-23 20:29:05,540 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-10-23 20:29:05,540 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse14 (= ~a21~0 7)) (.cse0 (= ~a24~0 1)) (.cse15 (= ~a15~0 8)) (.cse21 (+ ~a12~0 43))) (let ((.cse1 (<= ~a12~0 72)) (.cse4 (<= 19 ~a12~0)) (.cse11 (<= 9 ~a15~0)) (.cse16 (< 0 .cse21)) (.cse5 (= ~a15~0 5)) (.cse10 (<= ~a12~0 11)) (.cse18 (<= ~a12~0 95434)) (.cse2 (not .cse15)) (.cse19 (<= (+ ~a12~0 49) 0)) (.cse7 (<= ~a21~0 6)) (.cse13 (< 80 ~a12~0)) (.cse9 (= ~a21~0 10)) (.cse6 (= ~a15~0 7)) (.cse20 (or (< 11 ~a12~0) (and .cse0 (or (<= .cse21 0) .cse15)))) (.cse3 (<= ~a15~0 8)) (.cse17 (not .cse14)) (.cse12 (= ~a21~0 8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~a21~0 6) .cse0 .cse5) (and .cse6 .cse0 .cse7) (and (exists ((v_prenex_2 Int)) (let ((.cse8 (* 9 v_prenex_2))) (and (<= 0 .cse8) (< 80 v_prenex_2) (<= (+ ~a12~0 546123) (div .cse8 10)) (<= v_prenex_2 95434)))) .cse6 .cse0) (and .cse0 .cse9 .cse10) (and (or (and .cse11 .cse12 .cse13) (and .cse11 .cse14 .cse13)) .cse0) (and .cse15 .cse0 .cse10 .cse16) (and .cse0 .cse2 .cse13 (= ~a21~0 9)) (and .cse0 .cse12 (<= (+ ~a12~0 526767) 0)) (and .cse0 .cse12 .cse1 .cse4) (and .cse0 .cse11 .cse12 .cse10 .cse16) (and (not .cse5) .cse0 .cse10 .cse3 .cse17) (and .cse15 .cse0 .cse7) (and .cse18 (<= 95381 ~a12~0) .cse0 .cse7) (and .cse15 .cse0 .cse19) (and .cse18 .cse0 .cse20 .cse3 .cse7) (and .cse2 (or (and .cse3 .cse19 .cse7) (and .cse0 .cse9 .cse13))) (and .cse0 .cse9 .cse3) (and .cse6 .cse0 .cse12) (and (<= ~a12~0 80) .cse0 .cse20 .cse3 .cse17) (and (<= ~a12~0 73282) .cse15 .cse0 .cse12)))) [2018-10-23 20:29:05,540 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-10-23 20:29:05,540 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-10-23 20:29:05,540 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-10-23 20:29:05,540 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-10-23 20:29:05,541 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-23 20:29:05,541 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-10-23 20:29:05,541 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-10-23 20:29:05,541 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-10-23 20:29:05,541 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-10-23 20:29:05,541 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,541 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,541 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,541 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-10-23 20:29:05,541 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-10-23 20:29:05,541 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-10-23 20:29:05,542 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-23 20:29:05,542 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-10-23 20:29:05,542 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-10-23 20:29:05,542 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-10-23 20:29:05,542 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-10-23 20:29:05,542 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-10-23 20:29:05,542 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,542 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,542 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,542 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-10-23 20:29:05,543 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-10-23 20:29:05,543 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-10-23 20:29:05,543 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-10-23 20:29:05,543 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-23 20:29:05,543 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-23 20:29:05,543 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-10-23 20:29:05,543 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-10-23 20:29:05,543 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-10-23 20:29:05,543 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,543 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,544 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,544 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-10-23 20:29:05,544 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-10-23 20:29:05,544 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-10-23 20:29:05,544 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-10-23 20:29:05,544 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-10-23 20:29:05,544 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-10-23 20:29:05,544 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-10-23 20:29:05,544 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-10-23 20:29:05,544 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-10-23 20:29:05,544 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,545 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,545 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-10-23 20:29:05,545 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-10-23 20:29:05,545 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-10-23 20:29:05,545 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-23 20:29:05,545 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-23 20:29:05,545 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-10-23 20:29:05,553 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,554 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,555 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,555 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,570 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,571 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,571 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,571 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,578 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,579 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,579 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,579 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,585 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,585 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,585 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,586 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:29:05 BoogieIcfgContainer [2018-10-23 20:29:05,598 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 20:29:05,599 INFO L168 Benchmark]: Toolchain (without parser) took 87720.19 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-23 20:29:05,600 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 20:29:05,601 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-10-23 20:29:05,601 INFO L168 Benchmark]: Boogie Procedure Inliner took 225.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -849.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2018-10-23 20:29:05,603 INFO L168 Benchmark]: Boogie Preprocessor took 106.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-10-23 20:29:05,605 INFO L168 Benchmark]: RCFGBuilder took 3444.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 129.8 MB). Peak memory consumption was 129.8 MB. Max. memory is 7.1 GB. [2018-10-23 20:29:05,606 INFO L168 Benchmark]: TraceAbstraction took 83135.15 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 905.9 MB. Max. memory is 7.1 GB. [2018-10-23 20:29:05,617 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 802.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 225.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -849.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3444.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 129.8 MB). Peak memory consumption was 129.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 83135.15 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 905.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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 [2018-10-23 20:29:05,633 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,634 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,634 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,634 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,636 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,636 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,637 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,637 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((a24 == 1 && a12 <= 72) && !(a15 == 8)) && a15 <= 8) && 19 <= a12) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((a15 == 7 && a24 == 1) && a21 <= 6)) || (((\exists v_prenex_2 : int :: ((0 <= 9 * v_prenex_2 && 80 < v_prenex_2) && a12 + 546123 <= 9 * v_prenex_2 / 10) && v_prenex_2 <= 95434) && a15 == 7) && a24 == 1)) || ((a24 == 1 && a21 == 10) && a12 <= 11)) || ((((9 <= a15 && a21 == 8) && 80 < a12) || ((9 <= a15 && a21 == 7) && 80 < a12)) && a24 == 1)) || (((a15 == 8 && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && !(a15 == 8)) && 80 < a12) && a21 == 9)) || ((a24 == 1 && a21 == 8) && a12 + 526767 <= 0)) || (((a24 == 1 && a21 == 8) && a12 <= 72) && 19 <= a12)) || ((((a24 == 1 && 9 <= a15) && a21 == 8) && a12 <= 11) && 0 < a12 + 43)) || ((((!(a15 == 5) && a24 == 1) && a12 <= 11) && a15 <= 8) && !(a21 == 7))) || ((a15 == 8 && a24 == 1) && a21 <= 6)) || (((a12 <= 95434 && 95381 <= a12) && a24 == 1) && a21 <= 6)) || ((a15 == 8 && a24 == 1) && a12 + 49 <= 0)) || ((((a12 <= 95434 && a24 == 1) && (11 < a12 || (a24 == 1 && (a12 + 43 <= 0 || a15 == 8)))) && a15 <= 8) && a21 <= 6)) || (!(a15 == 8) && (((a15 <= 8 && a12 + 49 <= 0) && a21 <= 6) || ((a24 == 1 && a21 == 10) && 80 < a12)))) || ((a24 == 1 && a21 == 10) && a15 <= 8)) || ((a15 == 7 && a24 == 1) && a21 == 8)) || ((((a12 <= 80 && a24 == 1) && (11 < a12 || (a24 == 1 && (a12 + 43 <= 0 || a15 == 8)))) && a15 <= 8) && !(a21 == 7))) || (((a12 <= 73282 && a15 == 8) && a24 == 1) && a21 == 8) - InvariantResult [Line: 20]: Loop Invariant [2018-10-23 20:29:05,639 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,639 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,639 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,640 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,641 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,641 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,642 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-23 20:29:05,642 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((a24 == 1 && a12 <= 72) && !(a15 == 8)) && a15 <= 8) && 19 <= a12) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((a15 == 7 && a24 == 1) && a21 <= 6)) || (((\exists v_prenex_2 : int :: ((0 <= 9 * v_prenex_2 && 80 < v_prenex_2) && a12 + 546123 <= 9 * v_prenex_2 / 10) && v_prenex_2 <= 95434) && a15 == 7) && a24 == 1)) || ((a24 == 1 && a21 == 10) && a12 <= 11)) || ((((9 <= a15 && a21 == 8) && 80 < a12) || ((9 <= a15 && a21 == 7) && 80 < a12)) && a24 == 1)) || (((a15 == 8 && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && !(a15 == 8)) && 80 < a12) && a21 == 9)) || ((a24 == 1 && a21 == 8) && a12 + 526767 <= 0)) || (((a24 == 1 && a21 == 8) && a12 <= 72) && 19 <= a12)) || ((((a24 == 1 && 9 <= a15) && a21 == 8) && a12 <= 11) && 0 < a12 + 43)) || ((((!(a15 == 5) && a24 == 1) && a12 <= 11) && a15 <= 8) && !(a21 == 7))) || ((a15 == 8 && a24 == 1) && a21 <= 6)) || (((a12 <= 95434 && 95381 <= a12) && a24 == 1) && a21 <= 6)) || ((a15 == 8 && a24 == 1) && a12 + 49 <= 0)) || ((((a12 <= 95434 && a24 == 1) && (11 < a12 || (a24 == 1 && (a12 + 43 <= 0 || a15 == 8)))) && a15 <= 8) && a21 <= 6)) || (!(a15 == 8) && (((a15 <= 8 && a12 + 49 <= 0) && a21 <= 6) || ((a24 == 1 && a21 == 10) && 80 < a12)))) || ((a24 == 1 && a21 == 10) && a15 <= 8)) || ((a15 == 7 && a24 == 1) && a21 == 8)) || ((((a12 <= 80 && a24 == 1) && (11 < a12 || (a24 == 1 && (a12 + 43 <= 0 || a15 == 8)))) && a15 <= 8) && !(a21 == 7))) || (((a12 <= 73282 && a15 == 8) && a24 == 1) && a21 == 8) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 246 locations, 1 error locations. SAFE Result, 83.0s OverallTime, 15 OverallIterations, 15 TraceHistogramMax, 53.5s AutomataDifference, 0.0s DeadEndRemovalTime, 3.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 2395 SDtfs, 9387 SDslu, 2308 SDs, 0 SdLazy, 29982 SolverSat, 2984 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3310 GetRequests, 3229 SyntacticMatches, 7 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11169occurred in iteration=14, 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: 1.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 4479 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 168 NumberOfFragments, 699 HoareAnnotationTreeSize, 3 FomulaSimplifications, 11456 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3758 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 14489 NumberOfCodeBlocks, 14489 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 14470 ConstructedInterpolants, 18 QuantifiedInterpolants, 43827101 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3919 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 49761/50964 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...