java -Xss4m -Xmx6000000000 -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 ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label59_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-71425fa [2018-07-22 11:02:23,999 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-22 11:02:24,001 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-22 11:02:24,013 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-22 11:02:24,014 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-22 11:02:24,015 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-22 11:02:24,016 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-22 11:02:24,020 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-22 11:02:24,022 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-22 11:02:24,023 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-22 11:02:24,026 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-22 11:02:24,026 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-22 11:02:24,027 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-22 11:02:24,028 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-22 11:02:24,032 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-22 11:02:24,033 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-22 11:02:24,034 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-22 11:02:24,047 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-22 11:02:24,049 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-22 11:02:24,051 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-22 11:02:24,056 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-22 11:02:24,058 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-22 11:02:24,060 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-22 11:02:24,060 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-22 11:02:24,060 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-22 11:02:24,061 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-22 11:02:24,062 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-22 11:02:24,064 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-22 11:02:24,065 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-22 11:02:24,066 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-22 11:02:24,066 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-22 11:02:24,071 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-22 11:02:24,072 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-22 11:02:24,072 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-22 11:02:24,073 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-22 11:02:24,073 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-22 11:02:24,076 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-22 11:02:24,104 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-22 11:02:24,104 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-22 11:02:24,105 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-22 11:02:24,105 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-22 11:02:24,109 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-22 11:02:24,109 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-22 11:02:24,109 INFO L133 SettingsManager]: * Use SBE=true [2018-07-22 11:02:24,109 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-22 11:02:24,110 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-22 11:02:24,110 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-22 11:02:24,110 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-22 11:02:24,110 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-22 11:02:24,110 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-22 11:02:24,111 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-22 11:02:24,111 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-22 11:02:24,111 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-22 11:02:24,111 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-22 11:02:24,111 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-22 11:02:24,111 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-22 11:02:24,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-22 11:02:24,113 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-22 11:02:24,113 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-07-22 11:02:24,113 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-22 11:02:24,114 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-22 11:02:24,114 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-22 11:02:24,114 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-22 11:02:24,114 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-22 11:02:24,114 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-22 11:02:24,115 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-22 11:02:24,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-22 11:02:24,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-22 11:02:24,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-22 11:02:24,193 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-22 11:02:24,193 INFO L276 PluginConnector]: CDTParser initialized [2018-07-22 11:02:24,195 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label59_true-unreach-call.c [2018-07-22 11:02:24,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5afba7d/3e81bf86cd5f40509dbff87124fcf1f9/FLAG30c487f7f [2018-07-22 11:02:24,851 INFO L276 CDTParser]: Found 1 translation units. [2018-07-22 11:02:24,851 INFO L158 CDTParser]: Scanning /storage/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label59_true-unreach-call.c [2018-07-22 11:02:24,890 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5afba7d/3e81bf86cd5f40509dbff87124fcf1f9/FLAG30c487f7f [2018-07-22 11:02:24,906 INFO L332 CDTParser]: Successfully deleted /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5afba7d/3e81bf86cd5f40509dbff87124fcf1f9 [2018-07-22 11:02:24,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-22 11:02:24,923 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-22 11:02:24,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-22 11:02:24,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-22 11:02:24,931 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-22 11:02:24,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:02:24" (1/1) ... [2018-07-22 11:02:24,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@232b3782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:24, skipping insertion in model container [2018-07-22 11:02:24,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:02:24" (1/1) ... [2018-07-22 11:02:25,140 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-22 11:02:25,397 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-22 11:02:25,414 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-22 11:02:25,590 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-22 11:02:25,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:25 WrapperNode [2018-07-22 11:02:25,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-22 11:02:25,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-22 11:02:25,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-22 11:02:25,649 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-22 11:02:25,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:25" (1/1) ... [2018-07-22 11:02:25,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:25" (1/1) ... [2018-07-22 11:02:25,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-22 11:02:25,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-22 11:02:25,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-22 11:02:25,780 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-22 11:02:25,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:25" (1/1) ... [2018-07-22 11:02:25,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:25" (1/1) ... [2018-07-22 11:02:25,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:25" (1/1) ... [2018-07-22 11:02:25,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:25" (1/1) ... [2018-07-22 11:02:25,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:25" (1/1) ... [2018-07-22 11:02:25,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:25" (1/1) ... [2018-07-22 11:02:25,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:25" (1/1) ... [2018-07-22 11:02:25,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-22 11:02:25,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-22 11:02:25,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-22 11:02:25,888 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-22 11:02:25,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:25" (1/1) ... No working directory specified, using /storage/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-22 11:02:26,154 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-22 11:02:26,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-22 11:02:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-22 11:02:29,264 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-22 11:02:29,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:02:29 BoogieIcfgContainer [2018-07-22 11:02:29,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-22 11:02:29,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-22 11:02:29,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-22 11:02:29,268 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-22 11:02:29,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:02:24" (1/3) ... [2018-07-22 11:02:29,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169dc215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:02:29, skipping insertion in model container [2018-07-22 11:02:29,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:25" (2/3) ... [2018-07-22 11:02:29,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169dc215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:02:29, skipping insertion in model container [2018-07-22 11:02:29,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:02:29" (3/3) ... [2018-07-22 11:02:29,271 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label59_true-unreach-call.c [2018-07-22 11:02:29,278 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-22 11:02:29,286 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-22 11:02:29,332 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-22 11:02:29,333 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-22 11:02:29,333 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-22 11:02:29,333 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-22 11:02:29,334 INFO L376 AbstractCegarLoop]: Backedges is TWOTRACK [2018-07-22 11:02:29,334 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-22 11:02:29,334 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-22 11:02:29,334 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-22 11:02:29,334 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-22 11:02:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2018-07-22 11:02:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-22 11:02:29,369 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:02:29,370 INFO L358 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, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 11:02:29,371 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:02:29,374 INFO L82 PathProgramCache]: Analyzing trace with hash -717159398, now seen corresponding path program 1 times [2018-07-22 11:02:29,376 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:02:29,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:02:29,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:02:29,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:02:29,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:02:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:02:29,919 WARN L169 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-07-22 11:02:29,946 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-22 11:02:29,950 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 11:02:29,950 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 11:02:29,956 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 11:02:29,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 11:02:29,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 11:02:29,972 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 4 states. [2018-07-22 11:02:32,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:02:32,587 INFO L93 Difference]: Finished difference Result 713 states and 1265 transitions. [2018-07-22 11:02:32,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 11:02:32,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-07-22 11:02:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:02:32,607 INFO L225 Difference]: With dead ends: 713 [2018-07-22 11:02:32,607 INFO L226 Difference]: Without dead ends: 499 [2018-07-22 11:02:32,612 INFO L578 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-22 11:02:32,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-07-22 11:02:32,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 344. [2018-07-22 11:02:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-07-22 11:02:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 599 transitions. [2018-07-22 11:02:32,679 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 599 transitions. Word has length 66 [2018-07-22 11:02:32,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:02:32,680 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 599 transitions. [2018-07-22 11:02:32,680 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 11:02:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 599 transitions. [2018-07-22 11:02:32,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-22 11:02:32,686 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:02:32,687 INFO L358 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 11:02:32,687 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:02:32,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1918985337, now seen corresponding path program 1 times [2018-07-22 11:02:32,688 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:02:32,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:02:32,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:02:32,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:02:32,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:02:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:02:33,087 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 11:02:33,087 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 11:02:33,087 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 11:02:33,089 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 11:02:33,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 11:02:33,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 11:02:33,090 INFO L87 Difference]: Start difference. First operand 344 states and 599 transitions. Second operand 4 states. [2018-07-22 11:02:34,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:02:34,398 INFO L93 Difference]: Finished difference Result 1246 states and 2268 transitions. [2018-07-22 11:02:34,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 11:02:34,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2018-07-22 11:02:34,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:02:34,405 INFO L225 Difference]: With dead ends: 1246 [2018-07-22 11:02:34,405 INFO L226 Difference]: Without dead ends: 904 [2018-07-22 11:02:34,408 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-22 11:02:34,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-07-22 11:02:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-07-22 11:02:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-07-22 11:02:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1414 transitions. [2018-07-22 11:02:34,494 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1414 transitions. Word has length 133 [2018-07-22 11:02:34,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:02:34,495 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1414 transitions. [2018-07-22 11:02:34,495 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 11:02:34,495 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1414 transitions. [2018-07-22 11:02:34,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-22 11:02:34,502 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:02:34,503 INFO L358 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, 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] [2018-07-22 11:02:34,503 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:02:34,503 INFO L82 PathProgramCache]: Analyzing trace with hash -119858865, now seen corresponding path program 1 times [2018-07-22 11:02:34,503 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:02:34,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:02:34,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:02:34,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:02:34,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:02:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:02:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 11:02:34,733 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 11:02:34,733 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 11:02:34,734 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 11:02:34,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 11:02:34,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 11:02:34,736 INFO L87 Difference]: Start difference. First operand 904 states and 1414 transitions. Second operand 4 states. [2018-07-22 11:02:38,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:02:38,066 INFO L93 Difference]: Finished difference Result 2086 states and 3320 transitions. [2018-07-22 11:02:38,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 11:02:38,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-07-22 11:02:38,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:02:38,074 INFO L225 Difference]: With dead ends: 2086 [2018-07-22 11:02:38,075 INFO L226 Difference]: Without dead ends: 1184 [2018-07-22 11:02:38,077 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 11:02:38,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-07-22 11:02:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1184. [2018-07-22 11:02:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2018-07-22 11:02:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1643 transitions. [2018-07-22 11:02:38,116 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1643 transitions. Word has length 144 [2018-07-22 11:02:38,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:02:38,117 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1643 transitions. [2018-07-22 11:02:38,117 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 11:02:38,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1643 transitions. [2018-07-22 11:02:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-22 11:02:38,122 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:02:38,122 INFO L358 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, 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] [2018-07-22 11:02:38,123 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:02:38,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1911128498, now seen corresponding path program 1 times [2018-07-22 11:02:38,124 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:02:38,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:02:38,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:02:38,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:02:38,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:02:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:02:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 11:02:38,436 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 11:02:38,436 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-22 11:02:38,436 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 11:02:38,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 11:02:38,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 11:02:38,437 INFO L87 Difference]: Start difference. First operand 1184 states and 1643 transitions. Second operand 3 states. [2018-07-22 11:02:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:02:39,612 INFO L93 Difference]: Finished difference Result 3486 states and 4864 transitions. [2018-07-22 11:02:39,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 11:02:39,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2018-07-22 11:02:39,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:02:39,623 INFO L225 Difference]: With dead ends: 3486 [2018-07-22 11:02:39,624 INFO L226 Difference]: Without dead ends: 2304 [2018-07-22 11:02:39,626 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 11:02:39,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2018-07-22 11:02:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2304. [2018-07-22 11:02:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2304 states. [2018-07-22 11:02:39,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 2964 transitions. [2018-07-22 11:02:39,687 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 2964 transitions. Word has length 194 [2018-07-22 11:02:39,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:02:39,688 INFO L471 AbstractCegarLoop]: Abstraction has 2304 states and 2964 transitions. [2018-07-22 11:02:39,688 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 11:02:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 2964 transitions. [2018-07-22 11:02:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-22 11:02:39,694 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:02:39,694 INFO L358 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, 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] [2018-07-22 11:02:39,694 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:02:39,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1672247086, now seen corresponding path program 1 times [2018-07-22 11:02:39,694 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:02:39,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:02:39,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:02:39,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:02:39,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:02:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:02:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 129 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 11:02:40,316 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 11:02:40,316 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-22 11:02:40,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:02:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:02:40,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 11:02:40,745 WARN L169 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 15 [2018-07-22 11:02:41,004 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 129 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 11:02:41,038 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-22 11:02:41,038 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-07-22 11:02:41,039 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-22 11:02:41,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-22 11:02:41,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-07-22 11:02:41,039 INFO L87 Difference]: Start difference. First operand 2304 states and 2964 transitions. Second operand 8 states. [2018-07-22 11:02:49,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:02:49,304 INFO L93 Difference]: Finished difference Result 6152 states and 7932 transitions. [2018-07-22 11:02:49,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-22 11:02:49,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 216 [2018-07-22 11:02:49,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:02:49,319 INFO L225 Difference]: With dead ends: 6152 [2018-07-22 11:02:49,319 INFO L226 Difference]: Without dead ends: 3850 [2018-07-22 11:02:49,323 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-07-22 11:02:49,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2018-07-22 11:02:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3430. [2018-07-22 11:02:49,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3430 states. [2018-07-22 11:02:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3430 states to 3430 states and 4139 transitions. [2018-07-22 11:02:49,424 INFO L78 Accepts]: Start accepts. Automaton has 3430 states and 4139 transitions. Word has length 216 [2018-07-22 11:02:49,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:02:49,424 INFO L471 AbstractCegarLoop]: Abstraction has 3430 states and 4139 transitions. [2018-07-22 11:02:49,425 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-22 11:02:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3430 states and 4139 transitions. [2018-07-22 11:02:49,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-22 11:02:49,434 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:02:49,434 INFO L358 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 11:02:49,435 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:02:49,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2135320279, now seen corresponding path program 1 times [2018-07-22 11:02:49,435 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:02:49,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:02:49,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:02:49,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:02:49,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:02:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:02:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 11:02:49,964 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 11:02:49,964 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-22 11:02:49,964 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-22 11:02:49,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-22 11:02:49,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 11:02:49,965 INFO L87 Difference]: Start difference. First operand 3430 states and 4139 transitions. Second operand 5 states. [2018-07-22 11:02:51,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:02:51,559 INFO L93 Difference]: Finished difference Result 9096 states and 11187 transitions. [2018-07-22 11:02:51,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-22 11:02:51,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 220 [2018-07-22 11:02:51,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:02:51,568 INFO L225 Difference]: With dead ends: 9096 [2018-07-22 11:02:51,568 INFO L226 Difference]: Without dead ends: 2384 [2018-07-22 11:02:51,574 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 11:02:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2018-07-22 11:02:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2104. [2018-07-22 11:02:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2104 states. [2018-07-22 11:02:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 2104 states and 2326 transitions. [2018-07-22 11:02:51,625 INFO L78 Accepts]: Start accepts. Automaton has 2104 states and 2326 transitions. Word has length 220 [2018-07-22 11:02:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:02:51,626 INFO L471 AbstractCegarLoop]: Abstraction has 2104 states and 2326 transitions. [2018-07-22 11:02:51,626 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-22 11:02:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 2326 transitions. [2018-07-22 11:02:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-07-22 11:02:51,632 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:02:51,632 INFO L358 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, 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, 1, 1, 1, 1, 1, 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-22 11:02:51,632 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:02:51,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1388710448, now seen corresponding path program 1 times [2018-07-22 11:02:51,633 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:02:51,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:02:51,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:02:51,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:02:51,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:02:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:02:52,029 WARN L169 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-07-22 11:02:52,472 WARN L169 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-07-22 11:02:52,829 WARN L169 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2018-07-22 11:02:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-07-22 11:02:53,039 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 11:02:53,040 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-22 11:02:53,040 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-22 11:02:53,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-22 11:02:53,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-22 11:02:53,041 INFO L87 Difference]: Start difference. First operand 2104 states and 2326 transitions. Second operand 7 states. [2018-07-22 11:02:54,404 WARN L169 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-07-22 11:02:56,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:02:56,130 INFO L93 Difference]: Finished difference Result 4361 states and 4813 transitions. [2018-07-22 11:02:56,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-22 11:02:56,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 255 [2018-07-22 11:02:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:02:56,137 INFO L225 Difference]: With dead ends: 4361 [2018-07-22 11:02:56,137 INFO L226 Difference]: Without dead ends: 2259 [2018-07-22 11:02:56,140 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-07-22 11:02:56,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2018-07-22 11:02:56,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 2244. [2018-07-22 11:02:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2018-07-22 11:02:56,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 2470 transitions. [2018-07-22 11:02:56,191 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 2470 transitions. Word has length 255 [2018-07-22 11:02:56,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:02:56,192 INFO L471 AbstractCegarLoop]: Abstraction has 2244 states and 2470 transitions. [2018-07-22 11:02:56,192 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-22 11:02:56,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 2470 transitions. [2018-07-22 11:02:56,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-07-22 11:02:56,201 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:02:56,201 INFO L358 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 11:02:56,201 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:02:56,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1108328208, now seen corresponding path program 1 times [2018-07-22 11:02:56,202 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:02:56,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:02:56,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:02:56,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:02:56,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:02:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:02:56,930 WARN L169 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-07-22 11:02:57,269 WARN L169 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-07-22 11:02:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 297 proven. 100 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-07-22 11:02:57,508 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 11:02:57,508 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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) [2018-07-22 11:02:57,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 11:02:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:02:57,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 11:02:57,927 WARN L169 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-07-22 11:02:58,285 WARN L169 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 19 [2018-07-22 11:02:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 334 proven. 63 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-07-22 11:02:58,910 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-22 11:02:58,910 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-07-22 11:02:58,911 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-22 11:02:58,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-22 11:02:58,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-07-22 11:02:58,912 INFO L87 Difference]: Start difference. First operand 2244 states and 2470 transitions. Second operand 8 states. [2018-07-22 11:03:00,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:03:00,753 INFO L93 Difference]: Finished difference Result 5746 states and 6336 transitions. [2018-07-22 11:03:00,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-22 11:03:00,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 367 [2018-07-22 11:03:00,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:03:00,765 INFO L225 Difference]: With dead ends: 5746 [2018-07-22 11:03:00,765 INFO L226 Difference]: Without dead ends: 3644 [2018-07-22 11:03:00,767 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-07-22 11:03:00,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2018-07-22 11:03:00,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 2524. [2018-07-22 11:03:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2524 states. [2018-07-22 11:03:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 2740 transitions. [2018-07-22 11:03:00,829 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 2740 transitions. Word has length 367 [2018-07-22 11:03:00,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:03:00,829 INFO L471 AbstractCegarLoop]: Abstraction has 2524 states and 2740 transitions. [2018-07-22 11:03:00,829 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-22 11:03:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 2740 transitions. [2018-07-22 11:03:00,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-07-22 11:03:00,840 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:03:00,840 INFO L358 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, 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, 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] [2018-07-22 11:03:00,840 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:03:00,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1093761571, now seen corresponding path program 1 times [2018-07-22 11:03:00,841 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:03:00,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:03:00,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:03:00,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:03:00,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:03:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:03:01,459 WARN L169 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-07-22 11:03:02,306 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 37 proven. 424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 11:03:02,306 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 11:03:02,306 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-22 11:03:02,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:03:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:03:02,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 11:03:03,178 WARN L169 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-07-22 11:03:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 12 proven. 386 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-07-22 11:03:04,320 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-22 11:03:04,321 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 17 [2018-07-22 11:03:04,321 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-22 11:03:04,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-22 11:03:04,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-07-22 11:03:04,322 INFO L87 Difference]: Start difference. First operand 2524 states and 2740 transitions. Second operand 18 states. [2018-07-22 11:03:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:03:11,236 INFO L93 Difference]: Finished difference Result 6045 states and 6584 transitions. [2018-07-22 11:03:11,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-22 11:03:11,236 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 386 [2018-07-22 11:03:11,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:03:11,250 INFO L225 Difference]: With dead ends: 6045 [2018-07-22 11:03:11,250 INFO L226 Difference]: Without dead ends: 3663 [2018-07-22 11:03:11,253 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 383 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=333, Invalid=927, Unknown=0, NotChecked=0, Total=1260 [2018-07-22 11:03:11,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3663 states. [2018-07-22 11:03:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3663 to 2728. [2018-07-22 11:03:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2728 states. [2018-07-22 11:03:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 2941 transitions. [2018-07-22 11:03:11,317 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 2941 transitions. Word has length 386 [2018-07-22 11:03:11,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:03:11,318 INFO L471 AbstractCegarLoop]: Abstraction has 2728 states and 2941 transitions. [2018-07-22 11:03:11,318 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-22 11:03:11,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 2941 transitions. [2018-07-22 11:03:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2018-07-22 11:03:11,335 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:03:11,336 INFO L358 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, 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, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 11:03:11,336 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:03:11,336 INFO L82 PathProgramCache]: Analyzing trace with hash 822864931, now seen corresponding path program 1 times [2018-07-22 11:03:11,336 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:03:11,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:03:11,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:03:11,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:03:11,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:03:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:03:12,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 341 proven. 580 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-07-22 11:03:12,464 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 11:03:12,464 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 11:03:12,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:03:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:03:12,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 11:03:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 822 proven. 38 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-07-22 11:03:13,254 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-22 11:03:13,254 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 9 [2018-07-22 11:03:13,255 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-22 11:03:13,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-22 11:03:13,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-07-22 11:03:13,255 INFO L87 Difference]: Start difference. First operand 2728 states and 2941 transitions. Second operand 10 states. [2018-07-22 11:03:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:03:14,560 INFO L93 Difference]: Finished difference Result 5413 states and 5835 transitions. [2018-07-22 11:03:14,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-22 11:03:14,561 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 555 [2018-07-22 11:03:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:03:14,570 INFO L225 Difference]: With dead ends: 5413 [2018-07-22 11:03:14,570 INFO L226 Difference]: Without dead ends: 2827 [2018-07-22 11:03:14,572 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 554 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-07-22 11:03:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2018-07-22 11:03:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2588. [2018-07-22 11:03:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2588 states. [2018-07-22 11:03:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 2772 transitions. [2018-07-22 11:03:14,635 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 2772 transitions. Word has length 555 [2018-07-22 11:03:14,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:03:14,636 INFO L471 AbstractCegarLoop]: Abstraction has 2588 states and 2772 transitions. [2018-07-22 11:03:14,636 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-22 11:03:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 2772 transitions. [2018-07-22 11:03:14,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2018-07-22 11:03:14,644 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:03:14,645 INFO L358 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, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 11:03:14,645 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:03:14,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1620667456, now seen corresponding path program 1 times [2018-07-22 11:03:14,645 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:03:14,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:03:14,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:03:14,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:03:14,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:03:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:03:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 715 proven. 267 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-07-22 11:03:15,817 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 11:03:15,817 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 11:03:15,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:03:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:03:15,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 11:03:20,310 WARN L169 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 41 DAG size of output: 20 [2018-07-22 11:03:21,422 WARN L169 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 28 [2018-07-22 11:03:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 798 proven. 128 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-07-22 11:03:22,160 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-22 11:03:22,161 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2018-07-22 11:03:22,161 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-22 11:03:22,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-22 11:03:22,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=142, Unknown=2, NotChecked=0, Total=182 [2018-07-22 11:03:22,162 INFO L87 Difference]: Start difference. First operand 2588 states and 2772 transitions. Second operand 14 states. [2018-07-22 11:03:23,687 WARN L169 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2018-07-22 11:03:24,619 WARN L169 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-07-22 11:03:27,149 WARN L169 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-07-22 11:03:30,376 WARN L169 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-07-22 11:03:32,755 WARN L169 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-07-22 11:03:35,348 WARN L169 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 32 [2018-07-22 11:03:37,872 WARN L169 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-07-22 11:03:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:03:40,014 INFO L93 Difference]: Finished difference Result 6132 states and 6550 transitions. [2018-07-22 11:03:40,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-22 11:03:40,015 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 585 [2018-07-22 11:03:40,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:03:40,016 INFO L225 Difference]: With dead ends: 6132 [2018-07-22 11:03:40,016 INFO L226 Difference]: Without dead ends: 0 [2018-07-22 11:03:40,020 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 606 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=346, Invalid=1292, Unknown=2, NotChecked=0, Total=1640 [2018-07-22 11:03:40,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-22 11:03:40,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-22 11:03:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-22 11:03:40,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-22 11:03:40,021 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 585 [2018-07-22 11:03:40,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:03:40,021 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-22 11:03:40,022 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-22 11:03:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-22 11:03:40,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-22 11:03:40,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-22 11:03:40,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,404 WARN L169 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 334 DAG size of output: 244 [2018-07-22 11:03:40,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:03:40,752 WARN L169 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 343 DAG size of output: 247 [2018-07-22 11:03:53,167 WARN L169 SmtUtils]: Spent 12.41 s on a formula simplification. DAG size of input: 229 DAG size of output: 80 [2018-07-22 11:04:02,868 WARN L169 SmtUtils]: Spent 9.70 s on a formula simplification. DAG size of input: 232 DAG size of output: 85 [2018-07-22 11:04:02,871 INFO L421 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-07-22 11:04:02,871 INFO L421 ceAbstractionStarter]: For program point L60(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,871 INFO L421 ceAbstractionStarter]: For program point L63(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,871 INFO L421 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-07-22 11:04:02,871 INFO L421 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-07-22 11:04:02,871 INFO L421 ceAbstractionStarter]: For program point L66(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,871 INFO L421 ceAbstractionStarter]: For program point L69(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,871 INFO L421 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-07-22 11:04:02,871 INFO L421 ceAbstractionStarter]: For program point L72(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,871 INFO L421 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-07-22 11:04:02,872 INFO L421 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-07-22 11:04:02,872 INFO L421 ceAbstractionStarter]: For program point L75(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,872 INFO L421 ceAbstractionStarter]: For program point L78(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,872 INFO L421 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-07-22 11:04:02,872 INFO L421 ceAbstractionStarter]: For program point L81(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,872 INFO L421 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-07-22 11:04:02,872 INFO L421 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-07-22 11:04:02,872 INFO L421 ceAbstractionStarter]: For program point L84(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,872 INFO L421 ceAbstractionStarter]: For program point L87(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,873 INFO L421 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-07-22 11:04:02,873 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-22 11:04:02,876 INFO L421 ceAbstractionStarter]: For program point L90(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,876 INFO L421 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-07-22 11:04:02,876 INFO L421 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-07-22 11:04:02,876 INFO L421 ceAbstractionStarter]: For program point L93(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,877 INFO L421 ceAbstractionStarter]: For program point L96(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,877 INFO L421 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-07-22 11:04:02,877 INFO L421 ceAbstractionStarter]: For program point L99(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,877 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-22 11:04:02,877 INFO L421 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-07-22 11:04:02,877 INFO L421 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-07-22 11:04:02,877 INFO L421 ceAbstractionStarter]: For program point L198'(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,877 INFO L421 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-07-22 11:04:02,877 INFO L421 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-07-22 11:04:02,878 INFO L421 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-07-22 11:04:02,878 INFO L421 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-07-22 11:04:02,878 INFO L421 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-07-22 11:04:02,878 INFO L421 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-07-22 11:04:02,878 INFO L421 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-07-22 11:04:02,878 INFO L421 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-07-22 11:04:02,878 INFO L421 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-07-22 11:04:02,878 INFO L421 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-07-22 11:04:02,878 INFO L421 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-07-22 11:04:02,878 INFO L421 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-07-22 11:04:02,879 INFO L421 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-07-22 11:04:02,879 INFO L421 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-07-22 11:04:02,879 INFO L421 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-07-22 11:04:02,879 INFO L421 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-07-22 11:04:02,879 INFO L421 ceAbstractionStarter]: For program point L201(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,879 INFO L421 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-07-22 11:04:02,879 INFO L421 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-07-22 11:04:02,879 INFO L421 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-07-22 11:04:02,879 INFO L421 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-07-22 11:04:02,879 INFO L421 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-07-22 11:04:02,880 INFO L421 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-07-22 11:04:02,880 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-07-22 11:04:02,883 INFO L421 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-07-22 11:04:02,884 INFO L421 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-07-22 11:04:02,884 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-22 11:04:02,884 INFO L421 ceAbstractionStarter]: For program point L21'(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,884 INFO L421 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-07-22 11:04:02,884 INFO L421 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-07-22 11:04:02,884 INFO L421 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-07-22 11:04:02,884 INFO L421 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-07-22 11:04:02,884 INFO L421 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-07-22 11:04:02,884 INFO L421 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-07-22 11:04:02,884 INFO L421 ceAbstractionStarter]: For program point L582(lines 582 591) no Hoare annotation was computed. [2018-07-22 11:04:02,884 INFO L421 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-07-22 11:04:02,884 INFO L421 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-07-22 11:04:02,885 INFO L421 ceAbstractionStarter]: For program point L102(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,885 INFO L421 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-07-22 11:04:02,885 INFO L421 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-07-22 11:04:02,885 INFO L421 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-07-22 11:04:02,885 INFO L421 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-07-22 11:04:02,885 INFO L421 ceAbstractionStarter]: For program point L105(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,885 INFO L421 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-07-22 11:04:02,885 INFO L421 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-07-22 11:04:02,885 INFO L421 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-07-22 11:04:02,885 INFO L421 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-07-22 11:04:02,885 INFO L421 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-07-22 11:04:02,885 INFO L421 ceAbstractionStarter]: For program point L108(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,885 INFO L421 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-07-22 11:04:02,885 INFO L421 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-07-22 11:04:02,886 INFO L417 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse3 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 9))) (let ((.cse2 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 218)) (.cse11 (<= 1 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)) (.cse10 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 2)) (.cse9 (not .cse3)) (.cse8 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 0)) (.cse6 (or (not (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output_~input 5)) (< 218 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0))) (.cse5 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 3)) (.cse0 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 0)) (.cse1 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 14)) (.cse4 (exists ((v_prenex_21 Int)) (let ((.cse13 (mod v_prenex_21 299993))) (and (<= .cse13 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 600000)) (< v_prenex_21 0) (<= (+ v_prenex_21 13) 0) (not (= .cse13 0)))))) (.cse12 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 8)) (.cse7 (< 0 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 13)))) (or (and .cse0 .cse1 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 4) (or .cse2 (not (= 5 ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output_~input))) .cse3 .cse4) (and (and .cse0 .cse1 .cse5 .cse6) .cse2 .cse3 .cse7) (and .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse11) (and .cse11 (and .cse10 .cse9)) (and .cse8 .cse0 .cse1 .cse6 .cse7) (and .cse12 (not (= 3 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0))) (and .cse0 .cse1 (exists ((v_prenex_7 Int)) (and (<= 0 v_prenex_7) (<= (+ (div (* 5 (div v_prenex_7 5)) 5) 505228) ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0) (<= 23 v_prenex_7))) .cse3 .cse5) (and .cse5 .cse0 .cse1 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 4) (not (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output_~input 2)) .cse3 .cse4) (and .cse12 .cse7)))) [2018-07-22 11:04:02,886 INFO L421 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-07-22 11:04:02,886 INFO L421 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-07-22 11:04:02,886 INFO L424 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2018-07-22 11:04:02,886 INFO L421 ceAbstractionStarter]: For program point L120(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,886 INFO L421 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-07-22 11:04:02,886 INFO L421 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-07-22 11:04:02,886 INFO L421 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-07-22 11:04:02,886 INFO L421 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-07-22 11:04:02,886 INFO L421 ceAbstractionStarter]: For program point L123(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,886 INFO L421 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-07-22 11:04:02,886 INFO L421 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-07-22 11:04:02,886 INFO L421 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-07-22 11:04:02,887 INFO L421 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-07-22 11:04:02,887 INFO L421 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-07-22 11:04:02,887 INFO L421 ceAbstractionStarter]: For program point L126(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,887 INFO L421 ceAbstractionStarter]: For program point L129(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,887 INFO L421 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-07-22 11:04:02,887 INFO L421 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-07-22 11:04:02,887 INFO L421 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-07-22 11:04:02,887 INFO L421 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-07-22 11:04:02,887 INFO L421 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-07-22 11:04:02,887 INFO L421 ceAbstractionStarter]: For program point L111(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,887 INFO L421 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-07-22 11:04:02,887 INFO L421 ceAbstractionStarter]: For program point L117(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,887 INFO L421 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-07-22 11:04:02,887 INFO L421 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-07-22 11:04:02,887 INFO L421 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-07-22 11:04:02,887 INFO L421 ceAbstractionStarter]: For program point L114(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,888 INFO L421 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-07-22 11:04:02,888 INFO L421 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-07-22 11:04:02,888 INFO L421 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-07-22 11:04:02,888 INFO L421 ceAbstractionStarter]: For program point L141(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,888 INFO L421 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-07-22 11:04:02,888 INFO L421 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-07-22 11:04:02,888 INFO L421 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-07-22 11:04:02,888 INFO L421 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-07-22 11:04:02,888 INFO L421 ceAbstractionStarter]: For program point L144(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,888 INFO L421 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-07-22 11:04:02,888 INFO L421 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-07-22 11:04:02,888 INFO L421 ceAbstractionStarter]: For program point L147(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,888 INFO L421 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-07-22 11:04:02,888 INFO L421 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-07-22 11:04:02,888 INFO L421 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-07-22 11:04:02,888 INFO L421 ceAbstractionStarter]: For program point L135(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,889 INFO L421 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-07-22 11:04:02,889 INFO L421 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-07-22 11:04:02,889 INFO L421 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-07-22 11:04:02,889 INFO L421 ceAbstractionStarter]: For program point L132(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,889 INFO L421 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-07-22 11:04:02,889 INFO L421 ceAbstractionStarter]: For program point L138(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,889 INFO L421 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-07-22 11:04:02,889 INFO L421 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-07-22 11:04:02,889 INFO L421 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-07-22 11:04:02,889 INFO L421 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-07-22 11:04:02,889 INFO L421 ceAbstractionStarter]: For program point L162(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,889 INFO L421 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-07-22 11:04:02,889 INFO L421 ceAbstractionStarter]: For program point L168(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,889 INFO L421 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-07-22 11:04:02,890 INFO L421 ceAbstractionStarter]: For program point L165(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,890 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-07-22 11:04:02,890 INFO L421 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-07-22 11:04:02,890 INFO L421 ceAbstractionStarter]: For program point L171(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,890 INFO L421 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-07-22 11:04:02,890 INFO L421 ceAbstractionStarter]: For program point L153(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,890 INFO L421 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-07-22 11:04:02,890 INFO L421 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-07-22 11:04:02,890 INFO L421 ceAbstractionStarter]: For program point L150(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,890 INFO L421 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-07-22 11:04:02,890 INFO L421 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-07-22 11:04:02,890 INFO L421 ceAbstractionStarter]: For program point L156(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,890 INFO L421 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-07-22 11:04:02,890 INFO L421 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-07-22 11:04:02,891 INFO L421 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-07-22 11:04:02,891 INFO L421 ceAbstractionStarter]: For program point L159(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,891 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 199) no Hoare annotation was computed. [2018-07-22 11:04:02,891 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-22 11:04:02,891 INFO L417 ceAbstractionStarter]: At program point L582''(lines 582 591) the Hoare annotation is: (let ((.cse3 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 9))) (let ((.cse2 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 218)) (.cse11 (<= 1 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)) (.cse10 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 2)) (.cse9 (not .cse3)) (.cse8 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 0)) (.cse6 (or (not (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output_~input 5)) (< 218 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0))) (.cse5 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 3)) (.cse0 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 0)) (.cse1 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 14)) (.cse4 (exists ((v_prenex_21 Int)) (let ((.cse13 (mod v_prenex_21 299993))) (and (<= .cse13 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 600000)) (< v_prenex_21 0) (<= (+ v_prenex_21 13) 0) (not (= .cse13 0)))))) (.cse12 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 8)) (.cse7 (< 0 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 13)))) (or (and .cse0 .cse1 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 4) (or .cse2 (not (= 5 ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output_~input))) .cse3 .cse4) (and (and .cse0 .cse1 .cse5 .cse6) .cse2 .cse3 .cse7) (and .cse8 .cse9) (and .cse8 .cse0 (and (= 14 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0) (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 23) (<= 23 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0))) (and .cse0 .cse1 .cse10 .cse11) (and .cse11 (and .cse10 .cse9)) (and .cse8 .cse0 .cse1 .cse6 .cse7) (and .cse12 (not (= 3 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0))) (and .cse0 .cse1 (exists ((v_prenex_7 Int)) (and (<= 0 v_prenex_7) (<= (+ (div (* 5 (div v_prenex_7 5)) 5) 505228) ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0) (<= 23 v_prenex_7))) .cse3 .cse5) (and .cse5 .cse0 .cse1 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 4) (not (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output_~input 2)) .cse3 .cse4) (and .cse12 .cse7)))) [2018-07-22 11:04:02,891 INFO L421 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-07-22 11:04:02,891 INFO L421 ceAbstractionStarter]: For program point L186(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,891 INFO L421 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-07-22 11:04:02,891 INFO L421 ceAbstractionStarter]: For program point L183(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,891 INFO L421 ceAbstractionStarter]: For program point L189(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,891 INFO L421 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-07-22 11:04:02,892 INFO L421 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-07-22 11:04:02,892 INFO L421 ceAbstractionStarter]: For program point L192(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,892 INFO L421 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-07-22 11:04:02,892 INFO L421 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-07-22 11:04:02,892 INFO L421 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-07-22 11:04:02,892 INFO L421 ceAbstractionStarter]: For program point L174(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,892 INFO L421 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-07-22 11:04:02,892 INFO L421 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-07-22 11:04:02,892 INFO L421 ceAbstractionStarter]: For program point L177(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,892 INFO L421 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-07-22 11:04:02,892 INFO L421 ceAbstractionStarter]: For program point L180(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,893 INFO L421 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-07-22 11:04:02,893 INFO L421 ceAbstractionStarter]: For program point L195(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,893 INFO L421 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-07-22 11:04:02,893 INFO L421 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-07-22 11:04:02,893 INFO L421 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-07-22 11:04:02,893 INFO L421 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-07-22 11:04:02,893 INFO L421 ceAbstractionStarter]: For program point L24(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,893 INFO L421 ceAbstractionStarter]: For program point L27(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,893 INFO L421 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-07-22 11:04:02,894 INFO L421 ceAbstractionStarter]: For program point L30(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,894 INFO L421 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-07-22 11:04:02,895 INFO L421 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-07-22 11:04:02,895 INFO L421 ceAbstractionStarter]: For program point L33(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,895 INFO L421 ceAbstractionStarter]: For program point L36(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,895 INFO L421 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-07-22 11:04:02,895 INFO L421 ceAbstractionStarter]: For program point L39(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,895 INFO L421 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-07-22 11:04:02,895 INFO L421 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-07-22 11:04:02,895 INFO L421 ceAbstractionStarter]: For program point L42(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,896 INFO L421 ceAbstractionStarter]: For program point L45(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,896 INFO L421 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-07-22 11:04:02,896 INFO L421 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-07-22 11:04:02,896 INFO L421 ceAbstractionStarter]: For program point L48(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,896 INFO L421 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-07-22 11:04:02,896 INFO L421 ceAbstractionStarter]: For program point L51(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,896 INFO L421 ceAbstractionStarter]: For program point L54(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,896 INFO L421 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-07-22 11:04:02,896 INFO L421 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-07-22 11:04:02,897 INFO L421 ceAbstractionStarter]: For program point L57(lines 20 574) no Hoare annotation was computed. [2018-07-22 11:04:02,911 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,912 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,913 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,913 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,914 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:02,920 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:02,921 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:02,921 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,921 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,921 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,922 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,942 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,943 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,943 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,943 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,944 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:02,944 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:02,944 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:02,945 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,945 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,945 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,945 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,957 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,957 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,958 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,958 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,958 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:02,959 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:02,959 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:02,959 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,964 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,965 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,965 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,965 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,966 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:02,966 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:02,966 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:02,966 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,966 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,967 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,967 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:04:02 BoogieIcfgContainer [2018-07-22 11:04:02,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-22 11:04:02,971 INFO L168 Benchmark]: Toolchain (without parser) took 98054.21 ms. Allocated memory was 304.6 MB in the beginning and 1.1 GB in the end (delta: 752.4 MB). Free memory was 249.6 MB in the beginning and 304.8 MB in the end (delta: -55.2 MB). Peak memory consumption was 697.1 MB. Max. memory is 5.3 GB. [2018-07-22 11:04:02,972 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 304.6 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-07-22 11:04:02,972 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.74 ms. Allocated memory is still 304.6 MB. Free memory was 249.6 MB in the beginning and 213.2 MB in the end (delta: 36.4 MB). Peak memory consumption was 36.4 MB. Max. memory is 5.3 GB. [2018-07-22 11:04:02,976 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.51 ms. Allocated memory is still 304.6 MB. Free memory was 213.2 MB in the beginning and 203.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-07-22 11:04:02,977 INFO L168 Benchmark]: Boogie Preprocessor took 106.99 ms. Allocated memory is still 304.6 MB. Free memory was 203.2 MB in the beginning and 199.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-07-22 11:04:02,977 INFO L168 Benchmark]: RCFGBuilder took 3377.51 ms. Allocated memory was 304.6 MB in the beginning and 480.2 MB in the end (delta: 175.6 MB). Free memory was 199.2 MB in the beginning and 337.5 MB in the end (delta: -138.3 MB). Peak memory consumption was 53.6 MB. Max. memory is 5.3 GB. [2018-07-22 11:04:02,978 INFO L168 Benchmark]: TraceAbstraction took 93704.97 ms. Allocated memory was 480.2 MB in the beginning and 1.1 GB in the end (delta: 576.7 MB). Free memory was 337.5 MB in the beginning and 304.8 MB in the end (delta: 32.7 MB). Peak memory consumption was 609.5 MB. Max. memory is 5.3 GB. [2018-07-22 11:04:02,982 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.25 ms. Allocated memory is still 304.6 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 723.74 ms. Allocated memory is still 304.6 MB. Free memory was 249.6 MB in the beginning and 213.2 MB in the end (delta: 36.4 MB). Peak memory consumption was 36.4 MB. Max. memory is 5.3 GB. * Boogie Procedure Inliner took 131.51 ms. Allocated memory is still 304.6 MB. Free memory was 213.2 MB in the beginning and 203.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 106.99 ms. Allocated memory is still 304.6 MB. Free memory was 203.2 MB in the beginning and 199.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 3377.51 ms. Allocated memory was 304.6 MB in the beginning and 480.2 MB in the end (delta: 175.6 MB). Free memory was 199.2 MB in the beginning and 337.5 MB in the end (delta: -138.3 MB). Peak memory consumption was 53.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 93704.97 ms. Allocated memory was 480.2 MB in the beginning and 1.1 GB in the end (delta: 576.7 MB). Free memory was 337.5 MB in the beginning and 304.8 MB in the end (delta: 32.7 MB). Peak memory consumption was 609.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 199]: 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: 20]: Loop Invariant [2018-07-22 11:04:02,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:02,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:02,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:02,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:02,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,002 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,002 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,003 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,003 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,003 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:03,003 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:03,003 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:03,003 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,003 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,004 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,004 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] Derived loop invariant: (((((((((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 14) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 4) && (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 <= 218 || !(5 == input))) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 9) && (\exists v_prenex_21 : int :: ((v_prenex_21 % 299993 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 + 600000 && v_prenex_21 < 0) && v_prenex_21 + 13 <= 0) && !(v_prenex_21 % 299993 == 0))) || ((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 14) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 3) && (!(input == 5) || 218 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 <= 218) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 9) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 + 13)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 0 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 9))) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 14) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 <= 2) && 1 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10)) || (1 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 <= 2 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 9))) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 14) && (!(input == 5) || 218 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1)) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 + 13)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 <= 8 && !(3 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10))) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 14) && (\exists v_prenex_7 : int :: (0 <= v_prenex_7 && 5 * (v_prenex_7 / 5) / 5 + 505228 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1) && 23 <= v_prenex_7)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 9) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 3)) || ((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 14) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 <= 4) && !(input == 2)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 9) && (\exists v_prenex_21 : int :: ((v_prenex_21 % 299993 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 + 600000 && v_prenex_21 < 0) && v_prenex_21 + 13 <= 0) && !(v_prenex_21 % 299993 == 0)))) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 <= 8 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 + 13) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 582]: Loop Invariant [2018-07-22 11:04:03,005 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,006 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,006 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,006 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,006 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:03,007 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:03,007 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:03,007 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,007 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,007 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,007 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:03,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:03,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-07-22 11:04:03,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,013 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-07-22 11:04:03,013 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] Derived loop invariant: ((((((((((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 14) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 4) && (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 <= 218 || !(5 == input))) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 9) && (\exists v_prenex_21 : int :: ((v_prenex_21 % 299993 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 + 600000 && v_prenex_21 < 0) && v_prenex_21 + 13 <= 0) && !(v_prenex_21 % 299993 == 0))) || ((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 14) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 3) && (!(input == 5) || 218 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 <= 218) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 9) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 + 13)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 0 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 9))) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 0) && (14 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 <= 23) && 23 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 14) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 <= 2) && 1 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10)) || (1 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 <= 2 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 9))) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 14) && (!(input == 5) || 218 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1)) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 + 13)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 <= 8 && !(3 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10))) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 14) && (\exists v_prenex_7 : int :: (0 <= v_prenex_7 && 5 * (v_prenex_7 / 5) / 5 + 505228 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1) && 23 <= v_prenex_7)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 9) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 3)) || ((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 14) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 <= 4) && !(input == 2)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 9) && (\exists v_prenex_21 : int :: ((v_prenex_21 % 299993 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 + 600000 && v_prenex_21 < 0) && v_prenex_21 + 13 <= 0) && !(v_prenex_21 % 299993 == 0)))) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 <= 8 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 + 13) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 207 locations, 1 error locations. SAFE Result, 93.5s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 49.4s AutomataDifference, 0.0s DeadEndRemovalTime, 22.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1277 SDtfs, 8845 SDslu, 1324 SDs, 0 SdLazy, 31091 SolverSat, 2565 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2275 GetRequests, 2137 SyntacticMatches, 15 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 22.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3430occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 3164 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 134 NumberOfFragments, 464 HoareAnnotationTreeSize, 3 FomulaSimplifications, 62926 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 14378 FormulaSimplificationTreeSizeReductionInter, 22.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 5230 NumberOfCodeBlocks, 5230 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 5214 ConstructedInterpolants, 464 QuantifiedInterpolants, 20384302 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2730 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 5460/7574 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/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Problem10_label59_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-22_11-04-03-025.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Problem10_label59_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-22_11-04-03-025.csv Received shutdown request...