java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label35_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 02:34:52,280 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 02:34:52,282 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 02:34:52,294 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 02:34:52,294 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 02:34:52,296 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 02:34:52,297 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 02:34:52,299 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 02:34:52,301 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 02:34:52,302 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 02:34:52,302 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 02:34:52,303 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 02:34:52,304 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 02:34:52,305 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 02:34:52,306 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 02:34:52,307 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 02:34:52,308 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 02:34:52,310 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 02:34:52,312 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 02:34:52,313 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 02:34:52,315 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 02:34:52,316 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 02:34:52,318 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 02:34:52,319 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 02:34:52,319 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 02:34:52,320 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 02:34:52,321 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 02:34:52,322 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 02:34:52,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 02:34:52,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 02:34:52,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 02:34:52,325 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 02:34:52,325 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 02:34:52,325 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 02:34:52,326 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 02:34:52,327 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 02:34:52,328 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-24 02:34:52,344 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 02:34:52,344 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 02:34:52,345 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 02:34:52,346 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 02:34:52,346 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 02:34:52,347 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 02:34:52,347 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 02:34:52,348 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 02:34:52,348 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 02:34:52,348 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 02:34:52,348 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 02:34:52,349 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 02:34:52,349 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 02:34:52,349 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 02:34:52,349 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 02:34:52,350 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 02:34:52,350 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 02:34:52,350 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 02:34:52,350 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 02:34:52,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 02:34:52,351 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 02:34:52,351 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 02:34:52,351 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 02:34:52,351 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 02:34:52,353 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 02:34:52,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 02:34:52,353 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 02:34:52,353 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 02:34:52,420 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 02:34:52,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 02:34:52,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 02:34:52,446 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 02:34:52,446 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 02:34:52,447 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label35_true-unreach-call.c [2018-07-24 02:34:52,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae44e7b4/a202ac41605e44458f9c33d6dd81a5ca/FLAGfff036cdc [2018-07-24 02:34:53,133 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 02:34:53,136 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label35_true-unreach-call.c [2018-07-24 02:34:53,155 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae44e7b4/a202ac41605e44458f9c33d6dd81a5ca/FLAGfff036cdc [2018-07-24 02:34:53,172 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae44e7b4/a202ac41605e44458f9c33d6dd81a5ca [2018-07-24 02:34:53,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 02:34:53,185 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 02:34:53,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 02:34:53,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 02:34:53,196 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 02:34:53,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 02:34:53" (1/1) ... [2018-07-24 02:34:53,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@168740bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:34:53, skipping insertion in model container [2018-07-24 02:34:53,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 02:34:53" (1/1) ... [2018-07-24 02:34:53,433 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 02:34:53,895 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 02:34:53,913 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 02:34:54,098 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 02:34:54,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:34:54 WrapperNode [2018-07-24 02:34:54,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 02:34:54,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 02:34:54,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 02:34:54,175 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 02:34:54,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:34:54" (1/1) ... [2018-07-24 02:34:54,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:34:54" (1/1) ... [2018-07-24 02:34:54,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 02:34:54,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 02:34:54,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 02:34:54,358 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 02:34:54,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:34:54" (1/1) ... [2018-07-24 02:34:54,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:34:54" (1/1) ... [2018-07-24 02:34:54,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:34:54" (1/1) ... [2018-07-24 02:34:54,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:34:54" (1/1) ... [2018-07-24 02:34:54,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:34:54" (1/1) ... [2018-07-24 02:34:54,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:34:54" (1/1) ... [2018-07-24 02:34:54,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:34:54" (1/1) ... [2018-07-24 02:34:54,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 02:34:54,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 02:34:54,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 02:34:54,732 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 02:34:54,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:34:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 02:34:54,801 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 02:34:54,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 02:34:54,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 02:34:58,859 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 02:34:58,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 02:34:58 BoogieIcfgContainer [2018-07-24 02:34:58,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 02:34:58,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 02:34:58,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 02:34:58,866 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 02:34:58,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 02:34:53" (1/3) ... [2018-07-24 02:34:58,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b94f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 02:34:58, skipping insertion in model container [2018-07-24 02:34:58,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:34:54" (2/3) ... [2018-07-24 02:34:58,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b94f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 02:34:58, skipping insertion in model container [2018-07-24 02:34:58,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 02:34:58" (3/3) ... [2018-07-24 02:34:58,870 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label35_true-unreach-call.c [2018-07-24 02:34:58,880 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 02:34:58,889 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 02:34:58,941 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 02:34:58,942 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 02:34:58,942 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 02:34:58,942 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 02:34:58,942 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 02:34:58,942 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 02:34:58,943 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 02:34:58,943 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 02:34:58,943 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 02:34:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-07-24 02:34:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-24 02:34:58,983 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:34:58,984 INFO L353 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, 1] [2018-07-24 02:34:58,984 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:34:58,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1281577798, now seen corresponding path program 1 times [2018-07-24 02:34:58,992 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:34:58,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:34:59,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:34:59,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:34:59,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:34:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:34:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 02:34:59,535 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:34:59,536 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 02:34:59,542 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:34:59,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:34:59,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:34:59,563 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-07-24 02:35:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:35:03,061 INFO L93 Difference]: Finished difference Result 974 states and 1747 transitions. [2018-07-24 02:35:03,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:35:03,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-07-24 02:35:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:35:03,087 INFO L225 Difference]: With dead ends: 974 [2018-07-24 02:35:03,087 INFO L226 Difference]: Without dead ends: 683 [2018-07-24 02:35:03,092 INFO L573 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-07-24 02:35:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-07-24 02:35:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 677. [2018-07-24 02:35:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-07-24 02:35:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1087 transitions. [2018-07-24 02:35:03,197 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1087 transitions. Word has length 59 [2018-07-24 02:35:03,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:35:03,198 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 1087 transitions. [2018-07-24 02:35:03,198 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:35:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1087 transitions. [2018-07-24 02:35:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-24 02:35:03,205 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:35:03,205 INFO L353 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:35:03,206 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:35:03,206 INFO L82 PathProgramCache]: Analyzing trace with hash -918079649, now seen corresponding path program 1 times [2018-07-24 02:35:03,206 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:35:03,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:35:03,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:03,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:35:03,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:35:03,788 WARN L169 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-07-24 02:35:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 02:35:03,840 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:35:03,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 02:35:03,843 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:35:03,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:35:03,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:35:03,844 INFO L87 Difference]: Start difference. First operand 677 states and 1087 transitions. Second operand 4 states. [2018-07-24 02:35:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:35:07,648 INFO L93 Difference]: Finished difference Result 1929 states and 3026 transitions. [2018-07-24 02:35:07,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:35:07,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-07-24 02:35:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:35:07,657 INFO L225 Difference]: With dead ends: 1929 [2018-07-24 02:35:07,657 INFO L226 Difference]: Without dead ends: 1254 [2018-07-24 02:35:07,661 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-07-24 02:35:07,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2018-07-24 02:35:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1052. [2018-07-24 02:35:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2018-07-24 02:35:07,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1571 transitions. [2018-07-24 02:35:07,691 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1571 transitions. Word has length 129 [2018-07-24 02:35:07,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:35:07,692 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1571 transitions. [2018-07-24 02:35:07,692 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:35:07,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1571 transitions. [2018-07-24 02:35:07,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-07-24 02:35:07,701 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:35:07,701 INFO L353 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:35:07,701 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:35:07,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1089735070, now seen corresponding path program 1 times [2018-07-24 02:35:07,702 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:35:07,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:35:07,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:07,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:35:07,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:35:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 02:35:08,148 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:35:08,148 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 02:35:08,149 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:35:08,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:35:08,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:35:08,149 INFO L87 Difference]: Start difference. First operand 1052 states and 1571 transitions. Second operand 4 states. [2018-07-24 02:35:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:35:11,637 INFO L93 Difference]: Finished difference Result 3972 states and 6032 transitions. [2018-07-24 02:35:11,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:35:11,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-07-24 02:35:11,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:35:11,665 INFO L225 Difference]: With dead ends: 3972 [2018-07-24 02:35:11,665 INFO L226 Difference]: Without dead ends: 2733 [2018-07-24 02:35:11,669 INFO L573 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-07-24 02:35:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2018-07-24 02:35:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2716. [2018-07-24 02:35:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2018-07-24 02:35:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3839 transitions. [2018-07-24 02:35:11,730 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 3839 transitions. Word has length 203 [2018-07-24 02:35:11,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:35:11,731 INFO L471 AbstractCegarLoop]: Abstraction has 2716 states and 3839 transitions. [2018-07-24 02:35:11,731 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:35:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3839 transitions. [2018-07-24 02:35:11,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-07-24 02:35:11,736 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:35:11,737 INFO L353 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, 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, 1, 1, 1, 1, 1, 1, 1, 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-07-24 02:35:11,737 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:35:11,737 INFO L82 PathProgramCache]: Analyzing trace with hash -366741423, now seen corresponding path program 1 times [2018-07-24 02:35:11,737 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:35:11,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:35:11,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:11,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:35:11,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:35:12,160 WARN L169 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-07-24 02:35:12,528 WARN L169 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-07-24 02:35:12,923 WARN L169 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2018-07-24 02:35:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 02:35:13,091 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:35:13,091 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-24 02:35:13,092 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-24 02:35:13,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-24 02:35:13,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-07-24 02:35:13,092 INFO L87 Difference]: Start difference. First operand 2716 states and 3839 transitions. Second operand 8 states. [2018-07-24 02:35:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:35:18,160 INFO L93 Difference]: Finished difference Result 5675 states and 7945 transitions. [2018-07-24 02:35:18,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-24 02:35:18,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 219 [2018-07-24 02:35:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:35:18,176 INFO L225 Difference]: With dead ends: 5675 [2018-07-24 02:35:18,177 INFO L226 Difference]: Without dead ends: 2961 [2018-07-24 02:35:18,180 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-07-24 02:35:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2018-07-24 02:35:18,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2901. [2018-07-24 02:35:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2901 states. [2018-07-24 02:35:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 4030 transitions. [2018-07-24 02:35:18,238 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 4030 transitions. Word has length 219 [2018-07-24 02:35:18,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:35:18,239 INFO L471 AbstractCegarLoop]: Abstraction has 2901 states and 4030 transitions. [2018-07-24 02:35:18,239 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-24 02:35:18,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 4030 transitions. [2018-07-24 02:35:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-07-24 02:35:18,244 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:35:18,245 INFO L353 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 02:35:18,245 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:35:18,245 INFO L82 PathProgramCache]: Analyzing trace with hash 518360779, now seen corresponding path program 1 times [2018-07-24 02:35:18,245 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:35:18,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:35:18,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:18,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:35:18,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:35:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-07-24 02:35:18,664 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 02:35:18,664 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 02:35:18,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:35:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:35:18,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 02:35:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-07-24 02:35:18,962 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 02:35:18,962 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-07-24 02:35:18,963 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:35:18,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:35:18,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:35:18,964 INFO L87 Difference]: Start difference. First operand 2901 states and 4030 transitions. Second operand 4 states. [2018-07-24 02:35:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:35:23,182 INFO L93 Difference]: Finished difference Result 8582 states and 12136 transitions. [2018-07-24 02:35:23,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:35:23,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2018-07-24 02:35:23,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:35:23,215 INFO L225 Difference]: With dead ends: 8582 [2018-07-24 02:35:23,215 INFO L226 Difference]: Without dead ends: 5868 [2018-07-24 02:35:23,220 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 258 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-07-24 02:35:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5868 states. [2018-07-24 02:35:23,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5868 to 5497. [2018-07-24 02:35:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5497 states. [2018-07-24 02:35:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5497 states to 5497 states and 7095 transitions. [2018-07-24 02:35:23,327 INFO L78 Accepts]: Start accepts. Automaton has 5497 states and 7095 transitions. Word has length 258 [2018-07-24 02:35:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:35:23,327 INFO L471 AbstractCegarLoop]: Abstraction has 5497 states and 7095 transitions. [2018-07-24 02:35:23,328 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:35:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 5497 states and 7095 transitions. [2018-07-24 02:35:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-07-24 02:35:23,337 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:35:23,337 INFO L353 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 02:35:23,338 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:35:23,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1341410710, now seen corresponding path program 1 times [2018-07-24 02:35:23,338 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:35:23,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:35:23,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:23,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:35:23,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:35:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-07-24 02:35:23,608 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:35:23,608 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 02:35:23,609 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 02:35:23,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 02:35:23,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 02:35:23,610 INFO L87 Difference]: Start difference. First operand 5497 states and 7095 transitions. Second operand 3 states. [2018-07-24 02:35:25,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:35:25,530 INFO L93 Difference]: Finished difference Result 13026 states and 17120 transitions. [2018-07-24 02:35:25,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 02:35:25,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 275 [2018-07-24 02:35:25,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:35:25,559 INFO L225 Difference]: With dead ends: 13026 [2018-07-24 02:35:25,559 INFO L226 Difference]: Without dead ends: 6772 [2018-07-24 02:35:25,567 INFO L573 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-07-24 02:35:25,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6772 states. [2018-07-24 02:35:25,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6772 to 6587. [2018-07-24 02:35:25,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6587 states. [2018-07-24 02:35:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6587 states to 6587 states and 8233 transitions. [2018-07-24 02:35:25,687 INFO L78 Accepts]: Start accepts. Automaton has 6587 states and 8233 transitions. Word has length 275 [2018-07-24 02:35:25,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:35:25,687 INFO L471 AbstractCegarLoop]: Abstraction has 6587 states and 8233 transitions. [2018-07-24 02:35:25,687 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 02:35:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 6587 states and 8233 transitions. [2018-07-24 02:35:25,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-07-24 02:35:25,698 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:35:25,699 INFO L353 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 02:35:25,699 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:35:25,699 INFO L82 PathProgramCache]: Analyzing trace with hash 711062946, now seen corresponding path program 1 times [2018-07-24 02:35:25,699 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:35:25,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:35:25,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:25,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:35:25,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:35:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 02:35:26,226 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:35:26,226 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 02:35:26,227 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 02:35:26,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 02:35:26,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 02:35:26,228 INFO L87 Difference]: Start difference. First operand 6587 states and 8233 transitions. Second operand 5 states. [2018-07-24 02:35:29,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:35:29,940 INFO L93 Difference]: Finished difference Result 19124 states and 24169 transitions. [2018-07-24 02:35:29,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 02:35:29,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 286 [2018-07-24 02:35:29,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:35:29,992 INFO L225 Difference]: With dead ends: 19124 [2018-07-24 02:35:29,992 INFO L226 Difference]: Without dead ends: 12537 [2018-07-24 02:35:30,003 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-07-24 02:35:30,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12537 states. [2018-07-24 02:35:30,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12537 to 9928. [2018-07-24 02:35:30,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9928 states. [2018-07-24 02:35:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9928 states to 9928 states and 12296 transitions. [2018-07-24 02:35:30,174 INFO L78 Accepts]: Start accepts. Automaton has 9928 states and 12296 transitions. Word has length 286 [2018-07-24 02:35:30,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:35:30,174 INFO L471 AbstractCegarLoop]: Abstraction has 9928 states and 12296 transitions. [2018-07-24 02:35:30,174 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 02:35:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 9928 states and 12296 transitions. [2018-07-24 02:35:30,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-07-24 02:35:30,190 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:35:30,191 INFO L353 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, 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, 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] [2018-07-24 02:35:30,191 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:35:30,191 INFO L82 PathProgramCache]: Analyzing trace with hash 381429514, now seen corresponding path program 1 times [2018-07-24 02:35:30,191 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:35:30,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:35:30,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:30,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:35:30,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:35:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-07-24 02:35:30,542 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:35:30,542 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 02:35:30,543 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 02:35:30,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 02:35:30,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 02:35:30,544 INFO L87 Difference]: Start difference. First operand 9928 states and 12296 transitions. Second operand 3 states. [2018-07-24 02:35:32,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:35:32,971 INFO L93 Difference]: Finished difference Result 19849 states and 24809 transitions. [2018-07-24 02:35:32,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 02:35:32,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2018-07-24 02:35:32,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:35:32,991 INFO L225 Difference]: With dead ends: 19849 [2018-07-24 02:35:32,991 INFO L226 Difference]: Without dead ends: 11038 [2018-07-24 02:35:33,003 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07-24 02:35:33,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11038 states. [2018-07-24 02:35:33,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11038 to 10853. [2018-07-24 02:35:33,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10853 states. [2018-07-24 02:35:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10853 states to 10853 states and 13246 transitions. [2018-07-24 02:35:33,147 INFO L78 Accepts]: Start accepts. Automaton has 10853 states and 13246 transitions. Word has length 352 [2018-07-24 02:35:33,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:35:33,147 INFO L471 AbstractCegarLoop]: Abstraction has 10853 states and 13246 transitions. [2018-07-24 02:35:33,148 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 02:35:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 10853 states and 13246 transitions. [2018-07-24 02:35:33,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-07-24 02:35:33,166 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:35:33,166 INFO L353 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, 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, 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] [2018-07-24 02:35:33,166 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:35:33,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1497993958, now seen corresponding path program 1 times [2018-07-24 02:35:33,167 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:35:33,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:35:33,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:33,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:35:33,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:35:33,515 WARN L169 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-07-24 02:35:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 388 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-07-24 02:35:33,581 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:35:33,582 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 02:35:33,582 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:35:33,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:35:33,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:35:33,583 INFO L87 Difference]: Start difference. First operand 10853 states and 13246 transitions. Second operand 4 states. [2018-07-24 02:35:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:35:35,637 INFO L93 Difference]: Finished difference Result 27645 states and 33952 transitions. [2018-07-24 02:35:35,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:35:35,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2018-07-24 02:35:35,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:35:35,666 INFO L225 Difference]: With dead ends: 27645 [2018-07-24 02:35:35,666 INFO L226 Difference]: Without dead ends: 17164 [2018-07-24 02:35:35,681 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:35:35,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17164 states. [2018-07-24 02:35:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17164 to 16033. [2018-07-24 02:35:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16033 states. [2018-07-24 02:35:35,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16033 states to 16033 states and 19146 transitions. [2018-07-24 02:35:35,890 INFO L78 Accepts]: Start accepts. Automaton has 16033 states and 19146 transitions. Word has length 373 [2018-07-24 02:35:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:35:35,890 INFO L471 AbstractCegarLoop]: Abstraction has 16033 states and 19146 transitions. [2018-07-24 02:35:35,891 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:35:35,891 INFO L276 IsEmpty]: Start isEmpty. Operand 16033 states and 19146 transitions. [2018-07-24 02:35:35,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-07-24 02:35:35,913 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:35:35,913 INFO L353 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, 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, 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-07-24 02:35:35,913 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:35:35,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1563480614, now seen corresponding path program 1 times [2018-07-24 02:35:35,914 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:35:35,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:35:35,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:35,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:35:35,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:35:36,518 WARN L169 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-07-24 02:35:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-07-24 02:35:36,616 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:35:36,616 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 02:35:36,617 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:35:36,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:35:36,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:35:36,617 INFO L87 Difference]: Start difference. First operand 16033 states and 19146 transitions. Second operand 4 states. [2018-07-24 02:35:38,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:35:38,680 INFO L93 Difference]: Finished difference Result 33548 states and 40110 transitions. [2018-07-24 02:35:38,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:35:38,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 383 [2018-07-24 02:35:38,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:35:38,702 INFO L225 Difference]: With dead ends: 33548 [2018-07-24 02:35:38,702 INFO L226 Difference]: Without dead ends: 17143 [2018-07-24 02:35:38,722 INFO L573 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-07-24 02:35:38,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17143 states. [2018-07-24 02:35:38,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17143 to 16399. [2018-07-24 02:35:38,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16399 states. [2018-07-24 02:35:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16399 states to 16399 states and 19036 transitions. [2018-07-24 02:35:38,917 INFO L78 Accepts]: Start accepts. Automaton has 16399 states and 19036 transitions. Word has length 383 [2018-07-24 02:35:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:35:38,917 INFO L471 AbstractCegarLoop]: Abstraction has 16399 states and 19036 transitions. [2018-07-24 02:35:38,917 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:35:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 16399 states and 19036 transitions. [2018-07-24 02:35:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-07-24 02:35:38,951 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:35:38,952 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 02:35:38,952 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:35:38,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2096929980, now seen corresponding path program 1 times [2018-07-24 02:35:38,952 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:35:38,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:35:38,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:38,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:35:38,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:35:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-07-24 02:35:39,456 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:35:39,456 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 02:35:39,457 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 02:35:39,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 02:35:39,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 02:35:39,457 INFO L87 Difference]: Start difference. First operand 16399 states and 19036 transitions. Second operand 5 states. [2018-07-24 02:35:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:35:41,896 INFO L93 Difference]: Finished difference Result 40764 states and 47408 transitions. [2018-07-24 02:35:41,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 02:35:41,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 523 [2018-07-24 02:35:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:35:41,925 INFO L225 Difference]: With dead ends: 40764 [2018-07-24 02:35:41,925 INFO L226 Difference]: Without dead ends: 24737 [2018-07-24 02:35:41,941 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 02:35:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24737 states. [2018-07-24 02:35:42,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24737 to 24364. [2018-07-24 02:35:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24364 states. [2018-07-24 02:35:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24364 states to 24364 states and 27345 transitions. [2018-07-24 02:35:42,349 INFO L78 Accepts]: Start accepts. Automaton has 24364 states and 27345 transitions. Word has length 523 [2018-07-24 02:35:42,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:35:42,350 INFO L471 AbstractCegarLoop]: Abstraction has 24364 states and 27345 transitions. [2018-07-24 02:35:42,350 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 02:35:42,350 INFO L276 IsEmpty]: Start isEmpty. Operand 24364 states and 27345 transitions. [2018-07-24 02:35:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2018-07-24 02:35:42,409 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:35:42,410 INFO L353 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, 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, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-07-24 02:35:42,410 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:35:42,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1238573674, now seen corresponding path program 1 times [2018-07-24 02:35:42,410 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:35:42,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:35:42,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:42,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:35:42,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:35:42,990 WARN L169 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-07-24 02:35:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1345 backedges. 864 proven. 0 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2018-07-24 02:35:43,276 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:35:43,276 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 02:35:43,276 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 02:35:43,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 02:35:43,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 02:35:43,277 INFO L87 Difference]: Start difference. First operand 24364 states and 27345 transitions. Second operand 5 states. [2018-07-24 02:35:45,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:35:45,949 INFO L93 Difference]: Finished difference Result 45778 states and 51496 transitions. [2018-07-24 02:35:45,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 02:35:45,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 669 [2018-07-24 02:35:45,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:35:45,970 INFO L225 Difference]: With dead ends: 45778 [2018-07-24 02:35:45,970 INFO L226 Difference]: Without dead ends: 23642 [2018-07-24 02:35:45,984 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 02:35:45,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23642 states. [2018-07-24 02:35:46,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23642 to 22697. [2018-07-24 02:35:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22697 states. [2018-07-24 02:35:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22697 states to 22697 states and 25154 transitions. [2018-07-24 02:35:46,567 INFO L78 Accepts]: Start accepts. Automaton has 22697 states and 25154 transitions. Word has length 669 [2018-07-24 02:35:46,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:35:46,568 INFO L471 AbstractCegarLoop]: Abstraction has 22697 states and 25154 transitions. [2018-07-24 02:35:46,568 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 02:35:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 22697 states and 25154 transitions. [2018-07-24 02:35:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2018-07-24 02:35:46,590 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:35:46,590 INFO L353 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, 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, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:35:46,590 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:35:46,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2063811849, now seen corresponding path program 1 times [2018-07-24 02:35:46,591 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:35:46,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:35:46,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:46,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:35:46,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:35:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:35:47,274 WARN L169 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-07-24 02:35:47,873 WARN L169 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-07-24 02:35:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 936 proven. 233 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-07-24 02:35:48,974 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 02:35:48,974 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 02:35:49,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:35:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:35:49,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 02:35:50,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 936 proven. 233 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-07-24 02:35:50,439 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 02:35:50,439 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 12 [2018-07-24 02:35:50,440 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-24 02:35:50,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-24 02:35:50,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-07-24 02:35:50,441 INFO L87 Difference]: Start difference. First operand 22697 states and 25154 transitions. Second operand 13 states. [2018-07-24 02:36:00,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:36:00,583 INFO L93 Difference]: Finished difference Result 57359 states and 63227 transitions. [2018-07-24 02:36:00,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-24 02:36:00,583 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 700 [2018-07-24 02:36:00,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:36:00,621 INFO L225 Difference]: With dead ends: 57359 [2018-07-24 02:36:00,622 INFO L226 Difference]: Without dead ends: 35405 [2018-07-24 02:36:00,638 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 695 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=348, Invalid=644, Unknown=0, NotChecked=0, Total=992 [2018-07-24 02:36:00,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35405 states. [2018-07-24 02:36:00,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35405 to 22854. [2018-07-24 02:36:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22854 states. [2018-07-24 02:36:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22854 states to 22854 states and 25238 transitions. [2018-07-24 02:36:00,951 INFO L78 Accepts]: Start accepts. Automaton has 22854 states and 25238 transitions. Word has length 700 [2018-07-24 02:36:00,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:36:00,952 INFO L471 AbstractCegarLoop]: Abstraction has 22854 states and 25238 transitions. [2018-07-24 02:36:00,952 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-24 02:36:00,952 INFO L276 IsEmpty]: Start isEmpty. Operand 22854 states and 25238 transitions. [2018-07-24 02:36:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2018-07-24 02:36:00,972 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:36:00,973 INFO L353 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, 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, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-07-24 02:36:00,973 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:36:00,974 INFO L82 PathProgramCache]: Analyzing trace with hash 324566072, now seen corresponding path program 1 times [2018-07-24 02:36:00,974 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:36:00,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:36:00,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:36:00,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:36:00,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:36:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:36:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 148 proven. 1129 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-07-24 02:36:03,233 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 02:36:03,233 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 02:36:03,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:36:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:36:03,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 02:36:03,948 WARN L169 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 26 [2018-07-24 02:36:04,380 WARN L169 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 36 [2018-07-24 02:36:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 801 proven. 261 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-07-24 02:36:05,869 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 02:36:05,870 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-07-24 02:36:05,871 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-24 02:36:05,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-24 02:36:05,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-07-24 02:36:05,871 INFO L87 Difference]: Start difference. First operand 22854 states and 25238 transitions. Second operand 13 states. [2018-07-24 02:36:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:36:24,083 INFO L93 Difference]: Finished difference Result 57214 states and 63153 transitions. [2018-07-24 02:36:24,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-24 02:36:24,084 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 736 [2018-07-24 02:36:24,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:36:24,110 INFO L225 Difference]: With dead ends: 57214 [2018-07-24 02:36:24,110 INFO L226 Difference]: Without dead ends: 33986 [2018-07-24 02:36:24,118 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 731 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=257, Invalid=865, Unknown=0, NotChecked=0, Total=1122 [2018-07-24 02:36:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33986 states. [2018-07-24 02:36:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33986 to 25097. [2018-07-24 02:36:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25097 states. [2018-07-24 02:36:24,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25097 states to 25097 states and 27257 transitions. [2018-07-24 02:36:24,393 INFO L78 Accepts]: Start accepts. Automaton has 25097 states and 27257 transitions. Word has length 736 [2018-07-24 02:36:24,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:36:24,394 INFO L471 AbstractCegarLoop]: Abstraction has 25097 states and 27257 transitions. [2018-07-24 02:36:24,394 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-24 02:36:24,394 INFO L276 IsEmpty]: Start isEmpty. Operand 25097 states and 27257 transitions. [2018-07-24 02:36:24,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 998 [2018-07-24 02:36:24,420 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:36:24,421 INFO L353 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, 10, 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, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:36:24,421 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:36:24,421 INFO L82 PathProgramCache]: Analyzing trace with hash 765820506, now seen corresponding path program 1 times [2018-07-24 02:36:24,422 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:36:24,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:36:24,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:36:24,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:36:24,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:36:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:36:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3830 backedges. 1255 proven. 0 refuted. 0 times theorem prover too weak. 2575 trivial. 0 not checked. [2018-07-24 02:36:25,532 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:36:25,532 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 02:36:25,533 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 02:36:25,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 02:36:25,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 02:36:25,534 INFO L87 Difference]: Start difference. First operand 25097 states and 27257 transitions. Second operand 3 states. [2018-07-24 02:36:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:36:26,872 INFO L93 Difference]: Finished difference Result 48145 states and 52339 transitions. [2018-07-24 02:36:26,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 02:36:26,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 997 [2018-07-24 02:36:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:36:26,873 INFO L225 Difference]: With dead ends: 48145 [2018-07-24 02:36:26,874 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 02:36:26,889 INFO L573 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-07-24 02:36:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 02:36:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 02:36:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 02:36:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 02:36:26,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 997 [2018-07-24 02:36:26,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:36:26,890 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 02:36:26,890 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 02:36:26,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 02:36:26,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 02:36:26,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 02:36:26,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:27,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,303 WARN L169 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 647 DAG size of output: 391 [2018-07-24 02:36:28,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:28,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:36:29,647 WARN L169 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 653 DAG size of output: 391 [2018-07-24 02:36:32,744 WARN L169 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 359 DAG size of output: 85 [2018-07-24 02:36:35,420 WARN L169 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 359 DAG size of output: 85 [2018-07-24 02:36:35,424 INFO L421 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-07-24 02:36:35,424 INFO L421 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,424 INFO L421 ceAbstractionStarter]: For program point L904''(lines 904 914) no Hoare annotation was computed. [2018-07-24 02:36:35,424 INFO L421 ceAbstractionStarter]: For program point L478''(lines 478 486) no Hoare annotation was computed. [2018-07-24 02:36:35,424 INFO L421 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,424 INFO L421 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-07-24 02:36:35,424 INFO L421 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,424 INFO L421 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-07-24 02:36:35,424 INFO L421 ceAbstractionStarter]: For program point L970''(lines 970 980) no Hoare annotation was computed. [2018-07-24 02:36:35,424 INFO L421 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,425 INFO L421 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,425 INFO L421 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,425 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 02:36:35,425 INFO L421 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,425 INFO L421 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,425 INFO L421 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,425 INFO L421 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,425 INFO L421 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-07-24 02:36:35,425 INFO L421 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,426 INFO L421 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,426 INFO L421 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,426 INFO L421 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,426 INFO L421 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,426 INFO L421 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,426 INFO L421 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,426 INFO L421 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-07-24 02:36:35,426 INFO L421 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,426 INFO L421 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,427 INFO L421 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,427 INFO L421 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,427 INFO L421 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,427 INFO L421 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,427 INFO L421 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-07-24 02:36:35,427 INFO L421 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-07-24 02:36:35,427 INFO L421 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,427 INFO L421 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,428 INFO L421 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,428 INFO L421 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,428 INFO L421 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,428 INFO L421 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,428 INFO L421 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,428 INFO L421 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,428 INFO L421 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,428 INFO L421 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,428 INFO L421 ceAbstractionStarter]: For program point L587''(lines 587 597) no Hoare annotation was computed. [2018-07-24 02:36:35,429 INFO L421 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,429 INFO L421 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,429 INFO L421 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,429 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,429 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-24 02:36:35,429 INFO L421 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,429 INFO L421 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,429 INFO L421 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,429 INFO L421 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,429 INFO L421 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,429 INFO L421 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,430 INFO L421 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,430 INFO L421 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-07-24 02:36:35,430 INFO L421 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,430 INFO L421 ceAbstractionStarter]: For program point L101(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,430 INFO L421 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-07-24 02:36:35,430 INFO L421 ceAbstractionStarter]: For program point L104(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,430 INFO L421 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,430 INFO L421 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-07-24 02:36:35,430 INFO L421 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-07-24 02:36:35,431 INFO L421 ceAbstractionStarter]: For program point L107(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,431 INFO L421 ceAbstractionStarter]: For program point L648''(lines 648 657) no Hoare annotation was computed. [2018-07-24 02:36:35,431 INFO L421 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,431 INFO L421 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,431 INFO L421 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,431 INFO L421 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-07-24 02:36:35,431 INFO L421 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-07-24 02:36:35,431 INFO L421 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,431 INFO L421 ceAbstractionStarter]: For program point L122(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,431 INFO L421 ceAbstractionStarter]: For program point L179'(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,431 INFO L421 ceAbstractionStarter]: For program point L128(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,432 INFO L421 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-07-24 02:36:35,432 INFO L421 ceAbstractionStarter]: For program point L125(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,432 INFO L421 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-07-24 02:36:35,432 INFO L421 ceAbstractionStarter]: For program point L515''(lines 515 525) no Hoare annotation was computed. [2018-07-24 02:36:35,432 INFO L421 ceAbstractionStarter]: For program point L113(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,432 INFO L421 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-07-24 02:36:35,432 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,432 INFO L421 ceAbstractionStarter]: For program point L110(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,432 INFO L421 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-07-24 02:36:35,433 INFO L421 ceAbstractionStarter]: For program point L116(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,433 INFO L421 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,433 INFO L421 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-07-24 02:36:35,433 INFO L421 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,433 INFO L421 ceAbstractionStarter]: For program point L119(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,433 INFO L421 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,433 INFO L421 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-07-24 02:36:35,433 INFO L421 ceAbstractionStarter]: For program point L140(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,433 INFO L421 ceAbstractionStarter]: For program point L146(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,434 INFO L421 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-07-24 02:36:35,434 INFO L421 ceAbstractionStarter]: For program point L143(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,434 INFO L421 ceAbstractionStarter]: For program point L149(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,434 INFO L421 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-07-24 02:36:35,434 INFO L421 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,434 INFO L421 ceAbstractionStarter]: For program point L131(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,434 INFO L421 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,434 INFO L421 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-07-24 02:36:35,434 INFO L421 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,434 INFO L421 ceAbstractionStarter]: For program point L134(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,435 INFO L421 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-07-24 02:36:35,435 INFO L421 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-07-24 02:36:35,435 INFO L421 ceAbstractionStarter]: For program point L137(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,435 INFO L421 ceAbstractionStarter]: For program point L164(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,435 INFO L421 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-07-24 02:36:35,435 INFO L421 ceAbstractionStarter]: For program point L161(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,435 INFO L421 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-07-24 02:36:35,435 INFO L421 ceAbstractionStarter]: For program point L167(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,435 INFO L421 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-07-24 02:36:35,436 INFO L421 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-07-24 02:36:35,436 INFO L421 ceAbstractionStarter]: For program point L170(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,436 INFO L421 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-07-24 02:36:35,436 INFO L421 ceAbstractionStarter]: For program point L152(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,436 INFO L421 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-07-24 02:36:35,436 INFO L421 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-07-24 02:36:35,436 INFO L421 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-07-24 02:36:35,436 INFO L421 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,436 INFO L421 ceAbstractionStarter]: For program point L155(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,436 INFO L421 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-07-24 02:36:35,436 INFO L421 ceAbstractionStarter]: For program point L158(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,437 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-24 02:36:35,437 INFO L421 ceAbstractionStarter]: For program point L604''(lines 604 614) no Hoare annotation was computed. [2018-07-24 02:36:35,437 INFO L421 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-07-24 02:36:35,437 INFO L421 ceAbstractionStarter]: For program point L185(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,437 INFO L421 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-07-24 02:36:35,437 INFO L421 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-07-24 02:36:35,437 INFO L421 ceAbstractionStarter]: For program point L188(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,437 INFO L421 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-07-24 02:36:35,437 INFO L421 ceAbstractionStarter]: For program point L191(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,437 INFO L421 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-07-24 02:36:35,437 INFO L421 ceAbstractionStarter]: For program point L173(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,437 INFO L421 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-07-24 02:36:35,437 INFO L421 ceAbstractionStarter]: For program point L176(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,437 INFO L421 ceAbstractionStarter]: For program point L182(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,438 INFO L421 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-07-24 02:36:35,438 INFO L421 ceAbstractionStarter]: For program point L197(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,438 INFO L421 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-07-24 02:36:35,438 INFO L421 ceAbstractionStarter]: For program point L194(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,438 INFO L421 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-07-24 02:36:35,438 INFO L421 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-07-24 02:36:35,438 INFO L421 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-07-24 02:36:35,438 INFO L421 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-07-24 02:36:35,438 INFO L421 ceAbstractionStarter]: For program point L26(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,438 INFO L421 ceAbstractionStarter]: For program point L29(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,438 INFO L421 ceAbstractionStarter]: For program point L940''(lines 940 952) no Hoare annotation was computed. [2018-07-24 02:36:35,438 INFO L421 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-07-24 02:36:35,438 INFO L421 ceAbstractionStarter]: For program point L32(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,438 INFO L421 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-07-24 02:36:35,438 INFO L421 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-07-24 02:36:35,439 INFO L421 ceAbstractionStarter]: For program point L35(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,439 INFO L421 ceAbstractionStarter]: For program point L38(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,439 INFO L421 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-07-24 02:36:35,439 INFO L421 ceAbstractionStarter]: For program point L41(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,439 INFO L421 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-07-24 02:36:35,439 INFO L421 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-07-24 02:36:35,439 INFO L421 ceAbstractionStarter]: For program point L44(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,439 INFO L421 ceAbstractionStarter]: For program point L47(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,439 INFO L421 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-07-24 02:36:35,439 INFO L421 ceAbstractionStarter]: For program point L866''(lines 866 875) no Hoare annotation was computed. [2018-07-24 02:36:35,439 INFO L421 ceAbstractionStarter]: For program point L50(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,439 INFO L421 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-07-24 02:36:35,439 INFO L421 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-07-24 02:36:35,439 INFO L421 ceAbstractionStarter]: For program point L53(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,440 INFO L421 ceAbstractionStarter]: For program point L56(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,440 INFO L421 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-07-24 02:36:35,440 INFO L421 ceAbstractionStarter]: For program point L59(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,440 INFO L421 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-07-24 02:36:35,440 INFO L421 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-07-24 02:36:35,440 INFO L421 ceAbstractionStarter]: For program point L62(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,440 INFO L421 ceAbstractionStarter]: For program point L65(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,440 INFO L421 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-07-24 02:36:35,440 INFO L421 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-07-24 02:36:35,440 INFO L421 ceAbstractionStarter]: For program point L68(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,440 INFO L421 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-07-24 02:36:35,440 INFO L421 ceAbstractionStarter]: For program point L71(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,440 INFO L421 ceAbstractionStarter]: For program point L74(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,440 INFO L421 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-07-24 02:36:35,440 INFO L421 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-07-24 02:36:35,441 INFO L421 ceAbstractionStarter]: For program point L77(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,441 INFO L421 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-07-24 02:36:35,441 INFO L421 ceAbstractionStarter]: For program point L80(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,441 INFO L421 ceAbstractionStarter]: For program point L83(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,441 INFO L421 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-07-24 02:36:35,441 INFO L421 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-07-24 02:36:35,441 INFO L421 ceAbstractionStarter]: For program point L86(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,441 INFO L421 ceAbstractionStarter]: For program point L89(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,441 INFO L421 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-07-24 02:36:35,441 INFO L421 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,441 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 02:36:35,441 INFO L421 ceAbstractionStarter]: For program point L916''(lines 916 926) no Hoare annotation was computed. [2018-07-24 02:36:35,441 INFO L421 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-07-24 02:36:35,441 INFO L421 ceAbstractionStarter]: For program point L92(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,442 INFO L421 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-07-24 02:36:35,442 INFO L421 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-07-24 02:36:35,442 INFO L421 ceAbstractionStarter]: For program point L95(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,442 INFO L421 ceAbstractionStarter]: For program point L98(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,442 INFO L421 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-07-24 02:36:35,442 INFO L421 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,442 INFO L421 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,442 INFO L421 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,442 INFO L421 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,442 INFO L421 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-07-24 02:36:35,442 INFO L421 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,442 INFO L421 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,442 INFO L421 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,442 INFO L421 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,442 INFO L421 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,443 INFO L421 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,443 INFO L421 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-07-24 02:36:35,443 INFO L421 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,443 INFO L421 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,443 INFO L421 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,443 INFO L421 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,443 INFO L421 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,443 INFO L421 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,443 INFO L421 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,443 INFO L421 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-07-24 02:36:35,443 INFO L421 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,443 INFO L421 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,443 INFO L421 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,443 INFO L421 ceAbstractionStarter]: For program point L399''(lines 399 410) no Hoare annotation was computed. [2018-07-24 02:36:35,443 INFO L421 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,444 INFO L421 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,444 INFO L421 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,444 INFO L421 ceAbstractionStarter]: For program point L695''(lines 695 705) no Hoare annotation was computed. [2018-07-24 02:36:35,444 INFO L421 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,444 INFO L421 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,444 INFO L421 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,444 INFO L421 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,444 INFO L421 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,444 INFO L421 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,444 INFO L421 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-07-24 02:36:35,445 INFO L421 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,445 INFO L421 ceAbstractionStarter]: For program point L200(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,445 INFO L421 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-07-24 02:36:35,445 INFO L421 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,445 INFO L421 ceAbstractionStarter]: For program point L203(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,445 INFO L421 ceAbstractionStarter]: For program point L805''(lines 805 815) no Hoare annotation was computed. [2018-07-24 02:36:35,445 INFO L421 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,445 INFO L421 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,445 INFO L421 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,445 INFO L421 ceAbstractionStarter]: For program point L488''(lines 488 499) no Hoare annotation was computed. [2018-07-24 02:36:35,446 INFO L421 ceAbstractionStarter]: For program point L718''(lines 718 730) no Hoare annotation was computed. [2018-07-24 02:36:35,446 INFO L421 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,446 INFO L421 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,446 INFO L421 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,446 INFO L421 ceAbstractionStarter]: For program point L23'(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:36:35,446 INFO L421 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,446 INFO L421 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-07-24 02:36:35,446 INFO L421 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,446 INFO L421 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,447 INFO L421 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,447 INFO L421 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,447 INFO L421 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,447 INFO L421 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,447 INFO L421 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-07-24 02:36:35,448 INFO L417 ceAbstractionStarter]: At program point L1034''(lines 1034 1043) the Hoare annotation is: (let ((.cse13 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 43)) (.cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 1)) (.cse14 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 9)) (.cse19 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 12))) (let ((.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 11)) (.cse5 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 13))) (.cse6 (not .cse19)) (.cse9 (= 12 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)) (.cse15 (< 138 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)) (.cse11 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 312)) (.cse16 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)) (.cse17 (<= 13 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)) (.cse18 (<= 141 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)) (.cse1 (not .cse14)) (.cse10 (not .cse4)) (.cse8 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 130)) (.cse0 (<= .cse13 0)) (.cse12 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 277)) (.cse2 (= 15 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8~0)) (.cse3 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse4 .cse2 .cse3) (and .cse8 .cse9 .cse2 .cse3) (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 10)) .cse1 .cse2 .cse10 (not .cse7) .cse3 .cse11) (and .cse0 (<= 260 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0) .cse2 .cse3) (and .cse12 .cse4 .cse2 .cse3 .cse5 .cse6) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 140) .cse2 .cse10 .cse3 (< 0 .cse13) .cse11) (and .cse8 .cse4 .cse14) (and .cse4 .cse2 .cse3 .cse5 .cse15 .cse6) (and (exists ((v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 Int)) (and (<= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 140) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 (+ (div v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 5) 206649)) (= 0 (mod v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 5)))) .cse16 .cse2 .cse17 .cse3 .cse15) (and .cse9 .cse2 .cse3 .cse15 .cse11) (and .cse12 .cse18 .cse16 .cse2 .cse3 .cse17) (and .cse12 .cse4 .cse18 (<= 312 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0) .cse2 .cse3) (and .cse8 .cse1 .cse2 .cse10 .cse3) (and .cse4 .cse14 .cse2 .cse3) (and (and .cse8 .cse0) .cse2 .cse3) (and .cse12 .cse4 .cse0) (and (and .cse19 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 0) .cse12 (< 140 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)) .cse2 .cse3)))) [2018-07-24 02:36:35,448 INFO L421 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,448 INFO L421 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,448 INFO L421 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-07-24 02:36:35,448 INFO L421 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,448 INFO L421 ceAbstractionStarter]: For program point L758''(lines 758 768) no Hoare annotation was computed. [2018-07-24 02:36:35,448 INFO L421 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,448 INFO L421 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,448 INFO L421 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,449 INFO L421 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,449 INFO L421 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,449 INFO L421 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,449 INFO L417 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse13 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 43)) (.cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 1)) (.cse14 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 9)) (.cse19 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 12))) (let ((.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 11)) (.cse5 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 13))) (.cse6 (not .cse19)) (.cse9 (= 12 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)) (.cse15 (< 138 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)) (.cse11 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 312)) (.cse16 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)) (.cse17 (<= 13 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)) (.cse18 (<= 141 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)) (.cse1 (not .cse14)) (.cse10 (not .cse4)) (.cse8 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 130)) (.cse0 (<= .cse13 0)) (.cse12 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 277)) (.cse2 (= 15 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8~0)) (.cse3 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse4 .cse2 .cse3) (and .cse8 .cse9 .cse2 .cse3) (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 10)) .cse1 .cse2 .cse10 (not .cse7) .cse3 .cse11) (and .cse0 (<= 260 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0) .cse2 .cse3) (and .cse12 .cse4 .cse2 .cse3 .cse5 .cse6) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 140) .cse2 .cse10 .cse3 (< 0 .cse13) .cse11) (and .cse8 .cse4 .cse14) (and .cse4 .cse2 .cse3 .cse5 .cse15 .cse6) (and (exists ((v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 Int)) (and (<= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 140) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 (+ (div v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 5) 206649)) (= 0 (mod v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 5)))) .cse16 .cse2 .cse17 .cse3 .cse15) (and .cse9 .cse2 .cse3 .cse15 .cse11) (and .cse12 .cse18 .cse16 .cse2 .cse3 .cse17) (and .cse12 .cse4 .cse18 (<= 312 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0) .cse2 .cse3) (and .cse8 .cse1 .cse2 .cse10 .cse3) (and .cse4 .cse14 .cse2 .cse3) (and (and .cse8 .cse0) .cse2 .cse3) (and .cse12 .cse4 .cse0) (and (and .cse19 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 0) .cse12 (< 140 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)) .cse2 .cse3)))) [2018-07-24 02:36:35,449 INFO L424 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2018-07-24 02:36:35,449 INFO L421 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,450 INFO L421 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,450 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 180) no Hoare annotation was computed. [2018-07-24 02:36:35,450 INFO L421 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,450 INFO L421 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,450 INFO L421 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,450 INFO L421 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,450 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-07-24 02:36:35,450 INFO L421 ceAbstractionStarter]: For program point L1034(lines 1034 1043) no Hoare annotation was computed. [2018-07-24 02:36:35,450 INFO L421 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-07-24 02:36:35,457 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,458 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,458 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,474 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,475 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,475 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,480 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,480 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,480 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,484 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,484 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,485 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 02:36:35 BoogieIcfgContainer [2018-07-24 02:36:35,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 02:36:35,492 INFO L168 Benchmark]: Toolchain (without parser) took 102308.14 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-07-24 02:36:35,493 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 02:36:35,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 988.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-07-24 02:36:35,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 182.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-07-24 02:36:35,497 INFO L168 Benchmark]: Boogie Preprocessor took 373.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 805.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -934.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-07-24 02:36:35,498 INFO L168 Benchmark]: RCFGBuilder took 4129.99 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 188.7 MB). Peak memory consumption was 188.7 MB. Max. memory is 7.1 GB. [2018-07-24 02:36:35,498 INFO L168 Benchmark]: TraceAbstraction took 96626.92 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.0 GB in the beginning and 2.5 GB in the end (delta: -470.9 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-07-24 02:36:35,509 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 988.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 182.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 373.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 805.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -934.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4129.99 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 188.7 MB). Peak memory consumption was 188.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 96626.92 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.0 GB in the beginning and 2.5 GB in the end (delta: -470.9 MB). Peak memory consumption was 2.3 GB. 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_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 180]: 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: 22]: Loop Invariant [2018-07-24 02:36:35,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,533 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,534 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,534 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9)) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 12))) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 11 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && 12 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || ((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 10) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9)) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 11)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 312)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0 && 260 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 12))) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 140 && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && 0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 312)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1 && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13)) && 138 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 12))) || ((((((\exists v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 : int :: (v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 <= 140 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 / 5 + 206649) && 0 == v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 % 5) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 13 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && 138 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23)) || ((((12 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && 138 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 312)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277 && 141 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && 13 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 141 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && 312 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9)) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 12 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277) && 140 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) - InvariantResult [Line: 1034]: Loop Invariant [2018-07-24 02:36:35,540 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,541 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,541 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:36:35,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9)) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 12))) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 11 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && 12 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || ((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 10) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9)) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 11)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 312)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0 && 260 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 12))) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 140 && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && 0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 312)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1 && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13)) && 138 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 12))) || ((((((\exists v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 : int :: (v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 <= 140 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 / 5 + 206649) && 0 == v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 % 5) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 13 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && 138 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23)) || ((((12 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && 138 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 312)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277 && 141 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && 13 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 141 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && 312 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9)) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 12 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277) && 140 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. SAFE Result, 96.5s OverallTime, 15 OverallIterations, 10 TraceHistogramMax, 67.6s AutomataDifference, 0.0s DeadEndRemovalTime, 8.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 3419 SDtfs, 12039 SDslu, 2292 SDs, 0 SdLazy, 30483 SolverSat, 5472 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 56.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1803 GetRequests, 1702 SyntacticMatches, 8 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25097occurred 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: 2.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 28268 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 302 NumberOfFragments, 683 HoareAnnotationTreeSize, 3 FomulaSimplifications, 56965 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 22434 FormulaSimplificationTreeSizeReductionInter, 5.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 7856 NumberOfCodeBlocks, 7856 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 7838 ConstructedInterpolants, 99 QuantifiedInterpolants, 21392306 SizeOfPredicates, 14 NumberOfNonLiveVariables, 2147 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 12012/13878 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label35_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_02-36-35-554.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label35_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_02-36-35-554.csv Received shutdown request...