./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem11_label30_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem11_label30_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d242fd154f76fbbdca66276c5caf34f74dcc939 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 22:31:06,978 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 22:31:06,980 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 22:31:06,993 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 22:31:06,993 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 22:31:06,994 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 22:31:06,996 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 22:31:06,998 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 22:31:07,000 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 22:31:07,001 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 22:31:07,002 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 22:31:07,002 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 22:31:07,004 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 22:31:07,004 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 22:31:07,006 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 22:31:07,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 22:31:07,007 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 22:31:07,010 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 22:31:07,012 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 22:31:07,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 22:31:07,015 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 22:31:07,016 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 22:31:07,019 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 22:31:07,019 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 22:31:07,019 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 22:31:07,020 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 22:31:07,022 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 22:31:07,022 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 22:31:07,023 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 22:31:07,025 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 22:31:07,025 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 22:31:07,026 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 22:31:07,026 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 22:31:07,026 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 22:31:07,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 22:31:07,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 22:31:07,028 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 22:31:07,044 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 22:31:07,045 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 22:31:07,046 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 22:31:07,046 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 22:31:07,046 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 22:31:07,046 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 22:31:07,047 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 22:31:07,047 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 22:31:07,048 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 22:31:07,048 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 22:31:07,048 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 22:31:07,048 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 22:31:07,048 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 22:31:07,048 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 22:31:07,049 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 22:31:07,049 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 22:31:07,049 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 22:31:07,049 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 22:31:07,049 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 22:31:07,049 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 22:31:07,051 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 22:31:07,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 22:31:07,051 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 22:31:07,052 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 22:31:07,052 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 22:31:07,052 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 22:31:07,052 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 22:31:07,053 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 22:31:07,053 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d242fd154f76fbbdca66276c5caf34f74dcc939 [2018-12-30 22:31:07,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 22:31:07,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 22:31:07,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 22:31:07,109 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 22:31:07,110 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 22:31:07,111 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem11_label30_true-unreach-call.c [2018-12-30 22:31:07,185 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b776e7e0c/dddd8a13e95144f486574cc0b4a44858/FLAGa0bf47575 [2018-12-30 22:31:07,865 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 22:31:07,866 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem11_label30_true-unreach-call.c [2018-12-30 22:31:07,884 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b776e7e0c/dddd8a13e95144f486574cc0b4a44858/FLAGa0bf47575 [2018-12-30 22:31:08,032 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b776e7e0c/dddd8a13e95144f486574cc0b4a44858 [2018-12-30 22:31:08,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 22:31:08,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 22:31:08,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 22:31:08,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 22:31:08,044 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 22:31:08,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 10:31:08" (1/1) ... [2018-12-30 22:31:08,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283bee70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:08, skipping insertion in model container [2018-12-30 22:31:08,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 10:31:08" (1/1) ... [2018-12-30 22:31:08,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 22:31:08,133 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 22:31:08,676 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 22:31:08,689 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 22:31:08,931 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 22:31:08,952 INFO L195 MainTranslator]: Completed translation [2018-12-30 22:31:08,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:08 WrapperNode [2018-12-30 22:31:08,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 22:31:08,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 22:31:08,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 22:31:08,956 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 22:31:09,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:08" (1/1) ... [2018-12-30 22:31:09,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:08" (1/1) ... [2018-12-30 22:31:09,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 22:31:09,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 22:31:09,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 22:31:09,255 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 22:31:09,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:08" (1/1) ... [2018-12-30 22:31:09,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:08" (1/1) ... [2018-12-30 22:31:09,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:08" (1/1) ... [2018-12-30 22:31:09,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:08" (1/1) ... [2018-12-30 22:31:09,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:08" (1/1) ... [2018-12-30 22:31:09,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:08" (1/1) ... [2018-12-30 22:31:09,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:08" (1/1) ... [2018-12-30 22:31:09,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 22:31:09,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 22:31:09,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 22:31:09,434 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 22:31:09,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 22:31:09,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 22:31:09,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 22:31:13,970 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 22:31:13,971 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 22:31:13,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 10:31:13 BoogieIcfgContainer [2018-12-30 22:31:13,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 22:31:13,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 22:31:13,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 22:31:13,977 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 22:31:13,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 10:31:08" (1/3) ... [2018-12-30 22:31:13,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a604bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 10:31:13, skipping insertion in model container [2018-12-30 22:31:13,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:08" (2/3) ... [2018-12-30 22:31:13,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a604bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 10:31:13, skipping insertion in model container [2018-12-30 22:31:13,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 10:31:13" (3/3) ... [2018-12-30 22:31:13,982 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label30_true-unreach-call.c [2018-12-30 22:31:13,995 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 22:31:14,005 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 22:31:14,025 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 22:31:14,067 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 22:31:14,068 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 22:31:14,068 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 22:31:14,068 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 22:31:14,069 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 22:31:14,069 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 22:31:14,069 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 22:31:14,070 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 22:31:14,070 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 22:31:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2018-12-30 22:31:14,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-30 22:31:14,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:31:14,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:31:14,111 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:31:14,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:31:14,117 INFO L82 PathProgramCache]: Analyzing trace with hash -748286455, now seen corresponding path program 1 times [2018-12-30 22:31:14,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:31:14,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:31:14,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:14,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:31:14,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:31:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:31:14,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:31:14,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 22:31:14,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:31:14,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:31:14,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:31:14,608 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2018-12-30 22:31:18,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:31:18,476 INFO L93 Difference]: Finished difference Result 973 states and 1743 transitions. [2018-12-30 22:31:18,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:31:18,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-12-30 22:31:18,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:31:18,499 INFO L225 Difference]: With dead ends: 973 [2018-12-30 22:31:18,500 INFO L226 Difference]: Without dead ends: 607 [2018-12-30 22:31:18,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:31:18,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-12-30 22:31:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2018-12-30 22:31:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-12-30 22:31:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 874 transitions. [2018-12-30 22:31:18,589 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 874 transitions. Word has length 29 [2018-12-30 22:31:18,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:31:18,590 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 874 transitions. [2018-12-30 22:31:18,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:31:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 874 transitions. [2018-12-30 22:31:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-30 22:31:18,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:31:18,595 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-30 22:31:18,595 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:31:18,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:31:18,596 INFO L82 PathProgramCache]: Analyzing trace with hash -618924976, now seen corresponding path program 1 times [2018-12-30 22:31:18,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:31:18,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:31:18,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:18,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:31:18,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:31:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:31:18,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:31:18,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 22:31:18,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:31:18,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:31:18,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:31:18,878 INFO L87 Difference]: Start difference. First operand 604 states and 874 transitions. Second operand 4 states. [2018-12-30 22:31:21,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:31:21,784 INFO L93 Difference]: Finished difference Result 2328 states and 3390 transitions. [2018-12-30 22:31:21,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:31:21,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-30 22:31:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:31:21,797 INFO L225 Difference]: With dead ends: 2328 [2018-12-30 22:31:21,798 INFO L226 Difference]: Without dead ends: 1726 [2018-12-30 22:31:21,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:31:21,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2018-12-30 22:31:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1710. [2018-12-30 22:31:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2018-12-30 22:31:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2342 transitions. [2018-12-30 22:31:21,970 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2342 transitions. Word has length 97 [2018-12-30 22:31:21,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:31:21,971 INFO L480 AbstractCegarLoop]: Abstraction has 1710 states and 2342 transitions. [2018-12-30 22:31:21,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:31:21,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2342 transitions. [2018-12-30 22:31:21,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-30 22:31:21,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:31:21,984 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-30 22:31:21,984 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:31:21,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:31:21,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1171000047, now seen corresponding path program 1 times [2018-12-30 22:31:21,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:31:21,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:31:21,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:21,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:31:21,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:31:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:31:22,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:31:22,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 22:31:22,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 22:31:22,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 22:31:22,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:31:22,208 INFO L87 Difference]: Start difference. First operand 1710 states and 2342 transitions. Second operand 3 states. [2018-12-30 22:31:24,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:31:24,355 INFO L93 Difference]: Finished difference Result 4707 states and 6454 transitions. [2018-12-30 22:31:24,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 22:31:24,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-12-30 22:31:24,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:31:24,372 INFO L225 Difference]: With dead ends: 4707 [2018-12-30 22:31:24,372 INFO L226 Difference]: Without dead ends: 2999 [2018-12-30 22:31:24,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:31:24,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2018-12-30 22:31:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2999. [2018-12-30 22:31:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2018-12-30 22:31:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3735 transitions. [2018-12-30 22:31:24,439 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3735 transitions. Word has length 123 [2018-12-30 22:31:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:31:24,439 INFO L480 AbstractCegarLoop]: Abstraction has 2999 states and 3735 transitions. [2018-12-30 22:31:24,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 22:31:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3735 transitions. [2018-12-30 22:31:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-30 22:31:24,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:31:24,443 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-30 22:31:24,443 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:31:24,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:31:24,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1063098843, now seen corresponding path program 1 times [2018-12-30 22:31:24,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:31:24,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:31:24,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:24,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:31:24,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:31:24,796 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-12-30 22:31:24,825 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-30 22:31:24,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:31:24,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:31:24,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:31:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:31:24,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:31:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 22:31:24,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 22:31:24,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-12-30 22:31:24,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:31:24,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:31:25,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:31:25,000 INFO L87 Difference]: Start difference. First operand 2999 states and 3735 transitions. Second operand 4 states. [2018-12-30 22:31:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:31:27,897 INFO L93 Difference]: Finished difference Result 8762 states and 10637 transitions. [2018-12-30 22:31:27,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:31:27,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-12-30 22:31:27,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:31:27,926 INFO L225 Difference]: With dead ends: 8762 [2018-12-30 22:31:27,926 INFO L226 Difference]: Without dead ends: 5765 [2018-12-30 22:31:27,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:31:27,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2018-12-30 22:31:28,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 5580. [2018-12-30 22:31:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5580 states. [2018-12-30 22:31:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5580 states to 5580 states and 6694 transitions. [2018-12-30 22:31:28,050 INFO L78 Accepts]: Start accepts. Automaton has 5580 states and 6694 transitions. Word has length 151 [2018-12-30 22:31:28,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:31:28,053 INFO L480 AbstractCegarLoop]: Abstraction has 5580 states and 6694 transitions. [2018-12-30 22:31:28,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:31:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 5580 states and 6694 transitions. [2018-12-30 22:31:28,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-30 22:31:28,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:31:28,062 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-30 22:31:28,062 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:31:28,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:31:28,064 INFO L82 PathProgramCache]: Analyzing trace with hash 786326133, now seen corresponding path program 1 times [2018-12-30 22:31:28,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:31:28,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:31:28,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:28,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:31:28,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:31:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:31:28,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:31:28,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 22:31:28,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:31:28,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:31:28,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:31:28,477 INFO L87 Difference]: Start difference. First operand 5580 states and 6694 transitions. Second operand 4 states. [2018-12-30 22:31:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:31:33,376 INFO L93 Difference]: Finished difference Result 12836 states and 15535 transitions. [2018-12-30 22:31:33,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:31:33,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-30 22:31:33,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:31:33,407 INFO L225 Difference]: With dead ends: 12836 [2018-12-30 22:31:33,407 INFO L226 Difference]: Without dead ends: 7442 [2018-12-30 22:31:33,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:31:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7442 states. [2018-12-30 22:31:33,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7442 to 7236. [2018-12-30 22:31:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7236 states. [2018-12-30 22:31:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7236 states to 7236 states and 8587 transitions. [2018-12-30 22:31:33,546 INFO L78 Accepts]: Start accepts. Automaton has 7236 states and 8587 transitions. Word has length 156 [2018-12-30 22:31:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:31:33,547 INFO L480 AbstractCegarLoop]: Abstraction has 7236 states and 8587 transitions. [2018-12-30 22:31:33,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:31:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 7236 states and 8587 transitions. [2018-12-30 22:31:33,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-30 22:31:33,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:31:33,555 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 22:31:33,555 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:31:33,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:31:33,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1660657955, now seen corresponding path program 1 times [2018-12-30 22:31:33,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:31:33,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:31:33,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:33,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:31:33,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:31:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 89 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:31:34,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:31:34,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:31:34,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:31:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:31:34,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:31:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 53 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:31:34,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:31:34,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2018-12-30 22:31:34,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 22:31:34,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 22:31:34,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-30 22:31:34,878 INFO L87 Difference]: Start difference. First operand 7236 states and 8587 transitions. Second operand 8 states. [2018-12-30 22:31:35,016 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 12 [2018-12-30 22:31:45,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:31:45,374 INFO L93 Difference]: Finished difference Result 22220 states and 26520 transitions. [2018-12-30 22:31:45,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-30 22:31:45,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 241 [2018-12-30 22:31:45,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:31:45,430 INFO L225 Difference]: With dead ends: 22220 [2018-12-30 22:31:45,431 INFO L226 Difference]: Without dead ends: 15170 [2018-12-30 22:31:45,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-30 22:31:45,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15170 states. [2018-12-30 22:31:45,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15170 to 12398. [2018-12-30 22:31:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12398 states. [2018-12-30 22:31:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12398 states to 12398 states and 14632 transitions. [2018-12-30 22:31:45,671 INFO L78 Accepts]: Start accepts. Automaton has 12398 states and 14632 transitions. Word has length 241 [2018-12-30 22:31:45,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:31:45,672 INFO L480 AbstractCegarLoop]: Abstraction has 12398 states and 14632 transitions. [2018-12-30 22:31:45,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 22:31:45,672 INFO L276 IsEmpty]: Start isEmpty. Operand 12398 states and 14632 transitions. [2018-12-30 22:31:45,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-30 22:31:45,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:31:45,678 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:31:45,679 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:31:45,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:31:45,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1739170223, now seen corresponding path program 1 times [2018-12-30 22:31:45,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:31:45,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:31:45,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:45,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:31:45,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:31:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-30 22:31:45,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:31:45,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 22:31:45,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 22:31:45,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 22:31:45,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:31:45,965 INFO L87 Difference]: Start difference. First operand 12398 states and 14632 transitions. Second operand 3 states. [2018-12-30 22:31:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:31:48,351 INFO L93 Difference]: Finished difference Result 27553 states and 32779 transitions. [2018-12-30 22:31:48,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 22:31:48,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2018-12-30 22:31:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:31:48,379 INFO L225 Difference]: With dead ends: 27553 [2018-12-30 22:31:48,379 INFO L226 Difference]: Without dead ends: 14421 [2018-12-30 22:31:48,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:31:48,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14421 states. [2018-12-30 22:31:48,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14421 to 14421. [2018-12-30 22:31:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14421 states. [2018-12-30 22:31:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14421 states to 14421 states and 16675 transitions. [2018-12-30 22:31:48,598 INFO L78 Accepts]: Start accepts. Automaton has 14421 states and 16675 transitions. Word has length 243 [2018-12-30 22:31:48,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:31:48,599 INFO L480 AbstractCegarLoop]: Abstraction has 14421 states and 16675 transitions. [2018-12-30 22:31:48,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 22:31:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 14421 states and 16675 transitions. [2018-12-30 22:31:48,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-30 22:31:48,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:31:48,605 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 22:31:48,605 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:31:48,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:31:48,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1587586701, now seen corresponding path program 1 times [2018-12-30 22:31:48,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:31:48,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:31:48,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:48,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:31:48,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:31:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:31:49,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:31:49,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 22:31:49,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 22:31:49,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 22:31:49,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:31:49,031 INFO L87 Difference]: Start difference. First operand 14421 states and 16675 transitions. Second operand 5 states. [2018-12-30 22:31:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:31:51,368 INFO L93 Difference]: Finished difference Result 31262 states and 36386 transitions. [2018-12-30 22:31:51,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 22:31:51,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2018-12-30 22:31:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:31:51,402 INFO L225 Difference]: With dead ends: 31262 [2018-12-30 22:31:51,402 INFO L226 Difference]: Without dead ends: 17211 [2018-12-30 22:31:51,418 INFO L631 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-12-30 22:31:51,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17211 states. [2018-12-30 22:31:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17211 to 16084. [2018-12-30 22:31:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16084 states. [2018-12-30 22:31:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16084 states to 16084 states and 18426 transitions. [2018-12-30 22:31:51,656 INFO L78 Accepts]: Start accepts. Automaton has 16084 states and 18426 transitions. Word has length 246 [2018-12-30 22:31:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:31:51,656 INFO L480 AbstractCegarLoop]: Abstraction has 16084 states and 18426 transitions. [2018-12-30 22:31:51,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 22:31:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 16084 states and 18426 transitions. [2018-12-30 22:31:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-12-30 22:31:51,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:31:51,664 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:31:51,664 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:31:51,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:31:51,664 INFO L82 PathProgramCache]: Analyzing trace with hash -535862831, now seen corresponding path program 1 times [2018-12-30 22:31:51,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:31:51,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:31:51,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:51,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:31:51,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:31:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:31:52,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:31:52,059 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:31:52,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:31:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:31:52,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:31:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:31:52,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 22:31:52,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-12-30 22:31:52,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 22:31:52,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 22:31:52,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-30 22:31:52,500 INFO L87 Difference]: Start difference. First operand 16084 states and 18426 transitions. Second operand 7 states. [2018-12-30 22:31:57,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:31:57,395 INFO L93 Difference]: Finished difference Result 38620 states and 44094 transitions. [2018-12-30 22:31:57,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 22:31:57,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 262 [2018-12-30 22:31:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:31:57,421 INFO L225 Difference]: With dead ends: 38620 [2018-12-30 22:31:57,421 INFO L226 Difference]: Without dead ends: 22537 [2018-12-30 22:31:57,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-30 22:31:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22537 states. [2018-12-30 22:31:57,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22537 to 16450. [2018-12-30 22:31:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16450 states. [2018-12-30 22:31:57,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16450 states to 16450 states and 18418 transitions. [2018-12-30 22:31:57,696 INFO L78 Accepts]: Start accepts. Automaton has 16450 states and 18418 transitions. Word has length 262 [2018-12-30 22:31:57,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:31:57,696 INFO L480 AbstractCegarLoop]: Abstraction has 16450 states and 18418 transitions. [2018-12-30 22:31:57,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 22:31:57,697 INFO L276 IsEmpty]: Start isEmpty. Operand 16450 states and 18418 transitions. [2018-12-30 22:31:57,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-12-30 22:31:57,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:31:57,707 INFO L402 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-12-30 22:31:57,707 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:31:57,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:31:57,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2019684113, now seen corresponding path program 1 times [2018-12-30 22:31:57,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:31:57,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:31:57,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:57,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:31:57,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:31:58,292 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-30 22:31:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-12-30 22:31:58,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:31:58,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 22:31:58,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:31:58,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:31:58,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:31:58,334 INFO L87 Difference]: Start difference. First operand 16450 states and 18418 transitions. Second operand 4 states. [2018-12-30 22:32:00,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:32:00,054 INFO L93 Difference]: Finished difference Result 33478 states and 37445 transitions. [2018-12-30 22:32:00,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:32:00,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2018-12-30 22:32:00,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:32:00,071 INFO L225 Difference]: With dead ends: 33478 [2018-12-30 22:32:00,071 INFO L226 Difference]: Without dead ends: 17398 [2018-12-30 22:32:00,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:32:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17398 states. [2018-12-30 22:32:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17398 to 14606. [2018-12-30 22:32:00,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14606 states. [2018-12-30 22:32:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14606 states to 14606 states and 16182 transitions. [2018-12-30 22:32:00,280 INFO L78 Accepts]: Start accepts. Automaton has 14606 states and 16182 transitions. Word has length 311 [2018-12-30 22:32:00,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:32:00,281 INFO L480 AbstractCegarLoop]: Abstraction has 14606 states and 16182 transitions. [2018-12-30 22:32:00,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:32:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 14606 states and 16182 transitions. [2018-12-30 22:32:00,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-12-30 22:32:00,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:32:00,294 INFO L402 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-30 22:32:00,295 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:32:00,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:32:00,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2055586056, now seen corresponding path program 1 times [2018-12-30 22:32:00,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:32:00,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:32:00,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:00,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:00,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:00,875 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-12-30 22:32:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 80 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-30 22:32:01,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:32:01,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:32:01,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:01,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:32:01,523 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 483 DAG size of output: 27 [2018-12-30 22:32:02,018 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 80 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-30 22:32:02,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:32:02,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-12-30 22:32:02,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 22:32:02,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 22:32:02,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-30 22:32:02,038 INFO L87 Difference]: Start difference. First operand 14606 states and 16182 transitions. Second operand 7 states. [2018-12-30 22:32:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:32:05,625 INFO L93 Difference]: Finished difference Result 32165 states and 35682 transitions. [2018-12-30 22:32:05,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 22:32:05,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 338 [2018-12-30 22:32:05,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:32:05,642 INFO L225 Difference]: With dead ends: 32165 [2018-12-30 22:32:05,642 INFO L226 Difference]: Without dead ends: 17376 [2018-12-30 22:32:05,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-30 22:32:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17376 states. [2018-12-30 22:32:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17376 to 14975. [2018-12-30 22:32:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14975 states. [2018-12-30 22:32:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14975 states to 14975 states and 16512 transitions. [2018-12-30 22:32:05,842 INFO L78 Accepts]: Start accepts. Automaton has 14975 states and 16512 transitions. Word has length 338 [2018-12-30 22:32:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:32:05,842 INFO L480 AbstractCegarLoop]: Abstraction has 14975 states and 16512 transitions. [2018-12-30 22:32:05,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 22:32:05,843 INFO L276 IsEmpty]: Start isEmpty. Operand 14975 states and 16512 transitions. [2018-12-30 22:32:05,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-12-30 22:32:05,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:32:05,864 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:32:05,865 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:32:05,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:32:05,865 INFO L82 PathProgramCache]: Analyzing trace with hash 209609097, now seen corresponding path program 1 times [2018-12-30 22:32:05,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:32:05,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:32:05,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:05,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:05,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:06,233 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-12-30 22:32:06,394 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2018-12-30 22:32:06,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:32:06,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 22:32:06,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:32:06,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:32:06,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:32:06,396 INFO L87 Difference]: Start difference. First operand 14975 states and 16512 transitions. Second operand 4 states. [2018-12-30 22:32:07,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:32:07,834 INFO L93 Difference]: Finished difference Result 32346 states and 35608 transitions. [2018-12-30 22:32:07,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:32:07,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 394 [2018-12-30 22:32:07,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:32:07,856 INFO L225 Difference]: With dead ends: 32346 [2018-12-30 22:32:07,856 INFO L226 Difference]: Without dead ends: 17741 [2018-12-30 22:32:07,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:32:07,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17741 states. [2018-12-30 22:32:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17741 to 13869. [2018-12-30 22:32:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13869 states. [2018-12-30 22:32:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13869 states to 13869 states and 15194 transitions. [2018-12-30 22:32:08,066 INFO L78 Accepts]: Start accepts. Automaton has 13869 states and 15194 transitions. Word has length 394 [2018-12-30 22:32:08,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:32:08,066 INFO L480 AbstractCegarLoop]: Abstraction has 13869 states and 15194 transitions. [2018-12-30 22:32:08,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:32:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 13869 states and 15194 transitions. [2018-12-30 22:32:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-12-30 22:32:08,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:32:08,083 INFO L402 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:32:08,083 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:32:08,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:32:08,084 INFO L82 PathProgramCache]: Analyzing trace with hash -584777729, now seen corresponding path program 1 times [2018-12-30 22:32:08,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:32:08,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:32:08,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:08,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:08,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:09,116 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 117 proven. 284 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:32:09,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:32:09,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-12-30 22:32:09,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:09,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:32:09,838 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 19 [2018-12-30 22:32:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 170 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:32:11,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:32:11,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-12-30 22:32:11,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-30 22:32:11,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-30 22:32:11,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-30 22:32:11,072 INFO L87 Difference]: Start difference. First operand 13869 states and 15194 transitions. Second operand 10 states. [2018-12-30 22:32:19,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:32:19,374 INFO L93 Difference]: Finished difference Result 31068 states and 33982 transitions. [2018-12-30 22:32:19,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-30 22:32:19,376 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 424 [2018-12-30 22:32:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:32:19,394 INFO L225 Difference]: With dead ends: 31068 [2018-12-30 22:32:19,394 INFO L226 Difference]: Without dead ends: 17201 [2018-12-30 22:32:19,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-12-30 22:32:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17201 states. [2018-12-30 22:32:19,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17201 to 14789. [2018-12-30 22:32:19,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14789 states. [2018-12-30 22:32:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14789 states to 14789 states and 16143 transitions. [2018-12-30 22:32:19,576 INFO L78 Accepts]: Start accepts. Automaton has 14789 states and 16143 transitions. Word has length 424 [2018-12-30 22:32:19,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:32:19,577 INFO L480 AbstractCegarLoop]: Abstraction has 14789 states and 16143 transitions. [2018-12-30 22:32:19,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-30 22:32:19,577 INFO L276 IsEmpty]: Start isEmpty. Operand 14789 states and 16143 transitions. [2018-12-30 22:32:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2018-12-30 22:32:19,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:32:19,605 INFO L402 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-30 22:32:19,606 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:32:19,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:32:19,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2087249021, now seen corresponding path program 1 times [2018-12-30 22:32:19,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:32:19,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:32:19,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:19,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:19,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-12-30 22:32:20,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:32:20,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 22:32:20,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 22:32:20,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 22:32:20,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:32:20,014 INFO L87 Difference]: Start difference. First operand 14789 states and 16143 transitions. Second operand 3 states. [2018-12-30 22:32:20,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:32:20,617 INFO L93 Difference]: Finished difference Result 28276 states and 30810 transitions. [2018-12-30 22:32:20,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 22:32:20,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 475 [2018-12-30 22:32:20,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:32:20,630 INFO L225 Difference]: With dead ends: 28276 [2018-12-30 22:32:20,630 INFO L226 Difference]: Without dead ends: 13857 [2018-12-30 22:32:20,639 INFO L631 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-12-30 22:32:20,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13857 states. [2018-12-30 22:32:20,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13857 to 13670. [2018-12-30 22:32:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13670 states. [2018-12-30 22:32:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13670 states to 13670 states and 14851 transitions. [2018-12-30 22:32:20,804 INFO L78 Accepts]: Start accepts. Automaton has 13670 states and 14851 transitions. Word has length 475 [2018-12-30 22:32:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:32:20,804 INFO L480 AbstractCegarLoop]: Abstraction has 13670 states and 14851 transitions. [2018-12-30 22:32:20,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 22:32:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 13670 states and 14851 transitions. [2018-12-30 22:32:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2018-12-30 22:32:20,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:32:20,830 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-30 22:32:20,830 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:32:20,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:32:20,832 INFO L82 PathProgramCache]: Analyzing trace with hash -522311216, now seen corresponding path program 1 times [2018-12-30 22:32:20,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:32:20,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:32:20,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:20,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:20,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:21,816 WARN L181 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-12-30 22:32:22,298 WARN L181 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-12-30 22:32:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1189 backedges. 816 proven. 229 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-30 22:32:23,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:32:23,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:32:23,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:23,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:32:23,812 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-30 22:32:24,360 WARN L181 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 22 [2018-12-30 22:32:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1189 backedges. 816 proven. 229 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-30 22:32:25,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:32:25,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2018-12-30 22:32:25,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-30 22:32:25,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-30 22:32:25,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-12-30 22:32:25,293 INFO L87 Difference]: Start difference. First operand 13670 states and 14851 transitions. Second operand 13 states. [2018-12-30 22:32:31,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:32:31,216 INFO L93 Difference]: Finished difference Result 27689 states and 30017 transitions. [2018-12-30 22:32:31,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-30 22:32:31,217 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 647 [2018-12-30 22:32:31,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:32:31,230 INFO L225 Difference]: With dead ends: 27689 [2018-12-30 22:32:31,230 INFO L226 Difference]: Without dead ends: 14387 [2018-12-30 22:32:31,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 643 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2018-12-30 22:32:31,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14387 states. [2018-12-30 22:32:31,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14387 to 12368. [2018-12-30 22:32:31,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12368 states. [2018-12-30 22:32:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12368 states to 12368 states and 13380 transitions. [2018-12-30 22:32:31,390 INFO L78 Accepts]: Start accepts. Automaton has 12368 states and 13380 transitions. Word has length 647 [2018-12-30 22:32:31,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:32:31,391 INFO L480 AbstractCegarLoop]: Abstraction has 12368 states and 13380 transitions. [2018-12-30 22:32:31,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-30 22:32:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 12368 states and 13380 transitions. [2018-12-30 22:32:31,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2018-12-30 22:32:31,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:32:31,412 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:32:31,412 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:32:31,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:32:31,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1699215781, now seen corresponding path program 1 times [2018-12-30 22:32:31,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:32:31,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:32:31,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:31,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:31,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:32,057 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-12-30 22:32:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1277 backedges. 269 proven. 1008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:32:32,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:32:32,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:32:32,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:33,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:32:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1277 backedges. 732 proven. 440 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-30 22:32:35,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:32:35,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2018-12-30 22:32:35,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-30 22:32:35,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-30 22:32:35,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-12-30 22:32:35,885 INFO L87 Difference]: Start difference. First operand 12368 states and 13380 transitions. Second operand 15 states. [2018-12-30 22:32:36,332 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 14 [2018-12-30 22:32:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:32:50,524 INFO L93 Difference]: Finished difference Result 27886 states and 30065 transitions. [2018-12-30 22:32:50,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-30 22:32:50,525 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 708 [2018-12-30 22:32:50,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:32:50,526 INFO L225 Difference]: With dead ends: 27886 [2018-12-30 22:32:50,526 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 22:32:50,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=477, Invalid=1593, Unknown=0, NotChecked=0, Total=2070 [2018-12-30 22:32:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 22:32:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 22:32:50,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 22:32:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 22:32:50,538 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 708 [2018-12-30 22:32:50,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:32:50,538 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 22:32:50,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-30 22:32:50,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 22:32:50,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 22:32:50,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 22:32:50,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:50,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:50,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:50,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:50,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:50,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:50,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:50,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:50,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:50,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:50,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:50,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:50,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,859 WARN L181 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 696 DAG size of output: 445 [2018-12-30 22:32:51,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:51,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:52,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:53,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:32:53,016 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 693 DAG size of output: 444 [2018-12-30 22:32:59,351 WARN L181 SmtUtils]: Spent 6.32 s on a formula simplification. DAG size of input: 380 DAG size of output: 149 [2018-12-30 22:33:02,529 WARN L181 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 380 DAG size of output: 149 [2018-12-30 22:33:02,532 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-12-30 22:33:02,533 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-12-30 22:33:02,533 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-12-30 22:33:02,533 INFO L451 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2018-12-30 22:33:02,533 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,533 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,534 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,534 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,534 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,534 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,534 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,534 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-12-30 22:33:02,534 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-12-30 22:33:02,534 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-12-30 22:33:02,534 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,534 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,534 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,535 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,535 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,535 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,535 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,535 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,535 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,535 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-12-30 22:33:02,535 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-12-30 22:33:02,535 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-12-30 22:33:02,535 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,538 INFO L444 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse8 (= ~a25~0 12)) (.cse12 (< 138 ~a23~0)) (.cse17 (<= ~a29~0 130)) (.cse3 (= 1 ~a4~0)) (.cse11 (= ~a25~0 10))) (let ((.cse25 (<= ~a29~0 245)) (.cse21 (<= 130 ~a29~0)) (.cse6 (not .cse11)) (.cse28 (= ~a4~0 1)) (.cse29 (+ ~a23~0 43)) (.cse27 (or (and .cse8 .cse17 .cse3) (and (<= ~a25~0 12) .cse17 .cse3 .cse12) (and .cse17 .cse3 .cse11))) (.cse0 (= ~a8~0 15)) (.cse4 (= ~a3~0 1)) (.cse22 (= ~a25~0 13))) (let ((.cse1 (not .cse22)) (.cse2 (<= ~a29~0 599998)) (.cse18 (and .cse27 .cse0 .cse4)) (.cse24 (not .cse8)) (.cse15 (= ~a25~0 11)) (.cse26 (= ~a25~0 9)) (.cse9 (< 0 .cse29)) (.cse20 (<= ~a25~0 9)) (.cse10 (exists ((v_prenex_40 Int)) (and (<= 0 v_prenex_40) (<= ~a29~0 (+ (mod v_prenex_40 299861) 300139)) (< 277 v_prenex_40)))) (.cse19 (not .cse28)) (.cse5 (<= .cse29 0)) (.cse13 (< 140 ~a29~0)) (.cse16 (<= ~a29~0 277)) (.cse7 (and .cse25 .cse3 .cse21 .cse6))) (or (and .cse0 (exists ((v_prenex_33 Int)) (and (<= 0 v_prenex_33) (<= (+ (mod v_prenex_33 299861) 10250) ~a29~0) (< 140 v_prenex_33))) .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse0 (<= 13 ~a25~0) .cse4 .cse7) (and .cse8 .cse0 (or (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse9) (<= (+ ~a29~0 22) 0) .cse4) (and .cse0 .cse10 .cse11 .cse3 .cse4 .cse12) (and (and .cse0 (or (and .cse13 (let ((.cse14 (exists ((v_~a29~0_499 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_499 15) 261)) (<= 130 v_~a29~0_499) (<= 0 v_~a29~0_499))))) (or (and .cse14 .cse15) (and .cse8 .cse9 .cse14)))) (and .cse8 .cse13 .cse16 .cse12)) .cse4) .cse3) (and .cse0 .cse17 .cse11 .cse4) (and (<= (+ ~a29~0 21) 0) .cse18) (and .cse0 (<= (+ ~a29~0 275923) 0) .cse1 .cse4 .cse5) (and .cse0 .cse2 .cse15 .cse19 .cse4) (and .cse20 .cse3 .cse21 .cse5) (and .cse0 .cse22 (exists ((v_~a29~0_503 Int)) (let ((.cse23 (+ v_~a29~0_503 69157))) (and (<= ~a29~0 (+ (mod .cse23 299861) 300138)) (<= 0 .cse23) (<= 130 v_~a29~0_503)))) .cse3 .cse4 .cse12) (and .cse0 .cse9 .cse24 .cse25 .cse19 .cse4) (and .cse26 .cse27) (and .cse0 .cse25 .cse11 .cse3 .cse4) (and .cse18 .cse24) (and .cse28 .cse11 .cse5) (and .cse25 .cse3 .cse21 .cse5) (and .cse0 .cse9 .cse10 .cse15 .cse21 .cse3 .cse4) (and .cse22 .cse3 .cse12 (<= ~a23~0 262)) (and .cse27 .cse5) (and (or (and .cse26 .cse9) (and .cse20 .cse21)) .cse0 .cse10 .cse3 .cse4) (and .cse19 .cse4 (or (and .cse8 .cse0 .cse13 .cse16 .cse5) (and .cse8 .cse0 (<= ~a4~0 0) .cse13 .cse16))) (and .cse22 (<= ~a23~0 306) .cse7))))) [2018-12-30 22:33:02,538 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,538 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,538 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,538 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,538 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,538 INFO L448 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,538 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,538 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,538 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-12-30 22:33:02,538 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-12-30 22:33:02,539 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-12-30 22:33:02,539 INFO L448 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-12-30 22:33:02,539 INFO L448 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-12-30 22:33:02,539 INFO L448 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-12-30 22:33:02,539 INFO L448 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-12-30 22:33:02,539 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,539 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,539 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,539 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,539 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,539 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,539 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,539 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,540 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,540 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,540 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-12-30 22:33:02,540 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-12-30 22:33:02,540 INFO L448 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-12-30 22:33:02,540 INFO L448 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-12-30 22:33:02,540 INFO L448 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,540 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,540 INFO L448 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,540 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,540 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,540 INFO L448 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-12-30 22:33:02,540 INFO L448 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-12-30 22:33:02,541 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-12-30 22:33:02,541 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,541 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,541 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,541 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,541 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-12-30 22:33:02,541 INFO L448 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-12-30 22:33:02,541 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,541 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,541 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,541 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,541 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,541 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,542 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-12-30 22:33:02,542 INFO L448 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-12-30 22:33:02,542 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,542 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,542 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-30 22:33:02,542 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-12-30 22:33:02,542 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-12-30 22:33:02,542 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,542 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,542 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,542 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,542 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,543 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,543 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,543 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-12-30 22:33:02,543 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-12-30 22:33:02,543 INFO L448 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-12-30 22:33:02,543 INFO L448 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-12-30 22:33:02,543 INFO L448 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-12-30 22:33:02,543 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-12-30 22:33:02,543 INFO L448 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-12-30 22:33:02,543 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,543 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,543 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 22:33:02,544 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-12-30 22:33:02,544 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-12-30 22:33:02,544 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,544 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,544 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,544 INFO L448 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,544 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,544 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-12-30 22:33:02,544 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-12-30 22:33:02,544 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-12-30 22:33:02,544 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,544 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,544 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,545 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,545 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,545 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,545 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-12-30 22:33:02,545 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-12-30 22:33:02,545 INFO L448 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-12-30 22:33:02,545 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,545 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,545 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,545 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,545 INFO L448 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,546 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,547 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,547 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 22:33:02,547 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,547 INFO L448 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-12-30 22:33:02,547 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-12-30 22:33:02,547 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-12-30 22:33:02,547 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,547 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,547 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,547 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,547 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,547 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,548 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,548 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,548 INFO L448 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,548 INFO L448 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,548 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,548 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-12-30 22:33:02,548 INFO L448 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-12-30 22:33:02,548 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-12-30 22:33:02,548 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-12-30 22:33:02,548 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-12-30 22:33:02,548 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,548 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,549 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,549 INFO L448 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,549 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,549 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,549 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,549 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-12-30 22:33:02,550 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-12-30 22:33:02,550 INFO L448 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-12-30 22:33:02,550 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,550 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,550 INFO L448 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,550 INFO L448 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-12-30 22:33:02,550 INFO L448 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-12-30 22:33:02,550 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,550 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,550 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,550 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,550 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,550 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-12-30 22:33:02,551 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-12-30 22:33:02,551 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,551 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,551 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-12-30 22:33:02,551 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-12-30 22:33:02,551 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,551 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,551 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,551 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,551 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,551 INFO L448 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,551 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-12-30 22:33:02,552 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-12-30 22:33:02,552 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-12-30 22:33:02,552 INFO L448 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-12-30 22:33:02,552 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,552 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,552 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,552 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,552 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,552 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,552 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,552 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,552 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-12-30 22:33:02,553 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-12-30 22:33:02,553 INFO L448 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-12-30 22:33:02,553 INFO L448 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-12-30 22:33:02,553 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-12-30 22:33:02,553 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-12-30 22:33:02,553 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,553 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,553 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,553 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,553 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,553 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,553 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,554 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-12-30 22:33:02,554 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-12-30 22:33:02,554 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 22:33:02,554 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,554 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,554 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,554 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,554 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,554 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,554 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-12-30 22:33:02,554 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-12-30 22:33:02,554 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,555 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) no Hoare annotation was computed. [2018-12-30 22:33:02,555 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,555 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,555 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,555 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,555 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,555 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,555 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-12-30 22:33:02,555 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,555 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,555 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,556 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-12-30 22:33:02,556 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-12-30 22:33:02,556 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-12-30 22:33:02,556 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,556 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-12-30 22:33:02,556 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,556 INFO L448 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-12-30 22:33:02,556 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,556 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,556 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,556 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,556 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,557 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,557 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-12-30 22:33:02,557 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-12-30 22:33:02,557 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-12-30 22:33:02,557 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,557 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,557 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,557 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 22:33:02,557 INFO L448 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,557 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,557 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,558 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,561 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,561 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,561 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,561 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-12-30 22:33:02,561 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-12-30 22:33:02,561 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-12-30 22:33:02,561 INFO L448 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,561 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-12-30 22:33:02,561 INFO L448 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-12-30 22:33:02,561 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,562 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,565 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,565 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,565 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,565 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,565 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-12-30 22:33:02,565 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-12-30 22:33:02,565 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-12-30 22:33:02,565 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,565 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,565 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,566 INFO L444 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse8 (= ~a25~0 12)) (.cse12 (< 138 ~a23~0)) (.cse17 (<= ~a29~0 130)) (.cse3 (= 1 ~a4~0)) (.cse11 (= ~a25~0 10))) (let ((.cse25 (<= ~a29~0 245)) (.cse21 (<= 130 ~a29~0)) (.cse6 (not .cse11)) (.cse28 (= ~a4~0 1)) (.cse29 (+ ~a23~0 43)) (.cse27 (or (and .cse8 .cse17 .cse3) (and (<= ~a25~0 12) .cse17 .cse3 .cse12) (and .cse17 .cse3 .cse11))) (.cse0 (= ~a8~0 15)) (.cse4 (= ~a3~0 1)) (.cse22 (= ~a25~0 13))) (let ((.cse1 (not .cse22)) (.cse2 (<= ~a29~0 599998)) (.cse18 (and .cse27 .cse0 .cse4)) (.cse24 (not .cse8)) (.cse15 (= ~a25~0 11)) (.cse26 (= ~a25~0 9)) (.cse9 (< 0 .cse29)) (.cse20 (<= ~a25~0 9)) (.cse10 (exists ((v_prenex_40 Int)) (and (<= 0 v_prenex_40) (<= ~a29~0 (+ (mod v_prenex_40 299861) 300139)) (< 277 v_prenex_40)))) (.cse19 (not .cse28)) (.cse5 (<= .cse29 0)) (.cse13 (< 140 ~a29~0)) (.cse16 (<= ~a29~0 277)) (.cse7 (and .cse25 .cse3 .cse21 .cse6))) (or (and .cse0 (exists ((v_prenex_33 Int)) (and (<= 0 v_prenex_33) (<= (+ (mod v_prenex_33 299861) 10250) ~a29~0) (< 140 v_prenex_33))) .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse0 (<= 13 ~a25~0) .cse4 .cse7) (and .cse8 .cse0 (or (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse9) (<= (+ ~a29~0 22) 0) .cse4) (and .cse0 .cse10 .cse11 .cse3 .cse4 .cse12) (and (and .cse0 (or (and .cse13 (let ((.cse14 (exists ((v_~a29~0_499 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_499 15) 261)) (<= 130 v_~a29~0_499) (<= 0 v_~a29~0_499))))) (or (and .cse14 .cse15) (and .cse8 .cse9 .cse14)))) (and .cse8 .cse13 .cse16 .cse12)) .cse4) .cse3) (and .cse0 .cse17 .cse11 .cse4) (and (<= (+ ~a29~0 21) 0) .cse18) (and .cse0 (<= (+ ~a29~0 275923) 0) .cse1 .cse4 .cse5) (and .cse0 .cse2 .cse15 .cse19 .cse4) (and .cse20 .cse3 .cse21 .cse5) (and .cse0 .cse22 (exists ((v_~a29~0_503 Int)) (let ((.cse23 (+ v_~a29~0_503 69157))) (and (<= ~a29~0 (+ (mod .cse23 299861) 300138)) (<= 0 .cse23) (<= 130 v_~a29~0_503)))) .cse3 .cse4 .cse12) (and .cse0 .cse9 .cse24 .cse25 .cse19 .cse4) (and .cse26 .cse27) (and .cse0 .cse25 .cse11 .cse3 .cse4) (and .cse18 .cse24) (and .cse28 .cse11 .cse5) (and .cse25 .cse3 .cse21 .cse5) (and .cse0 .cse9 .cse10 .cse15 .cse21 .cse3 .cse4) (and .cse22 .cse3 .cse12 (<= ~a23~0 262)) (and .cse27 .cse5) (and (or (and .cse26 .cse9) (and .cse20 .cse21)) .cse0 .cse10 .cse3 .cse4) (and .cse19 .cse4 (or (and .cse8 .cse0 .cse13 .cse16 .cse5) (and .cse8 .cse0 (<= ~a4~0 0) .cse13 .cse16))) (and .cse22 (<= ~a23~0 306) .cse7))))) [2018-12-30 22:33:02,566 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,566 INFO L448 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-12-30 22:33:02,566 INFO L448 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-12-30 22:33:02,566 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,566 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,566 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-12-30 22:33:02,566 INFO L448 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,567 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,567 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:33:02,597 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:02,598 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:02,601 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:02,601 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,613 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,613 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,618 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:02,618 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:02,618 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:02,619 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,619 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,625 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,625 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,625 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,627 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:02,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:02,642 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:02,642 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,642 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,645 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,645 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,647 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,647 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,647 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:02,648 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:02,648 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:02,648 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,649 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,654 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,654 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:02,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:02,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:02,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:02,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:02,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:02,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,675 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,675 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,676 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,680 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:02,681 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:02,681 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:02,681 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,685 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,685 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,690 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,690 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,691 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:02,691 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:02,691 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:02,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:02,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:02,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 10:33:02 BoogieIcfgContainer [2018-12-30 22:33:02,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 22:33:02,704 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 22:33:02,704 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 22:33:02,704 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 22:33:02,707 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 10:31:13" (3/4) ... [2018-12-30 22:33:02,712 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 22:33:02,761 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 22:33:02,764 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 22:33:02,809 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((a8 == 15 && (\exists v_prenex_33 : int :: (0 <= v_prenex_33 && v_prenex_33 % 299861 + 10250 <= a29) && 140 < v_prenex_33)) && !(a25 == 13)) && a29 <= 599998) && !(1 == a4)) && a3 == 1) && a23 + 43 <= 0) && !(a25 == 10)) || (((a8 == 15 && 13 <= a25) && a3 == 1) && ((a29 <= 245 && 1 == a4) && 130 <= a29) && !(a25 == 10))) || ((((a25 == 12 && a8 == 15) && (!(3 == input) || 0 < a23 + 43)) && a29 + 22 <= 0) && a3 == 1)) || (((((a8 == 15 && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && a25 == 10) && 1 == a4) && a3 == 1) && 138 < a23)) || (((a8 == 15 && ((140 < a29 && (((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && a25 == 11) || ((a25 == 12 && 0 < a23 + 43) && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)))) || (((a25 == 12 && 140 < a29) && a29 <= 277) && 138 < a23))) && a3 == 1) && 1 == a4)) || (((a8 == 15 && a29 <= 130) && a25 == 10) && a3 == 1)) || (a29 + 21 <= 0 && (((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a8 == 15) && a3 == 1)) || ((((a8 == 15 && a29 + 275923 <= 0) && !(a25 == 13)) && a3 == 1) && a23 + 43 <= 0)) || ((((a8 == 15 && a29 <= 599998) && a25 == 11) && !(a4 == 1)) && a3 == 1)) || (((a25 <= 9 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((((a8 == 15 && a25 == 13) && (\exists v_~a29~0_503 : int :: (a29 <= (v_~a29~0_503 + 69157) % 299861 + 300138 && 0 <= v_~a29~0_503 + 69157) && 130 <= v_~a29~0_503)) && 1 == a4) && a3 == 1) && 138 < a23)) || (((((a8 == 15 && 0 < a23 + 43) && !(a25 == 12)) && a29 <= 245) && !(a4 == 1)) && a3 == 1)) || (a25 == 9 && ((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)))) || ((((a8 == 15 && a29 <= 245) && a25 == 10) && 1 == a4) && a3 == 1)) || (((((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a8 == 15) && a3 == 1) && !(a25 == 12))) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || ((((((a8 == 15 && 0 < a23 + 43) && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && a25 == 11) && 130 <= a29) && 1 == a4) && a3 == 1)) || (((a25 == 13 && 1 == a4) && 138 < a23) && a23 <= 262)) || (((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a23 + 43 <= 0)) || ((((((a25 == 9 && 0 < a23 + 43) || (a25 <= 9 && 130 <= a29)) && a8 == 15) && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && 1 == a4) && a3 == 1)) || ((!(a4 == 1) && a3 == 1) && (((((a25 == 12 && a8 == 15) && 140 < a29) && a29 <= 277) && a23 + 43 <= 0) || ((((a25 == 12 && a8 == 15) && a4 <= 0) && 140 < a29) && a29 <= 277)))) || ((a25 == 13 && a23 <= 306) && ((a29 <= 245 && 1 == a4) && 130 <= a29) && !(a25 == 10)) [2018-12-30 22:33:02,817 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((a8 == 15 && (\exists v_prenex_33 : int :: (0 <= v_prenex_33 && v_prenex_33 % 299861 + 10250 <= a29) && 140 < v_prenex_33)) && !(a25 == 13)) && a29 <= 599998) && !(1 == a4)) && a3 == 1) && a23 + 43 <= 0) && !(a25 == 10)) || (((a8 == 15 && 13 <= a25) && a3 == 1) && ((a29 <= 245 && 1 == a4) && 130 <= a29) && !(a25 == 10))) || ((((a25 == 12 && a8 == 15) && (!(3 == input) || 0 < a23 + 43)) && a29 + 22 <= 0) && a3 == 1)) || (((((a8 == 15 && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && a25 == 10) && 1 == a4) && a3 == 1) && 138 < a23)) || (((a8 == 15 && ((140 < a29 && (((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && a25 == 11) || ((a25 == 12 && 0 < a23 + 43) && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)))) || (((a25 == 12 && 140 < a29) && a29 <= 277) && 138 < a23))) && a3 == 1) && 1 == a4)) || (((a8 == 15 && a29 <= 130) && a25 == 10) && a3 == 1)) || (a29 + 21 <= 0 && (((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a8 == 15) && a3 == 1)) || ((((a8 == 15 && a29 + 275923 <= 0) && !(a25 == 13)) && a3 == 1) && a23 + 43 <= 0)) || ((((a8 == 15 && a29 <= 599998) && a25 == 11) && !(a4 == 1)) && a3 == 1)) || (((a25 <= 9 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((((a8 == 15 && a25 == 13) && (\exists v_~a29~0_503 : int :: (a29 <= (v_~a29~0_503 + 69157) % 299861 + 300138 && 0 <= v_~a29~0_503 + 69157) && 130 <= v_~a29~0_503)) && 1 == a4) && a3 == 1) && 138 < a23)) || (((((a8 == 15 && 0 < a23 + 43) && !(a25 == 12)) && a29 <= 245) && !(a4 == 1)) && a3 == 1)) || (a25 == 9 && ((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)))) || ((((a8 == 15 && a29 <= 245) && a25 == 10) && 1 == a4) && a3 == 1)) || (((((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a8 == 15) && a3 == 1) && !(a25 == 12))) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || ((((((a8 == 15 && 0 < a23 + 43) && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && a25 == 11) && 130 <= a29) && 1 == a4) && a3 == 1)) || (((a25 == 13 && 1 == a4) && 138 < a23) && a23 <= 262)) || (((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a23 + 43 <= 0)) || ((((((a25 == 9 && 0 < a23 + 43) || (a25 <= 9 && 130 <= a29)) && a8 == 15) && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && 1 == a4) && a3 == 1)) || ((!(a4 == 1) && a3 == 1) && (((((a25 == 12 && a8 == 15) && 140 < a29) && a29 <= 277) && a23 + 43 <= 0) || ((((a25 == 12 && a8 == 15) && a4 <= 0) && 140 < a29) && a29 <= 277)))) || ((a25 == 13 && a23 <= 306) && ((a29 <= 245 && 1 == a4) && 130 <= a29) && !(a25 == 10)) [2018-12-30 22:33:03,064 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 22:33:03,065 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 22:33:03,066 INFO L168 Benchmark]: Toolchain (without parser) took 115028.49 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 946.0 MB in the beginning and 1.5 GB in the end (delta: -570.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-30 22:33:03,066 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 22:33:03,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 915.69 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 892.3 MB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2018-12-30 22:33:03,067 INFO L168 Benchmark]: Boogie Procedure Inliner took 299.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 892.3 MB in the beginning and 1.1 GB in the end (delta: -219.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-12-30 22:33:03,067 INFO L168 Benchmark]: Boogie Preprocessor took 177.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-30 22:33:03,067 INFO L168 Benchmark]: RCFGBuilder took 4538.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 933.6 MB in the end (delta: 164.0 MB). Peak memory consumption was 164.0 MB. Max. memory is 11.5 GB. [2018-12-30 22:33:03,068 INFO L168 Benchmark]: TraceAbstraction took 108730.21 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 933.6 MB in the beginning and 1.6 GB in the end (delta: -619.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-30 22:33:03,068 INFO L168 Benchmark]: Witness Printer took 360.80 ms. Allocated memory is still 2.7 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2018-12-30 22:33:03,070 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 915.69 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 892.3 MB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 299.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 892.3 MB in the beginning and 1.1 GB in the end (delta: -219.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 177.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4538.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 933.6 MB in the end (delta: 164.0 MB). Peak memory consumption was 164.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 108730.21 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 933.6 MB in the beginning and 1.6 GB in the end (delta: -619.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 360.80 ms. Allocated memory is still 2.7 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 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_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 93]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2018-12-30 22:33:03,076 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:03,077 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:03,077 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:03,077 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,078 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,078 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,078 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,079 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,079 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,079 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,079 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,080 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,080 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:03,080 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:03,080 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:03,081 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,081 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,081 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,081 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,081 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,082 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:03,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:03,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:03,085 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,085 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,085 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,085 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,086 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,086 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,086 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,086 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,087 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,087 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:03,087 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:03,088 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:03,088 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,088 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,088 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,088 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,089 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,089 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((a8 == 15 && (\exists v_prenex_33 : int :: (0 <= v_prenex_33 && v_prenex_33 % 299861 + 10250 <= a29) && 140 < v_prenex_33)) && !(a25 == 13)) && a29 <= 599998) && !(1 == a4)) && a3 == 1) && a23 + 43 <= 0) && !(a25 == 10)) || (((a8 == 15 && 13 <= a25) && a3 == 1) && ((a29 <= 245 && 1 == a4) && 130 <= a29) && !(a25 == 10))) || ((((a25 == 12 && a8 == 15) && (!(3 == input) || 0 < a23 + 43)) && a29 + 22 <= 0) && a3 == 1)) || (((((a8 == 15 && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && a25 == 10) && 1 == a4) && a3 == 1) && 138 < a23)) || (((a8 == 15 && ((140 < a29 && (((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && a25 == 11) || ((a25 == 12 && 0 < a23 + 43) && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)))) || (((a25 == 12 && 140 < a29) && a29 <= 277) && 138 < a23))) && a3 == 1) && 1 == a4)) || (((a8 == 15 && a29 <= 130) && a25 == 10) && a3 == 1)) || (a29 + 21 <= 0 && (((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a8 == 15) && a3 == 1)) || ((((a8 == 15 && a29 + 275923 <= 0) && !(a25 == 13)) && a3 == 1) && a23 + 43 <= 0)) || ((((a8 == 15 && a29 <= 599998) && a25 == 11) && !(a4 == 1)) && a3 == 1)) || (((a25 <= 9 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((((a8 == 15 && a25 == 13) && (\exists v_~a29~0_503 : int :: (a29 <= (v_~a29~0_503 + 69157) % 299861 + 300138 && 0 <= v_~a29~0_503 + 69157) && 130 <= v_~a29~0_503)) && 1 == a4) && a3 == 1) && 138 < a23)) || (((((a8 == 15 && 0 < a23 + 43) && !(a25 == 12)) && a29 <= 245) && !(a4 == 1)) && a3 == 1)) || (a25 == 9 && ((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)))) || ((((a8 == 15 && a29 <= 245) && a25 == 10) && 1 == a4) && a3 == 1)) || (((((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a8 == 15) && a3 == 1) && !(a25 == 12))) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || ((((((a8 == 15 && 0 < a23 + 43) && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && a25 == 11) && 130 <= a29) && 1 == a4) && a3 == 1)) || (((a25 == 13 && 1 == a4) && 138 < a23) && a23 <= 262)) || (((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a23 + 43 <= 0)) || ((((((a25 == 9 && 0 < a23 + 43) || (a25 <= 9 && 130 <= a29)) && a8 == 15) && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && 1 == a4) && a3 == 1)) || ((!(a4 == 1) && a3 == 1) && (((((a25 == 12 && a8 == 15) && 140 < a29) && a29 <= 277) && a23 + 43 <= 0) || ((((a25 == 12 && a8 == 15) && a4 <= 0) && 140 < a29) && a29 <= 277)))) || ((a25 == 13 && a23 <= 306) && ((a29 <= 245 && 1 == a4) && 130 <= a29) && !(a25 == 10)) - InvariantResult [Line: 22]: Loop Invariant [2018-12-30 22:33:03,090 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:03,091 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:03,091 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:03,091 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,092 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,092 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,092 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,093 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,093 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,093 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,093 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,094 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,094 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:03,094 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:03,094 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:03,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,097 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,097 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,098 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:03,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:03,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2018-12-30 22:33:03,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,101 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,101 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,101 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,101 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-12-30 22:33:03,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:03,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:03,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2018-12-30 22:33:03,103 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,103 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,103 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,103 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,103 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2018-12-30 22:33:03,103 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((a8 == 15 && (\exists v_prenex_33 : int :: (0 <= v_prenex_33 && v_prenex_33 % 299861 + 10250 <= a29) && 140 < v_prenex_33)) && !(a25 == 13)) && a29 <= 599998) && !(1 == a4)) && a3 == 1) && a23 + 43 <= 0) && !(a25 == 10)) || (((a8 == 15 && 13 <= a25) && a3 == 1) && ((a29 <= 245 && 1 == a4) && 130 <= a29) && !(a25 == 10))) || ((((a25 == 12 && a8 == 15) && (!(3 == input) || 0 < a23 + 43)) && a29 + 22 <= 0) && a3 == 1)) || (((((a8 == 15 && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && a25 == 10) && 1 == a4) && a3 == 1) && 138 < a23)) || (((a8 == 15 && ((140 < a29 && (((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && a25 == 11) || ((a25 == 12 && 0 < a23 + 43) && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)))) || (((a25 == 12 && 140 < a29) && a29 <= 277) && 138 < a23))) && a3 == 1) && 1 == a4)) || (((a8 == 15 && a29 <= 130) && a25 == 10) && a3 == 1)) || (a29 + 21 <= 0 && (((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a8 == 15) && a3 == 1)) || ((((a8 == 15 && a29 + 275923 <= 0) && !(a25 == 13)) && a3 == 1) && a23 + 43 <= 0)) || ((((a8 == 15 && a29 <= 599998) && a25 == 11) && !(a4 == 1)) && a3 == 1)) || (((a25 <= 9 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((((a8 == 15 && a25 == 13) && (\exists v_~a29~0_503 : int :: (a29 <= (v_~a29~0_503 + 69157) % 299861 + 300138 && 0 <= v_~a29~0_503 + 69157) && 130 <= v_~a29~0_503)) && 1 == a4) && a3 == 1) && 138 < a23)) || (((((a8 == 15 && 0 < a23 + 43) && !(a25 == 12)) && a29 <= 245) && !(a4 == 1)) && a3 == 1)) || (a25 == 9 && ((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)))) || ((((a8 == 15 && a29 <= 245) && a25 == 10) && 1 == a4) && a3 == 1)) || (((((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a8 == 15) && a3 == 1) && !(a25 == 12))) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || ((((((a8 == 15 && 0 < a23 + 43) && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && a25 == 11) && 130 <= a29) && 1 == a4) && a3 == 1)) || (((a25 == 13 && 1 == a4) && 138 < a23) && a23 <= 262)) || (((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a23 + 43 <= 0)) || ((((((a25 == 9 && 0 < a23 + 43) || (a25 <= 9 && 130 <= a29)) && a8 == 15) && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && 1 == a4) && a3 == 1)) || ((!(a4 == 1) && a3 == 1) && (((((a25 == 12 && a8 == 15) && 140 < a29) && a29 <= 277) && a23 + 43 <= 0) || ((((a25 == 12 && a8 == 15) && a4 <= 0) && 140 < a29) && a29 <= 277)))) || ((a25 == 13 && a23 <= 306) && ((a29 <= 245 && 1 == a4) && 130 <= a29) && !(a25 == 10)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. SAFE Result, 108.5s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 73.5s AutomataDifference, 0.0s DeadEndRemovalTime, 11.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 2322 SDtfs, 17171 SDslu, 1293 SDs, 0 SdLazy, 40197 SolverSat, 5848 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 59.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2905 GetRequests, 2768 SyntacticMatches, 5 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16450occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 24079 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 202 NumberOfFragments, 1379 HoareAnnotationTreeSize, 3 FomulaSimplifications, 69793 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 36570 FormulaSimplificationTreeSizeReductionInter, 9.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 7616 NumberOfCodeBlocks, 7616 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 7593 ConstructedInterpolants, 789 QuantifiedInterpolants, 24887339 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3633 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 5897/8825 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...