./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 f470102c 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.25-f470102 [2019-11-28 16:05:57,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:05:57,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:05:57,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:05:57,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:05:57,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:05:57,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:05:57,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:05:57,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:05:57,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:05:57,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:05:57,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:05:57,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:05:57,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:05:57,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:05:57,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:05:57,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:05:57,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:05:57,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:05:57,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:05:57,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:05:57,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:05:57,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:05:57,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:05:57,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:05:57,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:05:57,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:05:57,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:05:57,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:05:57,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:05:57,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:05:57,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:05:57,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:05:57,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:05:57,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:05:57,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:05:57,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:05:57,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:05:57,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:05:57,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:05:57,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:05:57,335 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 16:05:57,369 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:05:57,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:05:57,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:05:57,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:05:57,376 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:05:57,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:05:57,379 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:05:57,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:05:57,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:05:57,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:05:57,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:05:57,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:05:57,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:05:57,383 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:05:57,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:05:57,383 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:05:57,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:05:57,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:05:57,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:05:57,385 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:05:57,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:05:57,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:05:57,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:05:57,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:05:57,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:05:57,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:05:57,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:05:57,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:05:57,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:05:57,389 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-28 16:05:57,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:05:57,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:05:57,778 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:05:57,780 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:05:57,782 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:05:57,783 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-28 16:05:57,853 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1972d2b50/f381607d11134ac3a1e1b0180201b6c9/FLAG08aaf6bb8 [2019-11-28 16:05:58,427 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:05:58,428 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label49.c [2019-11-28 16:05:58,451 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1972d2b50/f381607d11134ac3a1e1b0180201b6c9/FLAG08aaf6bb8 [2019-11-28 16:05:58,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1972d2b50/f381607d11134ac3a1e1b0180201b6c9 [2019-11-28 16:05:58,698 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:05:58,700 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:05:58,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:05:58,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:05:58,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:05:58,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:05:58" (1/1) ... [2019-11-28 16:05:58,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21aba202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:05:58, skipping insertion in model container [2019-11-28 16:05:58,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:05:58" (1/1) ... [2019-11-28 16:05:58,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:05:58,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:05:59,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:05:59,339 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:05:59,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:05:59,455 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:05:59,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:05:59 WrapperNode [2019-11-28 16:05:59,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:05:59,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:05:59,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:05:59,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:05:59,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:05:59" (1/1) ... [2019-11-28 16:05:59,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:05:59" (1/1) ... [2019-11-28 16:05:59,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:05:59,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:05:59,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:05:59,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:05:59,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:05:59" (1/1) ... [2019-11-28 16:05:59,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:05:59" (1/1) ... [2019-11-28 16:05:59,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:05:59" (1/1) ... [2019-11-28 16:05:59,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:05:59" (1/1) ... [2019-11-28 16:05:59,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:05:59" (1/1) ... [2019-11-28 16:05:59,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:05:59" (1/1) ... [2019-11-28 16:05:59,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:05:59" (1/1) ... [2019-11-28 16:05:59,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:05:59,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:05:59,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:05:59,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:05:59,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:05:59" (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-28 16:05:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:05:59,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:06:01,252 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:06:01,252 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 16:06:01,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:06:01 BoogieIcfgContainer [2019-11-28 16:06:01,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:06:01,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:06:01,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:06:01,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:06:01,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:05:58" (1/3) ... [2019-11-28 16:06:01,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1742c273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:06:01, skipping insertion in model container [2019-11-28 16:06:01,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:05:59" (2/3) ... [2019-11-28 16:06:01,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1742c273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:06:01, skipping insertion in model container [2019-11-28 16:06:01,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:06:01" (3/3) ... [2019-11-28 16:06:01,265 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label49.c [2019-11-28 16:06:01,276 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:06:01,285 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:06:01,299 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:06:01,340 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:06:01,341 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:06:01,341 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:06:01,341 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:06:01,341 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:06:01,343 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:06:01,344 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:06:01,344 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:06:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-11-28 16:06:01,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 16:06:01,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:06:01,374 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-28 16:06:01,374 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:06:01,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:06:01,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1644072970, now seen corresponding path program 1 times [2019-11-28 16:06:01,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:06:01,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439349182] [2019-11-28 16:06:01,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:06:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:06:01,600 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-28 16:06:01,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439349182] [2019-11-28 16:06:01,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:06:01,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:06:01,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816982003] [2019-11-28 16:06:01,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:06:01,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:06:01,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:06:01,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:06:01,626 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-11-28 16:06:03,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:06:03,247 INFO L93 Difference]: Finished difference Result 694 states and 1246 transitions. [2019-11-28 16:06:03,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:06:03,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-28 16:06:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:06:03,281 INFO L225 Difference]: With dead ends: 694 [2019-11-28 16:06:03,281 INFO L226 Difference]: Without dead ends: 421 [2019-11-28 16:06:03,294 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-28 16:06:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-28 16:06:03,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-11-28 16:06:03,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-28 16:06:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 586 transitions. [2019-11-28 16:06:03,415 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 586 transitions. Word has length 22 [2019-11-28 16:06:03,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:06:03,415 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 586 transitions. [2019-11-28 16:06:03,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:06:03,416 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 586 transitions. [2019-11-28 16:06:03,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-28 16:06:03,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:06:03,423 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-28 16:06:03,423 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:06:03,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:06:03,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1869682614, now seen corresponding path program 1 times [2019-11-28 16:06:03,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:06:03,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496300673] [2019-11-28 16:06:03,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:06:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:06:03,792 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-28 16:06:03,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496300673] [2019-11-28 16:06:03,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41950348] [2019-11-28 16:06:03,793 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-28 16:06:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:06:03,851 INFO L264 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 16:06:03,859 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:06:03,906 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-28 16:06:03,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 16:06:03,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2019-11-28 16:06:03,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216125384] [2019-11-28 16:06:03,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:06:03,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:06:03,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:06:03,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-28 16:06:03,910 INFO L87 Difference]: Start difference. First operand 421 states and 586 transitions. Second operand 3 states. [2019-11-28 16:06:04,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:06:04,526 INFO L93 Difference]: Finished difference Result 840 states and 1170 transitions. [2019-11-28 16:06:04,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:06:04,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-28 16:06:04,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:06:04,532 INFO L225 Difference]: With dead ends: 840 [2019-11-28 16:06:04,532 INFO L226 Difference]: Without dead ends: 838 [2019-11-28 16:06:04,534 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-28 16:06:04,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-28 16:06:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 560. [2019-11-28 16:06:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-11-28 16:06:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 800 transitions. [2019-11-28 16:06:04,558 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 800 transitions. Word has length 88 [2019-11-28 16:06:04,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:06:04,559 INFO L462 AbstractCegarLoop]: Abstraction has 560 states and 800 transitions. [2019-11-28 16:06:04,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:06:04,560 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 800 transitions. [2019-11-28 16:06:04,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-28 16:06:04,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:06:04,563 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-28 16:06:04,766 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:06:04,767 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:06:04,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:06:04,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1943772973, now seen corresponding path program 1 times [2019-11-28 16:06:04,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:06:04,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984830800] [2019-11-28 16:06:04,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:06:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:06:04,889 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-28 16:06:04,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984830800] [2019-11-28 16:06:04,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:06:04,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:06:04,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793731650] [2019-11-28 16:06:04,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:06:04,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:06:04,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:06:04,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:06:04,898 INFO L87 Difference]: Start difference. First operand 560 states and 800 transitions. Second operand 4 states. [2019-11-28 16:06:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:06:06,035 INFO L93 Difference]: Finished difference Result 1674 states and 2334 transitions. [2019-11-28 16:06:06,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:06:06,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-28 16:06:06,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:06:06,042 INFO L225 Difference]: With dead ends: 1674 [2019-11-28 16:06:06,043 INFO L226 Difference]: Without dead ends: 1116 [2019-11-28 16:06:06,045 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-28 16:06:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-11-28 16:06:06,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 838. [2019-11-28 16:06:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-28 16:06:06,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1083 transitions. [2019-11-28 16:06:06,102 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1083 transitions. Word has length 91 [2019-11-28 16:06:06,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:06:06,103 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1083 transitions. [2019-11-28 16:06:06,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:06:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1083 transitions. [2019-11-28 16:06:06,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-28 16:06:06,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:06:06,117 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-28 16:06:06,117 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:06:06,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:06:06,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1933258404, now seen corresponding path program 1 times [2019-11-28 16:06:06,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:06:06,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748852336] [2019-11-28 16:06:06,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:06:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:06:06,357 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-28 16:06:06,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748852336] [2019-11-28 16:06:06,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:06:06,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:06:06,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029423011] [2019-11-28 16:06:06,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:06:06,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:06:06,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:06:06,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:06:06,362 INFO L87 Difference]: Start difference. First operand 838 states and 1083 transitions. Second operand 4 states. [2019-11-28 16:06:07,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:06:07,303 INFO L93 Difference]: Finished difference Result 1813 states and 2348 transitions. [2019-11-28 16:06:07,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:06:07,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-28 16:06:07,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:06:07,309 INFO L225 Difference]: With dead ends: 1813 [2019-11-28 16:06:07,310 INFO L226 Difference]: Without dead ends: 977 [2019-11-28 16:06:07,312 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-28 16:06:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-11-28 16:06:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2019-11-28 16:06:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-28 16:06:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1177 transitions. [2019-11-28 16:06:07,333 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1177 transitions. Word has length 182 [2019-11-28 16:06:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:06:07,334 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1177 transitions. [2019-11-28 16:06:07,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:06:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1177 transitions. [2019-11-28 16:06:07,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-28 16:06:07,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:06:07,337 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-28 16:06:07,338 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:06:07,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:06:07,338 INFO L82 PathProgramCache]: Analyzing trace with hash -51833937, now seen corresponding path program 1 times [2019-11-28 16:06:07,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:06:07,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012510306] [2019-11-28 16:06:07,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:06:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:06:07,607 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-28 16:06:07,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012510306] [2019-11-28 16:06:07,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:06:07,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:06:07,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813114162] [2019-11-28 16:06:07,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:06:07,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:06:07,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:06:07,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:06:07,613 INFO L87 Difference]: Start difference. First operand 977 states and 1177 transitions. Second operand 5 states. [2019-11-28 16:06:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:06:09,253 INFO L93 Difference]: Finished difference Result 3620 states and 4392 transitions. [2019-11-28 16:06:09,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:06:09,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-11-28 16:06:09,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:06:09,266 INFO L225 Difference]: With dead ends: 3620 [2019-11-28 16:06:09,266 INFO L226 Difference]: Without dead ends: 2645 [2019-11-28 16:06:09,268 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-28 16:06:09,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2019-11-28 16:06:09,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 1672. [2019-11-28 16:06:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-28 16:06:09,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1977 transitions. [2019-11-28 16:06:09,306 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1977 transitions. Word has length 189 [2019-11-28 16:06:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:06:09,307 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 1977 transitions. [2019-11-28 16:06:09,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:06:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1977 transitions. [2019-11-28 16:06:09,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-28 16:06:09,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:06:09,311 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-28 16:06:09,311 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:06:09,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:06:09,312 INFO L82 PathProgramCache]: Analyzing trace with hash 298360043, now seen corresponding path program 1 times [2019-11-28 16:06:09,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:06:09,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055248705] [2019-11-28 16:06:09,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:06:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:06:09,480 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-28 16:06:09,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055248705] [2019-11-28 16:06:09,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:06:09,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 16:06:09,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676284462] [2019-11-28 16:06:09,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:06:09,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:06:09,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:06:09,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:06:09,484 INFO L87 Difference]: Start difference. First operand 1672 states and 1977 transitions. Second operand 5 states. [2019-11-28 16:06:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:06:11,070 INFO L93 Difference]: Finished difference Result 4593 states and 5384 transitions. [2019-11-28 16:06:11,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:06:11,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 229 [2019-11-28 16:06:11,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:06:11,082 INFO L225 Difference]: With dead ends: 4593 [2019-11-28 16:06:11,091 INFO L226 Difference]: Without dead ends: 1811 [2019-11-28 16:06:11,096 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-28 16:06:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2019-11-28 16:06:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1533. [2019-11-28 16:06:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1533 states. [2019-11-28 16:06:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1717 transitions. [2019-11-28 16:06:11,156 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1717 transitions. Word has length 229 [2019-11-28 16:06:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:06:11,157 INFO L462 AbstractCegarLoop]: Abstraction has 1533 states and 1717 transitions. [2019-11-28 16:06:11,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:06:11,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1717 transitions. [2019-11-28 16:06:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-11-28 16:06:11,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:06:11,166 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-28 16:06:11,166 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:06:11,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:06:11,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1307309551, now seen corresponding path program 1 times [2019-11-28 16:06:11,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:06:11,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700234659] [2019-11-28 16:06:11,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:06:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:06:11,971 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-28 16:06:11,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700234659] [2019-11-28 16:06:11,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372274676] [2019-11-28 16:06:11,973 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-28 16:06:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:06:12,084 INFO L264 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 16:06:12,104 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:06:12,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:12,190 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-28 16:06:12,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 16:06:12,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-28 16:06:12,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466802904] [2019-11-28 16:06:12,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:06:12,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:06:12,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:06:12,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 16:06:12,193 INFO L87 Difference]: Start difference. First operand 1533 states and 1717 transitions. Second operand 3 states. [2019-11-28 16:06:12,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:06:12,925 INFO L93 Difference]: Finished difference Result 3481 states and 3910 transitions. [2019-11-28 16:06:12,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:06:12,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-11-28 16:06:12,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:06:12,938 INFO L225 Difference]: With dead ends: 3481 [2019-11-28 16:06:12,938 INFO L226 Difference]: Without dead ends: 1950 [2019-11-28 16:06:12,942 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-28 16:06:12,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-11-28 16:06:13,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1672. [2019-11-28 16:06:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-28 16:06:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1865 transitions. [2019-11-28 16:06:13,008 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1865 transitions. Word has length 265 [2019-11-28 16:06:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:06:13,009 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 1865 transitions. [2019-11-28 16:06:13,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:06:13,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1865 transitions. [2019-11-28 16:06:13,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-28 16:06:13,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:06:13,019 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-28 16:06:13,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:06:13,225 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:06:13,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:06:13,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1440717452, now seen corresponding path program 1 times [2019-11-28 16:06:13,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:06:13,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110940269] [2019-11-28 16:06:13,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:06:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:06:13,667 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-28 16:06:13,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110940269] [2019-11-28 16:06:13,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94736932] [2019-11-28 16:06:13,668 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-28 16:06:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:06:13,762 INFO L264 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 16:06:13,771 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:06:13,943 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-28 16:06:13,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 16:06:13,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-28 16:06:13,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560340029] [2019-11-28 16:06:13,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:06:13,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:06:13,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:06:13,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 16:06:13,951 INFO L87 Difference]: Start difference. First operand 1672 states and 1865 transitions. Second operand 4 states. [2019-11-28 16:06:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:06:15,036 INFO L93 Difference]: Finished difference Result 4037 states and 4530 transitions. [2019-11-28 16:06:15,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:06:15,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2019-11-28 16:06:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:06:15,048 INFO L225 Difference]: With dead ends: 4037 [2019-11-28 16:06:15,048 INFO L226 Difference]: Without dead ends: 2367 [2019-11-28 16:06:15,052 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-28 16:06:15,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-11-28 16:06:15,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2228. [2019-11-28 16:06:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2019-11-28 16:06:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2423 transitions. [2019-11-28 16:06:15,103 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2423 transitions. Word has length 270 [2019-11-28 16:06:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:06:15,104 INFO L462 AbstractCegarLoop]: Abstraction has 2228 states and 2423 transitions. [2019-11-28 16:06:15,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:06:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2423 transitions. [2019-11-28 16:06:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-11-28 16:06:15,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:06:15,111 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-28 16:06:15,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:06:15,326 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:06:15,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:06:15,327 INFO L82 PathProgramCache]: Analyzing trace with hash -876938456, now seen corresponding path program 1 times [2019-11-28 16:06:15,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:06:15,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005525195] [2019-11-28 16:06:15,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:06:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:06:15,663 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-28 16:06:15,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005525195] [2019-11-28 16:06:15,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744886521] [2019-11-28 16:06:15,664 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-28 16:06:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:06:15,804 INFO L264 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 16:06:15,809 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:06:15,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:15,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:06:16,748 WARN L192 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 21 [2019-11-28 16:06:16,885 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-28 16:06:16,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 16:06:16,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-28 16:06:16,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275394458] [2019-11-28 16:06:16,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:06:16,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:06:16,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:06:16,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-28 16:06:16,887 INFO L87 Difference]: Start difference. First operand 2228 states and 2423 transitions. Second operand 3 states. [2019-11-28 16:06:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:06:20,112 INFO L93 Difference]: Finished difference Result 5010 states and 5469 transitions. [2019-11-28 16:06:20,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:06:20,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-11-28 16:06:20,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:06:20,123 INFO L225 Difference]: With dead ends: 5010 [2019-11-28 16:06:20,123 INFO L226 Difference]: Without dead ends: 2784 [2019-11-28 16:06:20,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-28 16:06:20,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2019-11-28 16:06:20,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2506. [2019-11-28 16:06:20,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2019-11-28 16:06:20,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2717 transitions. [2019-11-28 16:06:20,176 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2717 transitions. Word has length 283 [2019-11-28 16:06:20,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:06:20,177 INFO L462 AbstractCegarLoop]: Abstraction has 2506 states and 2717 transitions. [2019-11-28 16:06:20,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:06:20,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2717 transitions. [2019-11-28 16:06:20,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-11-28 16:06:20,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:06:20,184 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-28 16:06:20,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:06:20,390 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:06:20,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:06:20,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1778174755, now seen corresponding path program 1 times [2019-11-28 16:06:20,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:06:20,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770426597] [2019-11-28 16:06:20,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:06:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:06:20,591 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-28 16:06:20,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770426597] [2019-11-28 16:06:20,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:06:20,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:06:20,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46330481] [2019-11-28 16:06:20,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:06:20,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:06:20,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:06:20,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:06:20,594 INFO L87 Difference]: Start difference. First operand 2506 states and 2717 transitions. Second operand 4 states. [2019-11-28 16:06:21,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:06:21,289 INFO L93 Difference]: Finished difference Result 2506 states and 2717 transitions. [2019-11-28 16:06:21,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:06:21,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 319 [2019-11-28 16:06:21,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:06:21,290 INFO L225 Difference]: With dead ends: 2506 [2019-11-28 16:06:21,290 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 16:06:21,293 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-28 16:06:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 16:06:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 16:06:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 16:06:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 16:06:21,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 319 [2019-11-28 16:06:21,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:06:21,294 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 16:06:21,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:06:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 16:06:21,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 16:06:21,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 16:06:22,093 WARN L192 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 67 [2019-11-28 16:06:22,687 WARN L192 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 67 [2019-11-28 16:06:22,691 INFO L246 CegarLoopResult]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-11-28 16:06:22,691 INFO L246 CegarLoopResult]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,691 INFO L246 CegarLoopResult]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,691 INFO L246 CegarLoopResult]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,692 INFO L246 CegarLoopResult]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,692 INFO L246 CegarLoopResult]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,692 INFO L246 CegarLoopResult]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,692 INFO L246 CegarLoopResult]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-11-28 16:06:22,692 INFO L246 CegarLoopResult]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-11-28 16:06:22,692 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-28 16:06:22,693 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-28 16:06:22,693 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-28 16:06:22,693 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-28 16:06:22,693 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-28 16:06:22,693 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-28 16:06:22,693 INFO L246 CegarLoopResult]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-11-28 16:06:22,694 INFO L246 CegarLoopResult]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-11-28 16:06:22,694 INFO L246 CegarLoopResult]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-11-28 16:06:22,694 INFO L246 CegarLoopResult]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,694 INFO L246 CegarLoopResult]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,694 INFO L246 CegarLoopResult]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,694 INFO L246 CegarLoopResult]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,694 INFO L246 CegarLoopResult]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,695 INFO L246 CegarLoopResult]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-11-28 16:06:22,695 INFO L246 CegarLoopResult]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-11-28 16:06:22,695 INFO L246 CegarLoopResult]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-11-28 16:06:22,695 INFO L246 CegarLoopResult]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-11-28 16:06:22,695 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-28 16:06:22,695 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-28 16:06:22,695 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-28 16:06:22,695 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-28 16:06:22,695 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-28 16:06:22,695 INFO L246 CegarLoopResult]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-11-28 16:06:22,696 INFO L246 CegarLoopResult]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-11-28 16:06:22,696 INFO L246 CegarLoopResult]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-11-28 16:06:22,696 INFO L246 CegarLoopResult]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-11-28 16:06:22,696 INFO L246 CegarLoopResult]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-11-28 16:06:22,696 INFO L246 CegarLoopResult]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,696 INFO L246 CegarLoopResult]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,696 INFO L246 CegarLoopResult]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,696 INFO L246 CegarLoopResult]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,696 INFO L246 CegarLoopResult]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,696 INFO L246 CegarLoopResult]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-11-28 16:06:22,697 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-28 16:06:22,697 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-28 16:06:22,697 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-28 16:06:22,697 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-28 16:06:22,697 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-28 16:06:22,697 INFO L242 CegarLoopResult]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse6 (= ~a10~0 2))) (let ((.cse2 (not (= ~a19~0 10))) (.cse4 (<= 1 ~a10~0)) (.cse0 (not (= ~a10~0 3))) (.cse1 (not .cse6)) (.cse7 (= ~a10~0 0)) (.cse5 (< 218 ~a1~0)) (.cse9 (= ~a19~0 9)) (.cse8 (exists ((v_~a1~0_342 Int)) (let ((.cse10 (div (* v_~a1~0_342 9) 10))) (and (<= 0 .cse10) (= 0 (mod (+ .cse10 1) 25)) (<= ~a1~0 (+ (mod .cse10 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 .cse5 .cse6 .cse3) (and (<= ~a1~0 218) .cse1 .cse2 .cse3 (< 0 (+ ~a1~0 13))) (and .cse2 .cse7) (and .cse8 .cse6 .cse9) (= ~a19~0 7) (and .cse0 .cse1 .cse4) (and .cse8 (or (and .cse0 .cse1 (<= (+ ~a1~0 437977) 0) (not .cse9)) .cse7)) (and .cse5 .cse6 .cse9) (and .cse8 .cse6 .cse3)))) [2019-11-28 16:06:22,698 INFO L246 CegarLoopResult]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-11-28 16:06:22,698 INFO L246 CegarLoopResult]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-11-28 16:06:22,698 INFO L246 CegarLoopResult]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-11-28 16:06:22,698 INFO L246 CegarLoopResult]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-11-28 16:06:22,698 INFO L246 CegarLoopResult]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,698 INFO L246 CegarLoopResult]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,698 INFO L246 CegarLoopResult]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,698 INFO L246 CegarLoopResult]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,698 INFO L246 CegarLoopResult]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,698 INFO L246 CegarLoopResult]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-11-28 16:06:22,699 INFO L246 CegarLoopResult]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-11-28 16:06:22,699 INFO L246 CegarLoopResult]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-11-28 16:06:22,699 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-28 16:06:22,699 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-28 16:06:22,699 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-28 16:06:22,699 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-28 16:06:22,699 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-28 16:06:22,699 INFO L246 CegarLoopResult]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-11-28 16:06:22,699 INFO L246 CegarLoopResult]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-11-28 16:06:22,700 INFO L249 CegarLoopResult]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-11-28 16:06:22,700 INFO L246 CegarLoopResult]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-11-28 16:06:22,700 INFO L246 CegarLoopResult]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-11-28 16:06:22,700 INFO L246 CegarLoopResult]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-11-28 16:06:22,700 INFO L246 CegarLoopResult]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,700 INFO L246 CegarLoopResult]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,700 INFO L246 CegarLoopResult]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,700 INFO L246 CegarLoopResult]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,700 INFO L246 CegarLoopResult]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,700 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-28 16:06:22,701 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-28 16:06:22,701 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-28 16:06:22,701 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-28 16:06:22,701 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-28 16:06:22,701 INFO L246 CegarLoopResult]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-11-28 16:06:22,701 INFO L246 CegarLoopResult]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-11-28 16:06:22,701 INFO L246 CegarLoopResult]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-11-28 16:06:22,701 INFO L246 CegarLoopResult]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-11-28 16:06:22,701 INFO L246 CegarLoopResult]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,701 INFO L246 CegarLoopResult]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,702 INFO L246 CegarLoopResult]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,702 INFO L246 CegarLoopResult]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,702 INFO L246 CegarLoopResult]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,702 INFO L246 CegarLoopResult]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-11-28 16:06:22,702 INFO L246 CegarLoopResult]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-11-28 16:06:22,702 INFO L246 CegarLoopResult]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-11-28 16:06:22,702 INFO L246 CegarLoopResult]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-11-28 16:06:22,702 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-28 16:06:22,702 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-28 16:06:22,702 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-28 16:06:22,703 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-28 16:06:22,703 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-28 16:06:22,703 INFO L246 CegarLoopResult]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-11-28 16:06:22,703 INFO L246 CegarLoopResult]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-11-28 16:06:22,703 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 16:06:22,703 INFO L246 CegarLoopResult]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-11-28 16:06:22,703 INFO L242 CegarLoopResult]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse6 (= ~a10~0 2))) (let ((.cse2 (not (= ~a19~0 10))) (.cse4 (<= 1 ~a10~0)) (.cse0 (not (= ~a10~0 3))) (.cse1 (not .cse6)) (.cse7 (= ~a10~0 0)) (.cse5 (< 218 ~a1~0)) (.cse9 (= ~a19~0 9)) (.cse8 (exists ((v_~a1~0_342 Int)) (let ((.cse10 (div (* v_~a1~0_342 9) 10))) (and (<= 0 .cse10) (= 0 (mod (+ .cse10 1) 25)) (<= ~a1~0 (+ (mod .cse10 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 .cse5 .cse6 .cse3) (and (<= ~a1~0 218) .cse1 .cse2 .cse3 (< 0 (+ ~a1~0 13))) (and .cse2 .cse7) (and .cse8 .cse6 .cse9) (= ~a19~0 7) (and .cse0 .cse1 .cse4) (and .cse8 (or (and .cse0 .cse1 (<= (+ ~a1~0 437977) 0) (not .cse9)) .cse7)) (and .cse5 .cse6 .cse9) (and .cse8 .cse6 .cse3)))) [2019-11-28 16:06:22,703 INFO L246 CegarLoopResult]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-11-28 16:06:22,704 INFO L246 CegarLoopResult]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,704 INFO L246 CegarLoopResult]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,704 INFO L246 CegarLoopResult]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,704 INFO L246 CegarLoopResult]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,704 INFO L246 CegarLoopResult]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-28 16:06:22,704 INFO L246 CegarLoopResult]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,704 INFO L246 CegarLoopResult]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,704 INFO L246 CegarLoopResult]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-11-28 16:06:22,704 INFO L246 CegarLoopResult]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-11-28 16:06:22,704 INFO L246 CegarLoopResult]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-11-28 16:06:22,704 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-28 16:06:22,704 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-28 16:06:22,705 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-28 16:06:22,705 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-28 16:06:22,705 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-28 16:06:22,705 INFO L246 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-28 16:06:22,705 INFO L246 CegarLoopResult]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-11-28 16:06:22,705 INFO L246 CegarLoopResult]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-11-28 16:06:22,705 INFO L246 CegarLoopResult]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-11-28 16:06:22,705 INFO L246 CegarLoopResult]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-11-28 16:06:22,705 INFO L246 CegarLoopResult]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,705 INFO L246 CegarLoopResult]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,705 INFO L246 CegarLoopResult]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,706 INFO L246 CegarLoopResult]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,706 INFO L246 CegarLoopResult]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,706 INFO L246 CegarLoopResult]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,706 INFO L246 CegarLoopResult]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-11-28 16:06:22,706 INFO L246 CegarLoopResult]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-11-28 16:06:22,706 INFO L246 CegarLoopResult]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-11-28 16:06:22,706 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 16:06:22,706 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-28 16:06:22,706 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-28 16:06:22,706 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-28 16:06:22,707 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-28 16:06:22,707 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-28 16:06:22,707 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-28 16:06:22,707 INFO L246 CegarLoopResult]: For program point L587(line 587) no Hoare annotation was computed. [2019-11-28 16:06:22,707 INFO L246 CegarLoopResult]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-11-28 16:06:22,707 INFO L246 CegarLoopResult]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-11-28 16:06:22,707 INFO L246 CegarLoopResult]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-11-28 16:06:22,707 INFO L246 CegarLoopResult]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-11-28 16:06:22,707 INFO L246 CegarLoopResult]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-11-28 16:06:22,707 INFO L246 CegarLoopResult]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,708 INFO L246 CegarLoopResult]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,708 INFO L246 CegarLoopResult]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,708 INFO L246 CegarLoopResult]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,708 INFO L246 CegarLoopResult]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,708 INFO L246 CegarLoopResult]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,708 INFO L246 CegarLoopResult]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-11-28 16:06:22,708 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-28 16:06:22,708 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-28 16:06:22,708 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-28 16:06:22,708 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-28 16:06:22,708 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-28 16:06:22,709 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 16:06:22,709 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-28 16:06:22,709 INFO L246 CegarLoopResult]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-11-28 16:06:22,709 INFO L246 CegarLoopResult]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-11-28 16:06:22,709 INFO L246 CegarLoopResult]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-11-28 16:06:22,709 INFO L246 CegarLoopResult]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-11-28 16:06:22,709 INFO L246 CegarLoopResult]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-11-28 16:06:22,709 INFO L246 CegarLoopResult]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-11-28 16:06:22,709 INFO L246 CegarLoopResult]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,709 INFO L246 CegarLoopResult]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,709 INFO L246 CegarLoopResult]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,709 INFO L246 CegarLoopResult]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,710 INFO L246 CegarLoopResult]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,710 INFO L246 CegarLoopResult]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,710 INFO L246 CegarLoopResult]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-11-28 16:06:22,710 INFO L246 CegarLoopResult]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-11-28 16:06:22,710 INFO L246 CegarLoopResult]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-11-28 16:06:22,710 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-28 16:06:22,710 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-28 16:06:22,710 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-28 16:06:22,710 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-28 16:06:22,710 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-28 16:06:22,711 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-28 16:06:22,711 INFO L246 CegarLoopResult]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-11-28 16:06:22,711 INFO L246 CegarLoopResult]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-11-28 16:06:22,711 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 16:06:22,711 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2019-11-28 16:06:22,711 INFO L246 CegarLoopResult]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-11-28 16:06:22,711 INFO L246 CegarLoopResult]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,711 INFO L246 CegarLoopResult]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,712 INFO L246 CegarLoopResult]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,712 INFO L246 CegarLoopResult]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,712 INFO L246 CegarLoopResult]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,712 INFO L246 CegarLoopResult]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-11-28 16:06:22,712 INFO L246 CegarLoopResult]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-11-28 16:06:22,712 INFO L246 CegarLoopResult]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-11-28 16:06:22,712 INFO L246 CegarLoopResult]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-11-28 16:06:22,712 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-28 16:06:22,712 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-28 16:06:22,712 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-28 16:06:22,713 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-28 16:06:22,713 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-28 16:06:22,713 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-28 16:06:22,713 INFO L246 CegarLoopResult]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-11-28 16:06:22,713 INFO L246 CegarLoopResult]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-11-28 16:06:22,713 INFO L246 CegarLoopResult]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-11-28 16:06:22,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,749 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,749 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,749 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,749 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:22,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:06:22 BoogieIcfgContainer [2019-11-28 16:06:22,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:06:22,757 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:06:22,758 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:06:22,764 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:06:22,764 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:06:01" (3/4) ... [2019-11-28 16:06:22,768 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 16:06:22,812 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 16:06:22,813 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 16:06:22,865 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)) || ((((a1 <= 218 && !(a10 == 2)) && !(a19 == 10)) && a19 <= 8) && 0 < a1 + 13)) || (!(a19 == 10) && 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 == 9)) || 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))) || ((218 < a1 && a10 == 2) && a19 == 9)) || (((\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-28 16:06:22,870 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)) || ((((a1 <= 218 && !(a10 == 2)) && !(a19 == 10)) && a19 <= 8) && 0 < a1 + 13)) || (!(a19 == 10) && 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 == 9)) || 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))) || ((218 < a1 && a10 == 2) && a19 == 9)) || (((\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-28 16:06:23,013 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 16:06:23,014 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:06:23,015 INFO L168 Benchmark]: Toolchain (without parser) took 24315.73 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 567.3 MB). Free memory was 952.3 MB in the beginning and 963.9 MB in the end (delta: -11.5 MB). Peak memory consumption was 555.7 MB. Max. memory is 11.5 GB. [2019-11-28 16:06:23,016 INFO L168 Benchmark]: CDTParser took 1.03 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:06:23,016 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-28 16:06:23,016 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.45 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:06:23,017 INFO L168 Benchmark]: Boogie Preprocessor took 107.79 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:06:23,017 INFO L168 Benchmark]: RCFGBuilder took 1584.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.1 MB). Peak memory consumption was 109.1 MB. Max. memory is 11.5 GB. [2019-11-28 16:06:23,018 INFO L168 Benchmark]: TraceAbstraction took 21501.21 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 417.9 MB). Free memory was 1.0 GB in the beginning and 978.2 MB in the end (delta: 23.8 MB). Peak memory consumption was 441.7 MB. Max. memory is 11.5 GB. [2019-11-28 16:06:23,018 INFO L168 Benchmark]: Witness Printer took 256.42 ms. Allocated memory is still 1.6 GB. Free memory was 978.2 MB in the beginning and 963.9 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2019-11-28 16:06:23,020 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.03 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 754.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.45 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 107.79 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1584.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.1 MB). Peak memory consumption was 109.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21501.21 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 417.9 MB). Free memory was 1.0 GB in the beginning and 978.2 MB in the end (delta: 23.8 MB). Peak memory consumption was 441.7 MB. Max. memory is 11.5 GB. * Witness Printer took 256.42 ms. Allocated memory is still 1.6 GB. Free memory was 978.2 MB in the beginning and 963.9 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 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] - 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-28 16:06:23,030 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,030 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,030 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,030 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,032 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,032 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,032 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,032 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,032 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,032 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,033 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,033 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,034 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,035 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,035 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,035 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,035 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,036 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,036 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,036 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,036 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,036 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,036 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,037 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)) || ((((a1 <= 218 && !(a10 == 2)) && !(a19 == 10)) && a19 <= 8) && 0 < a1 + 13)) || (!(a19 == 10) && 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 == 9)) || 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))) || ((218 < a1 && a10 == 2) && a19 == 9)) || (((\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-28 16:06:23,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,041 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,041 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,044 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,052 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,052 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,052 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,052 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-28 16:06:23,054 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)) || ((((a1 <= 218 && !(a10 == 2)) && !(a19 == 10)) && a19 <= 8) && 0 < a1 + 13)) || (!(a19 == 10) && 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 == 9)) || 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))) || ((218 < a1 && a10 == 2) && a19 == 9)) || (((\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: 19.9s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, HoareTripleCheckerStatistics: 883 SDtfs, 2350 SDslu, 100 SDs, 0 SdLazy, 6897 SolverSat, 979 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 954 GetRequests, 914 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.3s 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, 2502 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 64 NumberOfFragments, 483 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2162 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2724 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s 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...