./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label20.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 5360c3d4aebe9582cd01259f723ea710f280bf1f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:39:59,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:39:59,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:39:59,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:39:59,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:39:59,376 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:39:59,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:39:59,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:39:59,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:39:59,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:39:59,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:39:59,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:39:59,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:39:59,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:39:59,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:39:59,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:39:59,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:39:59,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:39:59,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:39:59,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:39:59,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:39:59,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:39:59,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:39:59,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:39:59,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:39:59,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:39:59,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:39:59,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:39:59,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:39:59,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:39:59,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:39:59,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:39:59,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:39:59,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:39:59,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:39:59,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:39:59,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:39:59,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:39:59,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:39:59,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:39:59,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:39:59,432 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:39:59,448 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:39:59,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:39:59,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:39:59,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:39:59,450 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:39:59,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:39:59,451 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:39:59,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:39:59,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:39:59,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:39:59,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:39:59,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:39:59,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:39:59,452 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:39:59,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:39:59,452 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:39:59,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:39:59,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:39:59,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:39:59,453 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:39:59,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:39:59,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:39:59,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:39:59,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:39:59,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:39:59,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:39:59,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:39:59,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:39:59,455 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 -> 5360c3d4aebe9582cd01259f723ea710f280bf1f [2019-11-27 22:39:59,819 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:39:59,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:39:59,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:39:59,844 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:39:59,844 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:39:59,846 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label20.c [2019-11-27 22:39:59,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4781a3931/6be23c1c2cc74974a4452e2d62bf96ef/FLAG57f5ecc62 [2019-11-27 22:40:00,501 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:40:00,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label20.c [2019-11-27 22:40:00,516 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4781a3931/6be23c1c2cc74974a4452e2d62bf96ef/FLAG57f5ecc62 [2019-11-27 22:40:00,782 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4781a3931/6be23c1c2cc74974a4452e2d62bf96ef [2019-11-27 22:40:00,785 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:40:00,787 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:40:00,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:40:00,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:40:00,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:40:00,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:40:00" (1/1) ... [2019-11-27 22:40:00,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600cef8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:00, skipping insertion in model container [2019-11-27 22:40:00,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:40:00" (1/1) ... [2019-11-27 22:40:00,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:40:00,859 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:40:01,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:40:01,424 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:40:01,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:40:01,594 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:40:01,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01 WrapperNode [2019-11-27 22:40:01,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:40:01,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:40:01,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:40:01,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:40:01,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:40:01,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:40:01,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:40:01,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:40:01,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:40:01,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:40:01,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:40:01,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:40:01,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:40:01,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:40:01,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:40:03,227 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:40:03,228 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:40:03,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:40:03 BoogieIcfgContainer [2019-11-27 22:40:03,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:40:03,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:40:03,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:40:03,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:40:03,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:40:00" (1/3) ... [2019-11-27 22:40:03,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6879dd83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:40:03, skipping insertion in model container [2019-11-27 22:40:03,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (2/3) ... [2019-11-27 22:40:03,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6879dd83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:40:03, skipping insertion in model container [2019-11-27 22:40:03,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:40:03" (3/3) ... [2019-11-27 22:40:03,242 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label20.c [2019-11-27 22:40:03,252 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:40:03,260 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:40:03,273 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:40:03,322 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:40:03,322 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:40:03,322 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:40:03,323 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:40:03,323 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:40:03,323 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:40:03,323 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:40:03,324 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:40:03,358 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-27 22:40:03,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-27 22:40:03,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:03,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:40:03,376 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:03,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:03,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1124491187, now seen corresponding path program 1 times [2019-11-27 22:40:03,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:03,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112366999] [2019-11-27 22:40:03,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:40:03,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112366999] [2019-11-27 22:40:03,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:03,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:03,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486156711] [2019-11-27 22:40:03,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:03,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:03,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:03,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:03,896 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-27 22:40:05,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:05,348 INFO L93 Difference]: Finished difference Result 739 states and 1311 transitions. [2019-11-27 22:40:05,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:40:05,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-27 22:40:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:05,369 INFO L225 Difference]: With dead ends: 739 [2019-11-27 22:40:05,369 INFO L226 Difference]: Without dead ends: 445 [2019-11-27 22:40:05,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:05,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-11-27 22:40:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2019-11-27 22:40:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-11-27 22:40:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 664 transitions. [2019-11-27 22:40:05,470 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 664 transitions. Word has length 99 [2019-11-27 22:40:05,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:05,473 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 664 transitions. [2019-11-27 22:40:05,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 664 transitions. [2019-11-27 22:40:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-27 22:40:05,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:05,483 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:40:05,484 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:05,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:05,484 INFO L82 PathProgramCache]: Analyzing trace with hash -661756398, now seen corresponding path program 1 times [2019-11-27 22:40:05,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:05,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289950372] [2019-11-27 22:40:05,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:40:05,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289950372] [2019-11-27 22:40:05,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:05,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:05,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078068652] [2019-11-27 22:40:05,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:05,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:05,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:05,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:05,631 INFO L87 Difference]: Start difference. First operand 445 states and 664 transitions. Second operand 4 states. [2019-11-27 22:40:06,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:06,510 INFO L93 Difference]: Finished difference Result 1470 states and 2193 transitions. [2019-11-27 22:40:06,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:40:06,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-27 22:40:06,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:06,520 INFO L225 Difference]: With dead ends: 1470 [2019-11-27 22:40:06,521 INFO L226 Difference]: Without dead ends: 1027 [2019-11-27 22:40:06,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:06,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-11-27 22:40:06,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 729. [2019-11-27 22:40:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-11-27 22:40:06,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1053 transitions. [2019-11-27 22:40:06,568 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1053 transitions. Word has length 117 [2019-11-27 22:40:06,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:06,569 INFO L462 AbstractCegarLoop]: Abstraction has 729 states and 1053 transitions. [2019-11-27 22:40:06,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1053 transitions. [2019-11-27 22:40:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-27 22:40:06,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:06,574 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:40:06,574 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash -612453497, now seen corresponding path program 1 times [2019-11-27 22:40:06,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:06,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114254726] [2019-11-27 22:40:06,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:40:06,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114254726] [2019-11-27 22:40:06,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:06,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:40:06,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813644663] [2019-11-27 22:40:06,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:06,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:06,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:06,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:06,720 INFO L87 Difference]: Start difference. First operand 729 states and 1053 transitions. Second operand 4 states. [2019-11-27 22:40:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:07,797 INFO L93 Difference]: Finished difference Result 2582 states and 3716 transitions. [2019-11-27 22:40:07,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:40:07,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-27 22:40:07,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:07,808 INFO L225 Difference]: With dead ends: 2582 [2019-11-27 22:40:07,808 INFO L226 Difference]: Without dead ends: 1855 [2019-11-27 22:40:07,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:07,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2019-11-27 22:40:07,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1570. [2019-11-27 22:40:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2019-11-27 22:40:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2141 transitions. [2019-11-27 22:40:07,860 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2141 transitions. Word has length 121 [2019-11-27 22:40:07,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:07,860 INFO L462 AbstractCegarLoop]: Abstraction has 1570 states and 2141 transitions. [2019-11-27 22:40:07,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2141 transitions. [2019-11-27 22:40:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-27 22:40:07,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:07,865 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:40:07,865 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:07,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:07,866 INFO L82 PathProgramCache]: Analyzing trace with hash 519114652, now seen corresponding path program 1 times [2019-11-27 22:40:07,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:07,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735541682] [2019-11-27 22:40:07,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:40:07,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735541682] [2019-11-27 22:40:07,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:07,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:40:07,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406592679] [2019-11-27 22:40:07,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:07,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:07,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:07,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:07,989 INFO L87 Difference]: Start difference. First operand 1570 states and 2141 transitions. Second operand 3 states. [2019-11-27 22:40:08,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:08,534 INFO L93 Difference]: Finished difference Result 3840 states and 5193 transitions. [2019-11-27 22:40:08,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:08,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-27 22:40:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:08,545 INFO L225 Difference]: With dead ends: 3840 [2019-11-27 22:40:08,545 INFO L226 Difference]: Without dead ends: 2272 [2019-11-27 22:40:08,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2019-11-27 22:40:08,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 2272. [2019-11-27 22:40:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2019-11-27 22:40:08,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2838 transitions. [2019-11-27 22:40:08,598 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2838 transitions. Word has length 121 [2019-11-27 22:40:08,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:08,598 INFO L462 AbstractCegarLoop]: Abstraction has 2272 states and 2838 transitions. [2019-11-27 22:40:08,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:08,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2838 transitions. [2019-11-27 22:40:08,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-27 22:40:08,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:08,602 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:40:08,602 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:08,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:08,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1585632305, now seen corresponding path program 1 times [2019-11-27 22:40:08,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:08,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300160366] [2019-11-27 22:40:08,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-27 22:40:08,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300160366] [2019-11-27 22:40:08,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:08,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:08,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356602231] [2019-11-27 22:40:08,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:08,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:08,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:08,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:08,725 INFO L87 Difference]: Start difference. First operand 2272 states and 2838 transitions. Second operand 3 states. [2019-11-27 22:40:09,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:09,252 INFO L93 Difference]: Finished difference Result 5381 states and 6669 transitions. [2019-11-27 22:40:09,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:09,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-11-27 22:40:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:09,267 INFO L225 Difference]: With dead ends: 5381 [2019-11-27 22:40:09,267 INFO L226 Difference]: Without dead ends: 2546 [2019-11-27 22:40:09,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-11-27 22:40:09,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2125. [2019-11-27 22:40:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-11-27 22:40:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2479 transitions. [2019-11-27 22:40:09,317 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2479 transitions. Word has length 126 [2019-11-27 22:40:09,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:09,318 INFO L462 AbstractCegarLoop]: Abstraction has 2125 states and 2479 transitions. [2019-11-27 22:40:09,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2479 transitions. [2019-11-27 22:40:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-27 22:40:09,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:09,323 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:40:09,323 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:09,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash 426939321, now seen corresponding path program 1 times [2019-11-27 22:40:09,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:09,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349485022] [2019-11-27 22:40:09,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-27 22:40:09,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349485022] [2019-11-27 22:40:09,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:09,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:40:09,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288990649] [2019-11-27 22:40:09,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:09,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:09,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:09,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:09,433 INFO L87 Difference]: Start difference. First operand 2125 states and 2479 transitions. Second operand 4 states. [2019-11-27 22:40:10,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:10,029 INFO L93 Difference]: Finished difference Result 4388 states and 5107 transitions. [2019-11-27 22:40:10,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:10,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-11-27 22:40:10,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:10,040 INFO L225 Difference]: With dead ends: 4388 [2019-11-27 22:40:10,040 INFO L226 Difference]: Without dead ends: 1985 [2019-11-27 22:40:10,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2019-11-27 22:40:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1705. [2019-11-27 22:40:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-11-27 22:40:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 1937 transitions. [2019-11-27 22:40:10,090 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 1937 transitions. Word has length 137 [2019-11-27 22:40:10,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:10,090 INFO L462 AbstractCegarLoop]: Abstraction has 1705 states and 1937 transitions. [2019-11-27 22:40:10,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:10,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 1937 transitions. [2019-11-27 22:40:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-27 22:40:10,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:10,095 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:40:10,096 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:10,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:10,100 INFO L82 PathProgramCache]: Analyzing trace with hash 825573273, now seen corresponding path program 1 times [2019-11-27 22:40:10,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:10,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393680365] [2019-11-27 22:40:10,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-27 22:40:10,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393680365] [2019-11-27 22:40:10,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:10,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:10,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946188982] [2019-11-27 22:40:10,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:10,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:10,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:10,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:10,247 INFO L87 Difference]: Start difference. First operand 1705 states and 1937 transitions. Second operand 3 states. [2019-11-27 22:40:10,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:10,760 INFO L93 Difference]: Finished difference Result 3411 states and 3863 transitions. [2019-11-27 22:40:10,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:10,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-27 22:40:10,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:10,767 INFO L225 Difference]: With dead ends: 3411 [2019-11-27 22:40:10,768 INFO L226 Difference]: Without dead ends: 1707 [2019-11-27 22:40:10,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:10,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-27 22:40:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1703. [2019-11-27 22:40:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-11-27 22:40:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 1867 transitions. [2019-11-27 22:40:10,801 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 1867 transitions. Word has length 150 [2019-11-27 22:40:10,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:10,801 INFO L462 AbstractCegarLoop]: Abstraction has 1703 states and 1867 transitions. [2019-11-27 22:40:10,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 1867 transitions. [2019-11-27 22:40:10,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-27 22:40:10,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:10,808 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:40:10,808 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:10,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:10,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1830161714, now seen corresponding path program 1 times [2019-11-27 22:40:10,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:10,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166596931] [2019-11-27 22:40:10,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 125 proven. 3 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-11-27 22:40:10,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166596931] [2019-11-27 22:40:10,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694551916] [2019-11-27 22:40:10,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:40:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:11,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:40:11,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:40:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-27 22:40:11,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:40:11,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-27 22:40:11,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57070971] [2019-11-27 22:40:11,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:11,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:11,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:11,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:40:11,215 INFO L87 Difference]: Start difference. First operand 1703 states and 1867 transitions. Second operand 3 states. [2019-11-27 22:40:11,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:11,736 INFO L93 Difference]: Finished difference Result 3818 states and 4177 transitions. [2019-11-27 22:40:11,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:11,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-11-27 22:40:11,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:11,737 INFO L225 Difference]: With dead ends: 3818 [2019-11-27 22:40:11,737 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:40:11,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:40:11,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:40:11,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:40:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:40:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:40:11,744 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2019-11-27 22:40:11,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:11,745 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:40:11,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:11,745 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:40:11,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:40:11,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:40:11,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:40:12,227 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-11-27 22:40:12,428 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-11-27 22:40:12,433 INFO L246 CegarLoopResult]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,433 INFO L246 CegarLoopResult]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,433 INFO L246 CegarLoopResult]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,433 INFO L246 CegarLoopResult]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-27 22:40:12,434 INFO L246 CegarLoopResult]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-27 22:40:12,434 INFO L246 CegarLoopResult]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-27 22:40:12,434 INFO L246 CegarLoopResult]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-27 22:40:12,434 INFO L246 CegarLoopResult]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-27 22:40:12,434 INFO L246 CegarLoopResult]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-27 22:40:12,434 INFO L246 CegarLoopResult]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-27 22:40:12,435 INFO L246 CegarLoopResult]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,435 INFO L246 CegarLoopResult]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,435 INFO L246 CegarLoopResult]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,435 INFO L246 CegarLoopResult]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-27 22:40:12,435 INFO L246 CegarLoopResult]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-27 22:40:12,435 INFO L246 CegarLoopResult]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-27 22:40:12,436 INFO L246 CegarLoopResult]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-27 22:40:12,436 INFO L246 CegarLoopResult]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-27 22:40:12,436 INFO L246 CegarLoopResult]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-27 22:40:12,436 INFO L246 CegarLoopResult]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-27 22:40:12,436 INFO L246 CegarLoopResult]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,436 INFO L246 CegarLoopResult]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,436 INFO L246 CegarLoopResult]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,437 INFO L246 CegarLoopResult]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-27 22:40:12,437 INFO L246 CegarLoopResult]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-27 22:40:12,437 INFO L246 CegarLoopResult]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-27 22:40:12,437 INFO L246 CegarLoopResult]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-27 22:40:12,437 INFO L246 CegarLoopResult]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-27 22:40:12,437 INFO L246 CegarLoopResult]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,437 INFO L246 CegarLoopResult]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,437 INFO L246 CegarLoopResult]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,437 INFO L246 CegarLoopResult]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-27 22:40:12,437 INFO L246 CegarLoopResult]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-27 22:40:12,438 INFO L246 CegarLoopResult]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-27 22:40:12,438 INFO L246 CegarLoopResult]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-27 22:40:12,438 INFO L246 CegarLoopResult]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-27 22:40:12,438 INFO L246 CegarLoopResult]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-27 22:40:12,438 INFO L246 CegarLoopResult]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-27 22:40:12,438 INFO L246 CegarLoopResult]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-27 22:40:12,438 INFO L246 CegarLoopResult]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,438 INFO L246 CegarLoopResult]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,438 INFO L246 CegarLoopResult]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,439 INFO L246 CegarLoopResult]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-27 22:40:12,439 INFO L246 CegarLoopResult]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-27 22:40:12,439 INFO L246 CegarLoopResult]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-27 22:40:12,439 INFO L246 CegarLoopResult]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-27 22:40:12,439 INFO L246 CegarLoopResult]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-27 22:40:12,439 INFO L246 CegarLoopResult]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-27 22:40:12,439 INFO L246 CegarLoopResult]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-27 22:40:12,439 INFO L246 CegarLoopResult]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-27 22:40:12,439 INFO L246 CegarLoopResult]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,439 INFO L246 CegarLoopResult]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,440 INFO L246 CegarLoopResult]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,440 INFO L246 CegarLoopResult]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-27 22:40:12,440 INFO L246 CegarLoopResult]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-27 22:40:12,440 INFO L246 CegarLoopResult]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-27 22:40:12,440 INFO L246 CegarLoopResult]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-27 22:40:12,440 INFO L246 CegarLoopResult]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-27 22:40:12,440 INFO L246 CegarLoopResult]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-27 22:40:12,440 INFO L246 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-27 22:40:12,440 INFO L246 CegarLoopResult]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-27 22:40:12,440 INFO L246 CegarLoopResult]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-27 22:40:12,441 INFO L246 CegarLoopResult]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,441 INFO L246 CegarLoopResult]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,441 INFO L246 CegarLoopResult]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,441 INFO L246 CegarLoopResult]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-27 22:40:12,441 INFO L246 CegarLoopResult]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-27 22:40:12,441 INFO L246 CegarLoopResult]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-27 22:40:12,441 INFO L246 CegarLoopResult]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-27 22:40:12,441 INFO L246 CegarLoopResult]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-27 22:40:12,441 INFO L246 CegarLoopResult]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-27 22:40:12,441 INFO L246 CegarLoopResult]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,442 INFO L246 CegarLoopResult]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,442 INFO L246 CegarLoopResult]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,442 INFO L246 CegarLoopResult]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-27 22:40:12,442 INFO L246 CegarLoopResult]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-27 22:40:12,442 INFO L246 CegarLoopResult]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-27 22:40:12,442 INFO L246 CegarLoopResult]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-27 22:40:12,442 INFO L246 CegarLoopResult]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-27 22:40:12,442 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:40:12,442 INFO L246 CegarLoopResult]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-27 22:40:12,442 INFO L246 CegarLoopResult]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-27 22:40:12,443 INFO L246 CegarLoopResult]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-27 22:40:12,443 INFO L246 CegarLoopResult]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,443 INFO L246 CegarLoopResult]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,443 INFO L246 CegarLoopResult]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,443 INFO L246 CegarLoopResult]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-27 22:40:12,443 INFO L246 CegarLoopResult]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-27 22:40:12,443 INFO L246 CegarLoopResult]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-27 22:40:12,443 INFO L246 CegarLoopResult]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-27 22:40:12,443 INFO L246 CegarLoopResult]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-27 22:40:12,444 INFO L246 CegarLoopResult]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,444 INFO L246 CegarLoopResult]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,444 INFO L246 CegarLoopResult]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,444 INFO L246 CegarLoopResult]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-27 22:40:12,444 INFO L246 CegarLoopResult]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-27 22:40:12,444 INFO L246 CegarLoopResult]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-27 22:40:12,444 INFO L246 CegarLoopResult]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-27 22:40:12,444 INFO L246 CegarLoopResult]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-27 22:40:12,444 INFO L246 CegarLoopResult]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-27 22:40:12,444 INFO L246 CegarLoopResult]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-27 22:40:12,445 INFO L246 CegarLoopResult]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-27 22:40:12,445 INFO L246 CegarLoopResult]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-27 22:40:12,445 INFO L246 CegarLoopResult]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-27 22:40:12,445 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 22:40:12,445 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 469) no Hoare annotation was computed. [2019-11-27 22:40:12,445 INFO L246 CegarLoopResult]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-27 22:40:12,445 INFO L246 CegarLoopResult]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,445 INFO L246 CegarLoopResult]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,446 INFO L246 CegarLoopResult]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-27 22:40:12,446 INFO L246 CegarLoopResult]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-27 22:40:12,446 INFO L246 CegarLoopResult]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-27 22:40:12,446 INFO L246 CegarLoopResult]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-27 22:40:12,446 INFO L246 CegarLoopResult]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-27 22:40:12,446 INFO L246 CegarLoopResult]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-27 22:40:12,446 INFO L246 CegarLoopResult]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-27 22:40:12,446 INFO L246 CegarLoopResult]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-27 22:40:12,446 INFO L246 CegarLoopResult]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-27 22:40:12,447 INFO L242 CegarLoopResult]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse5 (= ~a25~0 1))) (let ((.cse4 (not (= ~a28~0 11))) (.cse8 (not .cse5)) (.cse3 (= ~a19~0 1)) (.cse6 (= ~a11~0 1))) (let ((.cse1 (<= 10 ~a28~0)) (.cse2 (= ~a17~0 8)) (.cse0 (or (and .cse8 .cse6 .cse4) (and .cse8 .cse3 .cse6))) (.cse9 (= ~a28~0 9)) (.cse7 (<= ~a19~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse1 .cse3 .cse5) (and .cse3 .cse6 .cse5) (and .cse7 .cse8 .cse2) (and .cse7 .cse2 .cse4) (and .cse9 .cse2 .cse6) (and .cse8 .cse2 .cse6 .cse4) (and .cse0 .cse7) (and .cse9 .cse7))))) [2019-11-27 22:40:12,447 INFO L246 CegarLoopResult]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,447 INFO L246 CegarLoopResult]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,447 INFO L246 CegarLoopResult]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-27 22:40:12,447 INFO L246 CegarLoopResult]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-27 22:40:12,447 INFO L246 CegarLoopResult]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-27 22:40:12,448 INFO L246 CegarLoopResult]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-27 22:40:12,448 INFO L246 CegarLoopResult]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-27 22:40:12,448 INFO L246 CegarLoopResult]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-27 22:40:12,448 INFO L249 CegarLoopResult]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-27 22:40:12,448 INFO L246 CegarLoopResult]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,448 INFO L246 CegarLoopResult]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,448 INFO L246 CegarLoopResult]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-27 22:40:12,448 INFO L246 CegarLoopResult]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-27 22:40:12,448 INFO L246 CegarLoopResult]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-27 22:40:12,448 INFO L246 CegarLoopResult]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-27 22:40:12,449 INFO L246 CegarLoopResult]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-27 22:40:12,449 INFO L246 CegarLoopResult]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-27 22:40:12,449 INFO L246 CegarLoopResult]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-27 22:40:12,449 INFO L246 CegarLoopResult]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-27 22:40:12,449 INFO L246 CegarLoopResult]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-27 22:40:12,449 INFO L246 CegarLoopResult]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,449 INFO L246 CegarLoopResult]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,449 INFO L246 CegarLoopResult]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-27 22:40:12,449 INFO L246 CegarLoopResult]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-27 22:40:12,449 INFO L246 CegarLoopResult]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-27 22:40:12,450 INFO L246 CegarLoopResult]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-27 22:40:12,450 INFO L246 CegarLoopResult]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-27 22:40:12,450 INFO L246 CegarLoopResult]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-27 22:40:12,450 INFO L242 CegarLoopResult]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse5 (= ~a25~0 1))) (let ((.cse4 (not (= ~a28~0 11))) (.cse8 (not .cse5)) (.cse3 (= ~a19~0 1)) (.cse6 (= ~a11~0 1))) (let ((.cse1 (<= 10 ~a28~0)) (.cse2 (= ~a17~0 8)) (.cse0 (or (and .cse8 .cse6 .cse4) (and .cse8 .cse3 .cse6))) (.cse9 (= ~a28~0 9)) (.cse7 (<= ~a19~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse1 .cse3 .cse5) (and .cse3 .cse6 .cse5) (and .cse7 .cse8 .cse2) (and .cse7 .cse2 .cse4) (and .cse9 .cse2 .cse6) (and .cse8 .cse2 .cse6 .cse4) (and .cse0 .cse7) (and .cse9 .cse7))))) [2019-11-27 22:40:12,450 INFO L246 CegarLoopResult]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,450 INFO L246 CegarLoopResult]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,450 INFO L246 CegarLoopResult]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-27 22:40:12,451 INFO L246 CegarLoopResult]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-27 22:40:12,451 INFO L246 CegarLoopResult]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-27 22:40:12,451 INFO L246 CegarLoopResult]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-27 22:40:12,451 INFO L246 CegarLoopResult]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-27 22:40:12,451 INFO L246 CegarLoopResult]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,451 INFO L246 CegarLoopResult]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,451 INFO L246 CegarLoopResult]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-27 22:40:12,451 INFO L246 CegarLoopResult]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-27 22:40:12,451 INFO L246 CegarLoopResult]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-27 22:40:12,451 INFO L246 CegarLoopResult]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-27 22:40:12,452 INFO L246 CegarLoopResult]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-27 22:40:12,452 INFO L246 CegarLoopResult]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-27 22:40:12,452 INFO L246 CegarLoopResult]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-27 22:40:12,452 INFO L246 CegarLoopResult]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-27 22:40:12,452 INFO L246 CegarLoopResult]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-27 22:40:12,452 INFO L246 CegarLoopResult]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,452 INFO L246 CegarLoopResult]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,452 INFO L246 CegarLoopResult]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-27 22:40:12,452 INFO L246 CegarLoopResult]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,453 INFO L246 CegarLoopResult]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-27 22:40:12,453 INFO L246 CegarLoopResult]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-27 22:40:12,453 INFO L246 CegarLoopResult]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-27 22:40:12,453 INFO L246 CegarLoopResult]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-27 22:40:12,453 INFO L246 CegarLoopResult]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-27 22:40:12,453 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:40:12,453 INFO L246 CegarLoopResult]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-27 22:40:12,453 INFO L246 CegarLoopResult]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,453 INFO L246 CegarLoopResult]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,453 INFO L246 CegarLoopResult]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,453 INFO L246 CegarLoopResult]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-27 22:40:12,454 INFO L246 CegarLoopResult]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-27 22:40:12,454 INFO L246 CegarLoopResult]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-27 22:40:12,454 INFO L246 CegarLoopResult]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-27 22:40:12,454 INFO L246 CegarLoopResult]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-27 22:40:12,454 INFO L246 CegarLoopResult]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,454 INFO L246 CegarLoopResult]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,454 INFO L246 CegarLoopResult]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,455 INFO L246 CegarLoopResult]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-27 22:40:12,455 INFO L246 CegarLoopResult]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-27 22:40:12,455 INFO L246 CegarLoopResult]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-27 22:40:12,455 INFO L246 CegarLoopResult]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-27 22:40:12,455 INFO L246 CegarLoopResult]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-27 22:40:12,455 INFO L246 CegarLoopResult]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-27 22:40:12,455 INFO L246 CegarLoopResult]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,456 INFO L246 CegarLoopResult]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,456 INFO L246 CegarLoopResult]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,456 INFO L246 CegarLoopResult]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-27 22:40:12,456 INFO L246 CegarLoopResult]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-27 22:40:12,456 INFO L246 CegarLoopResult]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-27 22:40:12,456 INFO L246 CegarLoopResult]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-27 22:40:12,456 INFO L246 CegarLoopResult]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-27 22:40:12,456 INFO L246 CegarLoopResult]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-27 22:40:12,458 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:40:12,458 INFO L246 CegarLoopResult]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-27 22:40:12,458 INFO L246 CegarLoopResult]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-27 22:40:12,458 INFO L246 CegarLoopResult]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,458 INFO L246 CegarLoopResult]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,458 INFO L246 CegarLoopResult]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,459 INFO L246 CegarLoopResult]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-27 22:40:12,459 INFO L246 CegarLoopResult]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-27 22:40:12,459 INFO L246 CegarLoopResult]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-27 22:40:12,459 INFO L246 CegarLoopResult]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-27 22:40:12,459 INFO L246 CegarLoopResult]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-27 22:40:12,459 INFO L246 CegarLoopResult]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,459 INFO L246 CegarLoopResult]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,459 INFO L246 CegarLoopResult]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:12,459 INFO L246 CegarLoopResult]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-27 22:40:12,459 INFO L246 CegarLoopResult]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-27 22:40:12,460 INFO L246 CegarLoopResult]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-27 22:40:12,460 INFO L246 CegarLoopResult]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-27 22:40:12,460 INFO L246 CegarLoopResult]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-27 22:40:12,460 INFO L246 CegarLoopResult]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-27 22:40:12,460 INFO L246 CegarLoopResult]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-27 22:40:12,460 INFO L246 CegarLoopResult]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-27 22:40:12,460 INFO L246 CegarLoopResult]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-27 22:40:12,460 INFO L246 CegarLoopResult]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-27 22:40:12,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:40:12 BoogieIcfgContainer [2019-11-27 22:40:12,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:40:12,485 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:40:12,486 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:40:12,486 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:40:12,486 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:40:03" (3/4) ... [2019-11-27 22:40:12,491 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:40:12,518 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:40:12,520 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:40:12,714 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:40:12,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:40:12,716 INFO L168 Benchmark]: Toolchain (without parser) took 11929.46 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.5 MB). Free memory was 955.0 MB in the beginning and 838.7 MB in the end (delta: 116.3 MB). Peak memory consumption was 450.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:12,716 INFO L168 Benchmark]: CDTParser took 0.30 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-27 22:40:12,717 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:12,717 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.63 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:12,717 INFO L168 Benchmark]: Boogie Preprocessor took 66.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:40:12,718 INFO L168 Benchmark]: RCFGBuilder took 1479.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.5 MB in the end (delta: 111.6 MB). Peak memory consumption was 111.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:12,718 INFO L168 Benchmark]: TraceAbstraction took 9253.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.0 MB). Free memory was 995.5 MB in the beginning and 857.8 MB in the end (delta: 137.7 MB). Peak memory consumption was 332.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:12,719 INFO L168 Benchmark]: Witness Printer took 228.72 ms. Allocated memory is still 1.4 GB. Free memory was 857.8 MB in the beginning and 838.7 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:12,721 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 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 807.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.63 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1479.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.5 MB in the end (delta: 111.6 MB). Peak memory consumption was 111.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9253.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.0 MB). Free memory was 995.5 MB in the beginning and 857.8 MB in the end (delta: 137.7 MB). Peak memory consumption was 332.8 MB. Max. memory is 11.5 GB. * Witness Printer took 228.72 ms. Allocated memory is still 1.4 GB. Free memory was 857.8 MB in the beginning and 838.7 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 469]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a19 == 1) && a11 == 1)) && 10 <= a28) || ((a17 == 8 && a19 == 1) && !(a28 == 11))) || ((10 <= a28 && a19 == 1) && a25 == 1)) || ((a19 == 1 && a11 == 1) && a25 == 1)) || ((a19 <= 0 && !(a25 == 1)) && a17 == 8)) || ((a19 <= 0 && a17 == 8) && !(a28 == 11))) || ((a28 == 9 && a17 == 8) && a11 == 1)) || (((!(a25 == 1) && a17 == 8) && a11 == 1) && !(a28 == 11))) || ((((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a19 == 1) && a11 == 1)) && a19 <= 0)) || (a28 == 9 && a19 <= 0) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a19 == 1) && a11 == 1)) && 10 <= a28) || ((a17 == 8 && a19 == 1) && !(a28 == 11))) || ((10 <= a28 && a19 == 1) && a25 == 1)) || ((a19 == 1 && a11 == 1) && a25 == 1)) || ((a19 <= 0 && !(a25 == 1)) && a17 == 8)) || ((a19 <= 0 && a17 == 8) && !(a28 == 11))) || ((a28 == 9 && a17 == 8) && a11 == 1)) || (((!(a25 == 1) && a17 == 8) && a11 == 1) && !(a28 == 11))) || ((((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a19 == 1) && a11 == 1)) && a19 <= 0)) || (a28 == 9 && a19 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 8.6s, OverallIterations: 8, TraceHistogramMax: 5, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 1152 SDtfs, 1599 SDslu, 214 SDs, 0 SdLazy, 4086 SolverSat, 774 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 254 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2272occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 1288 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 48 NumberOfFragments, 285 HoareAnnotationTreeSize, 3 FomulaSimplifications, 636 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 316 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1359 NumberOfCodeBlocks, 1359 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1350 ConstructedInterpolants, 0 QuantifiedInterpolants, 442232 SizeOfPredicates, 1 NumberOfNonLiveVariables, 408 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 770/773 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...