./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label49.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/eca-rers2012/Problem10_label49.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 c2ee6781c62be40fa372129eaacaba9832af3ce9 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:01:31,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:01:31,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:01:31,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:01:31,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:01:31,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:01:31,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:01:31,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:01:31,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:01:31,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:01:31,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:01:31,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:01:31,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:01:31,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:01:31,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:01:31,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:01:31,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:01:31,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:01:31,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:01:31,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:01:31,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:01:31,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:01:31,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:01:31,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:01:31,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:01:31,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:01:31,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:01:31,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:01:31,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:01:31,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:01:31,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:01:31,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:01:31,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:01:31,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:01:31,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:01:31,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:01:31,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:01:31,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:01:31,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:01:31,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:01:31,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:01:31,378 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:01:31,400 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:01:31,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:01:31,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:01:31,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:01:31,402 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:01:31,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:01:31,403 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:01:31,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:01:31,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:01:31,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:01:31,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:01:31,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:01:31,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:01:31,405 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:01:31,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:01:31,405 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:01:31,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:01:31,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:01:31,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:01:31,406 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:01:31,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:01:31,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:01:31,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:01:31,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:01:31,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:01:31,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:01:31,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:01:31,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:01:31,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> c2ee6781c62be40fa372129eaacaba9832af3ce9 [2019-11-27 23:01:31,759 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:01:31,777 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:01:31,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:01:31,783 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:01:31,783 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:01:31,784 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label49.c [2019-11-27 23:01:31,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/893111994/a9852ac7af754d7f80e09c0c95824aaf/FLAG170e90336 [2019-11-27 23:01:32,431 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:01:32,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label49.c [2019-11-27 23:01:32,451 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/893111994/a9852ac7af754d7f80e09c0c95824aaf/FLAG170e90336 [2019-11-27 23:01:32,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/893111994/a9852ac7af754d7f80e09c0c95824aaf [2019-11-27 23:01:32,723 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:01:32,724 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:01:32,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:01:32,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:01:32,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:01:32,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:01:32" (1/1) ... [2019-11-27 23:01:32,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57af3cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:01:32, skipping insertion in model container [2019-11-27 23:01:32,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:01:32" (1/1) ... [2019-11-27 23:01:32,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:01:32,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:01:33,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:01:33,324 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:01:33,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:01:33,469 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:01:33,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:01:33 WrapperNode [2019-11-27 23:01:33,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:01:33,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:01:33,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:01:33,473 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:01:33,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:01:33" (1/1) ... [2019-11-27 23:01:33,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:01:33" (1/1) ... [2019-11-27 23:01:33,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:01:33,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:01:33,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:01:33,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:01:33,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:01:33" (1/1) ... [2019-11-27 23:01:33,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:01:33" (1/1) ... [2019-11-27 23:01:33,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:01:33" (1/1) ... [2019-11-27 23:01:33,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:01:33" (1/1) ... [2019-11-27 23:01:33,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:01:33" (1/1) ... [2019-11-27 23:01:33,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:01:33" (1/1) ... [2019-11-27 23:01:33,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:01:33" (1/1) ... [2019-11-27 23:01:33,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:01:33,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:01:33,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:01:33,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:01:33,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:01:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:01:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:01:33,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:01:35,314 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:01:35,315 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 23:01:35,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:01:35 BoogieIcfgContainer [2019-11-27 23:01:35,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:01:35,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:01:35,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:01:35,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:01:35,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:01:32" (1/3) ... [2019-11-27 23:01:35,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73cfc26a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:01:35, skipping insertion in model container [2019-11-27 23:01:35,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:01:33" (2/3) ... [2019-11-27 23:01:35,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73cfc26a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:01:35, skipping insertion in model container [2019-11-27 23:01:35,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:01:35" (3/3) ... [2019-11-27 23:01:35,327 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label49.c [2019-11-27 23:01:35,337 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:01:35,345 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:01:35,359 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:01:35,390 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:01:35,390 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:01:35,391 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:01:35,391 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:01:35,391 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:01:35,391 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:01:35,392 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:01:35,392 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:01:35,417 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-11-27 23:01:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 23:01:35,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:01:35,426 INFO L410 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] [2019-11-27 23:01:35,427 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:01:35,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:01:35,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1644072970, now seen corresponding path program 1 times [2019-11-27 23:01:35,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:01:35,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968422122] [2019-11-27 23:01:35,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:01:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:01:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:01:35,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968422122] [2019-11-27 23:01:35,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:01:35,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:01:35,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071819660] [2019-11-27 23:01:35,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:01:35,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:01:35,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:01:35,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:01:35,693 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-11-27 23:01:37,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:01:37,440 INFO L93 Difference]: Finished difference Result 694 states and 1246 transitions. [2019-11-27 23:01:37,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:01:37,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-27 23:01:37,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:01:37,474 INFO L225 Difference]: With dead ends: 694 [2019-11-27 23:01:37,474 INFO L226 Difference]: Without dead ends: 421 [2019-11-27 23:01:37,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:01:37,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-27 23:01:37,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-11-27 23:01:37,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-27 23:01:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 586 transitions. [2019-11-27 23:01:37,567 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 586 transitions. Word has length 22 [2019-11-27 23:01:37,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:01:37,567 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 586 transitions. [2019-11-27 23:01:37,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:01:37,568 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 586 transitions. [2019-11-27 23:01:37,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-27 23:01:37,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:01:37,574 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 23:01:37,574 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:01:37,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:01:37,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1869682614, now seen corresponding path program 1 times [2019-11-27 23:01:37,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:01:37,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123103883] [2019-11-27 23:01:37,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:01:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:01:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:01:38,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123103883] [2019-11-27 23:01:38,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466854260] [2019-11-27 23:01:38,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:01:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:01:38,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 23:01:38,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:01:38,135 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-27 23:01:38,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:01:38,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2019-11-27 23:01:38,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640182032] [2019-11-27 23:01:38,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:01:38,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:01:38,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:01:38,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:01:38,140 INFO L87 Difference]: Start difference. First operand 421 states and 586 transitions. Second operand 3 states. [2019-11-27 23:01:38,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:01:38,734 INFO L93 Difference]: Finished difference Result 840 states and 1170 transitions. [2019-11-27 23:01:38,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:01:38,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-27 23:01:38,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:01:38,740 INFO L225 Difference]: With dead ends: 840 [2019-11-27 23:01:38,740 INFO L226 Difference]: Without dead ends: 838 [2019-11-27 23:01:38,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:01:38,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-27 23:01:38,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 560. [2019-11-27 23:01:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-11-27 23:01:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 800 transitions. [2019-11-27 23:01:38,790 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 800 transitions. Word has length 88 [2019-11-27 23:01:38,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:01:38,791 INFO L462 AbstractCegarLoop]: Abstraction has 560 states and 800 transitions. [2019-11-27 23:01:38,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:01:38,791 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 800 transitions. [2019-11-27 23:01:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-27 23:01:38,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:01:38,797 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 23:01:39,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:01:39,004 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:01:39,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:01:39,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1943772973, now seen corresponding path program 1 times [2019-11-27 23:01:39,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:01:39,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262604339] [2019-11-27 23:01:39,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:01:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:01:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:01:39,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262604339] [2019-11-27 23:01:39,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:01:39,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:01:39,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971327238] [2019-11-27 23:01:39,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:01:39,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:01:39,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:01:39,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:01:39,112 INFO L87 Difference]: Start difference. First operand 560 states and 800 transitions. Second operand 4 states. [2019-11-27 23:01:40,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:01:40,108 INFO L93 Difference]: Finished difference Result 1674 states and 2334 transitions. [2019-11-27 23:01:40,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:01:40,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-27 23:01:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:01:40,115 INFO L225 Difference]: With dead ends: 1674 [2019-11-27 23:01:40,116 INFO L226 Difference]: Without dead ends: 1116 [2019-11-27 23:01:40,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:01:40,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-11-27 23:01:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 838. [2019-11-27 23:01:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-27 23:01:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1083 transitions. [2019-11-27 23:01:40,148 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1083 transitions. Word has length 91 [2019-11-27 23:01:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:01:40,149 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1083 transitions. [2019-11-27 23:01:40,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:01:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1083 transitions. [2019-11-27 23:01:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-27 23:01:40,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:01:40,156 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:01:40,156 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:01:40,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:01:40,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1933258404, now seen corresponding path program 1 times [2019-11-27 23:01:40,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:01:40,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485490475] [2019-11-27 23:01:40,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:01:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:01:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:01:40,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485490475] [2019-11-27 23:01:40,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:01:40,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:01:40,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583546888] [2019-11-27 23:01:40,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:01:40,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:01:40,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:01:40,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:01:40,364 INFO L87 Difference]: Start difference. First operand 838 states and 1083 transitions. Second operand 4 states. [2019-11-27 23:01:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:01:41,353 INFO L93 Difference]: Finished difference Result 1813 states and 2348 transitions. [2019-11-27 23:01:41,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:01:41,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-27 23:01:41,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:01:41,363 INFO L225 Difference]: With dead ends: 1813 [2019-11-27 23:01:41,363 INFO L226 Difference]: Without dead ends: 977 [2019-11-27 23:01:41,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:01:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-11-27 23:01:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2019-11-27 23:01:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-27 23:01:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1177 transitions. [2019-11-27 23:01:41,387 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1177 transitions. Word has length 182 [2019-11-27 23:01:41,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:01:41,387 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1177 transitions. [2019-11-27 23:01:41,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:01:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1177 transitions. [2019-11-27 23:01:41,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-27 23:01:41,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:01:41,390 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:01:41,391 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:01:41,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:01:41,391 INFO L82 PathProgramCache]: Analyzing trace with hash -51833937, now seen corresponding path program 1 times [2019-11-27 23:01:41,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:01:41,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039613296] [2019-11-27 23:01:41,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:01:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:01:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-27 23:01:41,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039613296] [2019-11-27 23:01:41,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:01:41,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:01:41,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142423170] [2019-11-27 23:01:41,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:01:41,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:01:41,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:01:41,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:01:41,587 INFO L87 Difference]: Start difference. First operand 977 states and 1177 transitions. Second operand 5 states. [2019-11-27 23:01:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:01:43,334 INFO L93 Difference]: Finished difference Result 3620 states and 4392 transitions. [2019-11-27 23:01:43,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:01:43,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-11-27 23:01:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:01:43,352 INFO L225 Difference]: With dead ends: 3620 [2019-11-27 23:01:43,353 INFO L226 Difference]: Without dead ends: 2645 [2019-11-27 23:01:43,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:01:43,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2019-11-27 23:01:43,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 1672. [2019-11-27 23:01:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-27 23:01:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1977 transitions. [2019-11-27 23:01:43,452 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1977 transitions. Word has length 189 [2019-11-27 23:01:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:01:43,453 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 1977 transitions. [2019-11-27 23:01:43,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:01:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1977 transitions. [2019-11-27 23:01:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-27 23:01:43,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:01:43,458 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:01:43,459 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:01:43,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:01:43,459 INFO L82 PathProgramCache]: Analyzing trace with hash 298360043, now seen corresponding path program 1 times [2019-11-27 23:01:43,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:01:43,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583129000] [2019-11-27 23:01:43,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:01:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:01:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:01:43,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583129000] [2019-11-27 23:01:43,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:01:43,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:01:43,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240089676] [2019-11-27 23:01:43,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:01:43,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:01:43,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:01:43,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:01:43,722 INFO L87 Difference]: Start difference. First operand 1672 states and 1977 transitions. Second operand 5 states. [2019-11-27 23:01:45,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:01:45,345 INFO L93 Difference]: Finished difference Result 4593 states and 5384 transitions. [2019-11-27 23:01:45,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:01:45,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 229 [2019-11-27 23:01:45,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:01:45,360 INFO L225 Difference]: With dead ends: 4593 [2019-11-27 23:01:45,361 INFO L226 Difference]: Without dead ends: 1811 [2019-11-27 23:01:45,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:01:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2019-11-27 23:01:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1533. [2019-11-27 23:01:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1533 states. [2019-11-27 23:01:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1717 transitions. [2019-11-27 23:01:45,431 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1717 transitions. Word has length 229 [2019-11-27 23:01:45,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:01:45,432 INFO L462 AbstractCegarLoop]: Abstraction has 1533 states and 1717 transitions. [2019-11-27 23:01:45,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:01:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1717 transitions. [2019-11-27 23:01:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-11-27 23:01:45,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:01:45,449 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 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] [2019-11-27 23:01:45,449 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:01:45,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:01:45,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1307309551, now seen corresponding path program 1 times [2019-11-27 23:01:45,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:01:45,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758737018] [2019-11-27 23:01:45,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:01:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:01:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 142 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:01:46,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758737018] [2019-11-27 23:01:46,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702063071] [2019-11-27 23:01:46,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:01:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:01:46,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:01:46,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:01:46,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:46,556 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-11-27 23:01:46,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:01:46,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-27 23:01:46,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024041680] [2019-11-27 23:01:46,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:01:46,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:01:46,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:01:46,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:01:46,560 INFO L87 Difference]: Start difference. First operand 1533 states and 1717 transitions. Second operand 3 states. [2019-11-27 23:01:47,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:01:47,129 INFO L93 Difference]: Finished difference Result 3481 states and 3910 transitions. [2019-11-27 23:01:47,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:01:47,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-11-27 23:01:47,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:01:47,140 INFO L225 Difference]: With dead ends: 3481 [2019-11-27 23:01:47,140 INFO L226 Difference]: Without dead ends: 1950 [2019-11-27 23:01:47,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:01:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-11-27 23:01:47,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1672. [2019-11-27 23:01:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-27 23:01:47,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1865 transitions. [2019-11-27 23:01:47,183 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1865 transitions. Word has length 265 [2019-11-27 23:01:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:01:47,184 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 1865 transitions. [2019-11-27 23:01:47,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:01:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1865 transitions. [2019-11-27 23:01:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-27 23:01:47,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:01:47,191 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-27 23:01:47,394 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:01:47,395 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:01:47,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:01:47,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1440717452, now seen corresponding path program 1 times [2019-11-27 23:01:47,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:01:47,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094598901] [2019-11-27 23:01:47,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:01:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:01:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 256 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:01:47,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094598901] [2019-11-27 23:01:47,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250396859] [2019-11-27 23:01:47,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:01:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:01:47,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:01:47,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:01:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:01:47,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:01:47,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-27 23:01:47,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233306801] [2019-11-27 23:01:47,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:01:47,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:01:47,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:01:47,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:01:47,951 INFO L87 Difference]: Start difference. First operand 1672 states and 1865 transitions. Second operand 4 states. [2019-11-27 23:01:48,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:01:48,932 INFO L93 Difference]: Finished difference Result 4037 states and 4530 transitions. [2019-11-27 23:01:48,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:01:48,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2019-11-27 23:01:48,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:01:48,943 INFO L225 Difference]: With dead ends: 4037 [2019-11-27 23:01:48,943 INFO L226 Difference]: Without dead ends: 2367 [2019-11-27 23:01:48,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:01:48,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-11-27 23:01:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2228. [2019-11-27 23:01:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2019-11-27 23:01:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2423 transitions. [2019-11-27 23:01:48,991 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2423 transitions. Word has length 270 [2019-11-27 23:01:48,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:01:48,992 INFO L462 AbstractCegarLoop]: Abstraction has 2228 states and 2423 transitions. [2019-11-27 23:01:48,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:01:48,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2423 transitions. [2019-11-27 23:01:48,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-11-27 23:01:48,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:01:48,998 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-27 23:01:49,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:01:49,202 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:01:49,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:01:49,203 INFO L82 PathProgramCache]: Analyzing trace with hash -876938456, now seen corresponding path program 1 times [2019-11-27 23:01:49,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:01:49,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533490270] [2019-11-27 23:01:49,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:01:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:01:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 230 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:01:49,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533490270] [2019-11-27 23:01:49,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563168520] [2019-11-27 23:01:49,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:01:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:01:49,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 23:01:49,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:01:49,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:49,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:01:50,480 WARN L192 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 21 [2019-11-27 23:01:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2019-11-27 23:01:50,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:01:50,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-27 23:01:50,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381085207] [2019-11-27 23:01:50,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:01:50,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:01:50,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:01:50,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:01:50,631 INFO L87 Difference]: Start difference. First operand 2228 states and 2423 transitions. Second operand 3 states. [2019-11-27 23:01:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:01:55,769 INFO L93 Difference]: Finished difference Result 5149 states and 5617 transitions. [2019-11-27 23:01:55,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:01:55,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-11-27 23:01:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:01:55,781 INFO L225 Difference]: With dead ends: 5149 [2019-11-27 23:01:55,781 INFO L226 Difference]: Without dead ends: 2923 [2019-11-27 23:01:55,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:01:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2019-11-27 23:01:55,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2506. [2019-11-27 23:01:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2019-11-27 23:01:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2717 transitions. [2019-11-27 23:01:55,844 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2717 transitions. Word has length 283 [2019-11-27 23:01:55,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:01:55,845 INFO L462 AbstractCegarLoop]: Abstraction has 2506 states and 2717 transitions. [2019-11-27 23:01:55,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:01:55,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2717 transitions. [2019-11-27 23:01:55,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-11-27 23:01:55,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:01:55,852 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-27 23:01:56,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:01:56,057 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:01:56,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:01:56,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1778174755, now seen corresponding path program 1 times [2019-11-27 23:01:56,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:01:56,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038306950] [2019-11-27 23:01:56,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:01:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:01:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-27 23:01:56,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038306950] [2019-11-27 23:01:56,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:01:56,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:01:56,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132803299] [2019-11-27 23:01:56,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:01:56,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:01:56,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:01:56,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:01:56,246 INFO L87 Difference]: Start difference. First operand 2506 states and 2717 transitions. Second operand 4 states. [2019-11-27 23:01:56,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:01:56,874 INFO L93 Difference]: Finished difference Result 2506 states and 2717 transitions. [2019-11-27 23:01:56,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:01:56,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 319 [2019-11-27 23:01:56,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:01:56,876 INFO L225 Difference]: With dead ends: 2506 [2019-11-27 23:01:56,876 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 23:01:56,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:01:56,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 23:01:56,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 23:01:56,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 23:01:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 23:01:56,880 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 319 [2019-11-27 23:01:56,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:01:56,881 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 23:01:56,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:01:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 23:01:56,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 23:01:56,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 23:01:56,997 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 121 [2019-11-27 23:01:57,624 WARN L192 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 66 [2019-11-27 23:01:58,179 WARN L192 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 66 [2019-11-27 23:01:58,183 INFO L246 CegarLoopResult]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-11-27 23:01:58,184 INFO L246 CegarLoopResult]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,184 INFO L246 CegarLoopResult]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,184 INFO L246 CegarLoopResult]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,184 INFO L246 CegarLoopResult]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,184 INFO L246 CegarLoopResult]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,184 INFO L246 CegarLoopResult]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,184 INFO L246 CegarLoopResult]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-11-27 23:01:58,184 INFO L246 CegarLoopResult]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-11-27 23:01:58,184 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-27 23:01:58,185 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-27 23:01:58,185 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-27 23:01:58,185 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-27 23:01:58,185 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-27 23:01:58,185 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-27 23:01:58,186 INFO L246 CegarLoopResult]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-11-27 23:01:58,186 INFO L246 CegarLoopResult]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-11-27 23:01:58,186 INFO L246 CegarLoopResult]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-11-27 23:01:58,186 INFO L246 CegarLoopResult]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,186 INFO L246 CegarLoopResult]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,186 INFO L246 CegarLoopResult]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,186 INFO L246 CegarLoopResult]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,187 INFO L246 CegarLoopResult]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,187 INFO L246 CegarLoopResult]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-11-27 23:01:58,187 INFO L246 CegarLoopResult]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-11-27 23:01:58,187 INFO L246 CegarLoopResult]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-11-27 23:01:58,187 INFO L246 CegarLoopResult]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-11-27 23:01:58,187 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-27 23:01:58,187 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-27 23:01:58,187 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-27 23:01:58,187 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-27 23:01:58,187 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-27 23:01:58,187 INFO L246 CegarLoopResult]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-11-27 23:01:58,188 INFO L246 CegarLoopResult]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-11-27 23:01:58,188 INFO L246 CegarLoopResult]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-11-27 23:01:58,188 INFO L246 CegarLoopResult]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-11-27 23:01:58,188 INFO L246 CegarLoopResult]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-11-27 23:01:58,188 INFO L246 CegarLoopResult]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,188 INFO L246 CegarLoopResult]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,188 INFO L246 CegarLoopResult]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,188 INFO L246 CegarLoopResult]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,188 INFO L246 CegarLoopResult]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,189 INFO L246 CegarLoopResult]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-11-27 23:01:58,189 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-27 23:01:58,189 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-27 23:01:58,189 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-27 23:01:58,189 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-27 23:01:58,189 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-27 23:01:58,190 INFO L242 CegarLoopResult]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse5 (= ~a10~0 2))) (let ((.cse2 (not (= ~a19~0 10))) (.cse4 (<= 1 ~a10~0)) (.cse0 (not (= ~a10~0 3))) (.cse1 (not .cse5)) (.cse6 (= ~a19~0 9)) (.cse7 (= ~a10~0 0)) (.cse8 (exists ((v_~a1~0_342 Int)) (let ((.cse9 (div (* v_~a1~0_342 9) 10))) (and (<= 0 .cse9) (= 0 (mod (+ .cse9 1) 25)) (<= ~a1~0 (+ (mod .cse9 25) 12)) (<= 0 (* 9 v_~a1~0_342)))))) (.cse3 (<= ~a19~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 (not (= ~a19~0 8))) (and (< 218 ~a1~0) .cse5 .cse3) (and .cse5 .cse6) (and (<= ~a1~0 218) .cse1 .cse2 .cse3 (< 0 (+ ~a1~0 13))) (and .cse2 .cse7) (= ~a19~0 7) (and .cse0 .cse1 .cse4) (and .cse8 (or (and .cse0 .cse1 (<= (+ ~a1~0 437977) 0) (not .cse6)) .cse7)) (and .cse8 .cse5 .cse3)))) [2019-11-27 23:01:58,190 INFO L246 CegarLoopResult]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-11-27 23:01:58,190 INFO L246 CegarLoopResult]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-11-27 23:01:58,190 INFO L246 CegarLoopResult]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-11-27 23:01:58,190 INFO L246 CegarLoopResult]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-11-27 23:01:58,190 INFO L246 CegarLoopResult]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,190 INFO L246 CegarLoopResult]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,190 INFO L246 CegarLoopResult]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,190 INFO L246 CegarLoopResult]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,190 INFO L246 CegarLoopResult]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,191 INFO L246 CegarLoopResult]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-11-27 23:01:58,191 INFO L246 CegarLoopResult]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-11-27 23:01:58,191 INFO L246 CegarLoopResult]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-11-27 23:01:58,191 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-27 23:01:58,191 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-27 23:01:58,191 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-27 23:01:58,191 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-27 23:01:58,191 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-27 23:01:58,191 INFO L246 CegarLoopResult]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-11-27 23:01:58,191 INFO L246 CegarLoopResult]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-11-27 23:01:58,192 INFO L249 CegarLoopResult]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-11-27 23:01:58,192 INFO L246 CegarLoopResult]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-11-27 23:01:58,192 INFO L246 CegarLoopResult]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-11-27 23:01:58,192 INFO L246 CegarLoopResult]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-11-27 23:01:58,192 INFO L246 CegarLoopResult]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,192 INFO L246 CegarLoopResult]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,192 INFO L246 CegarLoopResult]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,192 INFO L246 CegarLoopResult]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,192 INFO L246 CegarLoopResult]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,192 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-27 23:01:58,193 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-27 23:01:58,193 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-27 23:01:58,193 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-27 23:01:58,193 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-27 23:01:58,193 INFO L246 CegarLoopResult]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-11-27 23:01:58,193 INFO L246 CegarLoopResult]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-11-27 23:01:58,193 INFO L246 CegarLoopResult]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-11-27 23:01:58,193 INFO L246 CegarLoopResult]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-11-27 23:01:58,193 INFO L246 CegarLoopResult]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,193 INFO L246 CegarLoopResult]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,193 INFO L246 CegarLoopResult]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,194 INFO L246 CegarLoopResult]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,194 INFO L246 CegarLoopResult]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,194 INFO L246 CegarLoopResult]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-11-27 23:01:58,194 INFO L246 CegarLoopResult]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-11-27 23:01:58,194 INFO L246 CegarLoopResult]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-11-27 23:01:58,194 INFO L246 CegarLoopResult]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-11-27 23:01:58,194 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-27 23:01:58,194 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-27 23:01:58,194 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-27 23:01:58,194 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-27 23:01:58,194 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-27 23:01:58,195 INFO L246 CegarLoopResult]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-11-27 23:01:58,195 INFO L246 CegarLoopResult]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-11-27 23:01:58,195 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 23:01:58,195 INFO L246 CegarLoopResult]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-11-27 23:01:58,195 INFO L242 CegarLoopResult]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse5 (= ~a10~0 2))) (let ((.cse2 (not (= ~a19~0 10))) (.cse4 (<= 1 ~a10~0)) (.cse0 (not (= ~a10~0 3))) (.cse1 (not .cse5)) (.cse6 (= ~a19~0 9)) (.cse7 (= ~a10~0 0)) (.cse8 (exists ((v_~a1~0_342 Int)) (let ((.cse9 (div (* v_~a1~0_342 9) 10))) (and (<= 0 .cse9) (= 0 (mod (+ .cse9 1) 25)) (<= ~a1~0 (+ (mod .cse9 25) 12)) (<= 0 (* 9 v_~a1~0_342)))))) (.cse3 (<= ~a19~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 (not (= ~a19~0 8))) (and (< 218 ~a1~0) .cse5 .cse3) (and .cse5 .cse6) (and (<= ~a1~0 218) .cse1 .cse2 .cse3 (< 0 (+ ~a1~0 13))) (and .cse2 .cse7) (= ~a19~0 7) (and .cse0 .cse1 .cse4) (and .cse8 (or (and .cse0 .cse1 (<= (+ ~a1~0 437977) 0) (not .cse6)) .cse7)) (and .cse8 .cse5 .cse3)))) [2019-11-27 23:01:58,195 INFO L246 CegarLoopResult]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-11-27 23:01:58,195 INFO L246 CegarLoopResult]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,195 INFO L246 CegarLoopResult]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,195 INFO L246 CegarLoopResult]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,195 INFO L246 CegarLoopResult]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,196 INFO L246 CegarLoopResult]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-27 23:01:58,196 INFO L246 CegarLoopResult]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,196 INFO L246 CegarLoopResult]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,196 INFO L246 CegarLoopResult]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-11-27 23:01:58,196 INFO L246 CegarLoopResult]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-11-27 23:01:58,196 INFO L246 CegarLoopResult]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-11-27 23:01:58,196 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-27 23:01:58,196 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-27 23:01:58,196 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-27 23:01:58,196 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-27 23:01:58,196 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-27 23:01:58,196 INFO L246 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-27 23:01:58,197 INFO L246 CegarLoopResult]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-11-27 23:01:58,197 INFO L246 CegarLoopResult]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-11-27 23:01:58,197 INFO L246 CegarLoopResult]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-11-27 23:01:58,197 INFO L246 CegarLoopResult]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-11-27 23:01:58,197 INFO L246 CegarLoopResult]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,197 INFO L246 CegarLoopResult]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,197 INFO L246 CegarLoopResult]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,197 INFO L246 CegarLoopResult]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,197 INFO L246 CegarLoopResult]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,197 INFO L246 CegarLoopResult]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,197 INFO L246 CegarLoopResult]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-11-27 23:01:58,198 INFO L246 CegarLoopResult]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-11-27 23:01:58,198 INFO L246 CegarLoopResult]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-11-27 23:01:58,198 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 23:01:58,198 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-27 23:01:58,198 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-27 23:01:58,198 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-27 23:01:58,198 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-27 23:01:58,198 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-27 23:01:58,198 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-27 23:01:58,198 INFO L246 CegarLoopResult]: For program point L587(line 587) no Hoare annotation was computed. [2019-11-27 23:01:58,199 INFO L246 CegarLoopResult]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-11-27 23:01:58,199 INFO L246 CegarLoopResult]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-11-27 23:01:58,199 INFO L246 CegarLoopResult]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-11-27 23:01:58,199 INFO L246 CegarLoopResult]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-11-27 23:01:58,199 INFO L246 CegarLoopResult]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-11-27 23:01:58,199 INFO L246 CegarLoopResult]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,199 INFO L246 CegarLoopResult]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,199 INFO L246 CegarLoopResult]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,199 INFO L246 CegarLoopResult]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,199 INFO L246 CegarLoopResult]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,200 INFO L246 CegarLoopResult]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,200 INFO L246 CegarLoopResult]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-11-27 23:01:58,200 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-27 23:01:58,200 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-27 23:01:58,200 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-27 23:01:58,200 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-27 23:01:58,200 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-27 23:01:58,200 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 23:01:58,200 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-27 23:01:58,200 INFO L246 CegarLoopResult]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-11-27 23:01:58,201 INFO L246 CegarLoopResult]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-11-27 23:01:58,201 INFO L246 CegarLoopResult]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-11-27 23:01:58,201 INFO L246 CegarLoopResult]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-11-27 23:01:58,201 INFO L246 CegarLoopResult]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-11-27 23:01:58,201 INFO L246 CegarLoopResult]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-11-27 23:01:58,201 INFO L246 CegarLoopResult]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,201 INFO L246 CegarLoopResult]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,201 INFO L246 CegarLoopResult]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,201 INFO L246 CegarLoopResult]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,201 INFO L246 CegarLoopResult]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,202 INFO L246 CegarLoopResult]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,202 INFO L246 CegarLoopResult]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-11-27 23:01:58,202 INFO L246 CegarLoopResult]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-11-27 23:01:58,202 INFO L246 CegarLoopResult]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-11-27 23:01:58,202 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-27 23:01:58,202 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-27 23:01:58,202 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-27 23:01:58,202 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-27 23:01:58,202 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-27 23:01:58,202 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-27 23:01:58,203 INFO L246 CegarLoopResult]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-11-27 23:01:58,203 INFO L246 CegarLoopResult]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-11-27 23:01:58,203 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 23:01:58,203 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2019-11-27 23:01:58,203 INFO L246 CegarLoopResult]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-11-27 23:01:58,203 INFO L246 CegarLoopResult]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,203 INFO L246 CegarLoopResult]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,203 INFO L246 CegarLoopResult]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,203 INFO L246 CegarLoopResult]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,203 INFO L246 CegarLoopResult]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,204 INFO L246 CegarLoopResult]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:58,204 INFO L246 CegarLoopResult]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-11-27 23:01:58,204 INFO L246 CegarLoopResult]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-11-27 23:01:58,204 INFO L246 CegarLoopResult]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-11-27 23:01:58,204 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-27 23:01:58,204 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-27 23:01:58,204 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-27 23:01:58,204 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-27 23:01:58,204 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-27 23:01:58,204 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-27 23:01:58,204 INFO L246 CegarLoopResult]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-11-27 23:01:58,205 INFO L246 CegarLoopResult]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-11-27 23:01:58,205 INFO L246 CegarLoopResult]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-11-27 23:01:58,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:01:58 BoogieIcfgContainer [2019-11-27 23:01:58,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:01:58,245 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:01:58,245 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:01:58,246 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:01:58,246 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:01:35" (3/4) ... [2019-11-27 23:01:58,250 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 23:01:58,272 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 23:01:58,273 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 23:01:58,306 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(a10 == 3) && !(a10 == 2)) && !(a19 == 10)) && a19 <= 8) || (((!(a10 == 2) && !(a19 == 10)) && 1 <= a10) && !(a19 == 8))) || ((218 < a1 && a10 == 2) && a19 <= 8)) || (a10 == 2 && a19 == 9)) || ((((a1 <= 218 && !(a10 == 2)) && !(a19 == 10)) && a19 <= 8) && 0 < a1 + 13)) || (!(a19 == 10) && a10 == 0)) || a19 == 7) || ((!(a10 == 3) && !(a10 == 2)) && 1 <= a10)) || ((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && ((((!(a10 == 3) && !(a10 == 2)) && a1 + 437977 <= 0) && !(a19 == 9)) || a10 == 0))) || (((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && a10 == 2) && a19 <= 8) [2019-11-27 23:01:58,310 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(a10 == 3) && !(a10 == 2)) && !(a19 == 10)) && a19 <= 8) || (((!(a10 == 2) && !(a19 == 10)) && 1 <= a10) && !(a19 == 8))) || ((218 < a1 && a10 == 2) && a19 <= 8)) || (a10 == 2 && a19 == 9)) || ((((a1 <= 218 && !(a10 == 2)) && !(a19 == 10)) && a19 <= 8) && 0 < a1 + 13)) || (!(a19 == 10) && a10 == 0)) || a19 == 7) || ((!(a10 == 3) && !(a10 == 2)) && 1 <= a10)) || ((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && ((((!(a10 == 3) && !(a10 == 2)) && a1 + 437977 <= 0) && !(a19 == 9)) || a10 == 0))) || (((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && a10 == 2) && a19 <= 8) [2019-11-27 23:01:58,456 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:01:58,456 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:01:58,458 INFO L168 Benchmark]: Toolchain (without parser) took 25734.15 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 590.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -121.3 MB). Peak memory consumption was 469.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:01:58,458 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:01:58,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:01:58,459 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:01:58,460 INFO L168 Benchmark]: Boogie Preprocessor took 115.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:01:58,460 INFO L168 Benchmark]: RCFGBuilder took 1630.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.4 MB in the end (delta: 98.3 MB). Peak memory consumption was 98.3 MB. Max. memory is 11.5 GB. [2019-11-27 23:01:58,461 INFO L168 Benchmark]: TraceAbstraction took 22926.86 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 453.5 MB). Free memory was 985.7 MB in the beginning and 1.1 GB in the end (delta: -105.8 MB). Peak memory consumption was 347.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:01:58,461 INFO L168 Benchmark]: Witness Printer took 210.96 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-27 23:01:58,464 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 746.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 97.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 115.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1630.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.4 MB in the end (delta: 98.3 MB). Peak memory consumption was 98.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22926.86 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 453.5 MB). Free memory was 985.7 MB in the beginning and 1.1 GB in the end (delta: -105.8 MB). Peak memory consumption was 347.7 MB. Max. memory is 11.5 GB. * Witness Printer took 210.96 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 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_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 70]: 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: 582]: Loop Invariant [2019-11-27 23:01:58,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] Derived loop invariant: (((((((((((!(a10 == 3) && !(a10 == 2)) && !(a19 == 10)) && a19 <= 8) || (((!(a10 == 2) && !(a19 == 10)) && 1 <= a10) && !(a19 == 8))) || ((218 < a1 && a10 == 2) && a19 <= 8)) || (a10 == 2 && a19 == 9)) || ((((a1 <= 218 && !(a10 == 2)) && !(a19 == 10)) && a19 <= 8) && 0 < a1 + 13)) || (!(a19 == 10) && a10 == 0)) || a19 == 7) || ((!(a10 == 3) && !(a10 == 2)) && 1 <= a10)) || ((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && ((((!(a10 == 3) && !(a10 == 2)) && a1 + 437977 <= 0) && !(a19 == 9)) || a10 == 0))) || (((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && a10 == 2) && a19 <= 8) - InvariantResult [Line: 20]: Loop Invariant [2019-11-27 23:01:58,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-27 23:01:58,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] Derived loop invariant: (((((((((((!(a10 == 3) && !(a10 == 2)) && !(a19 == 10)) && a19 <= 8) || (((!(a10 == 2) && !(a19 == 10)) && 1 <= a10) && !(a19 == 8))) || ((218 < a1 && a10 == 2) && a19 <= 8)) || (a10 == 2 && a19 == 9)) || ((((a1 <= 218 && !(a10 == 2)) && !(a19 == 10)) && a19 <= 8) && 0 < a1 + 13)) || (!(a19 == 10) && a10 == 0)) || a19 == 7) || ((!(a10 == 3) && !(a10 == 2)) && 1 <= a10)) || ((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && ((((!(a10 == 3) && !(a10 == 2)) && a1 + 437977 <= 0) && !(a19 == 9)) || a10 == 0))) || (((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && a10 == 2) && a19 <= 8) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Result: SAFE, OverallTime: 21.4s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, HoareTripleCheckerStatistics: 883 SDtfs, 2350 SDslu, 100 SDs, 0 SdLazy, 6897 SolverSat, 982 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 954 GetRequests, 914 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2506occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 2641 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 64 NumberOfFragments, 391 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2242 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2806 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2844 NumberOfCodeBlocks, 2844 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2830 ConstructedInterpolants, 20 QuantifiedInterpolants, 2541186 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1292 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 1994/2056 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...