./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label59.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 5f1f3e9c958502587d73771213325403adeeeeae ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 20:59:28,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 20:59:28,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 20:59:28,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 20:59:28,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 20:59:28,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 20:59:28,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 20:59:28,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 20:59:28,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 20:59:28,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 20:59:28,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 20:59:28,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 20:59:28,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 20:59:28,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 20:59:28,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 20:59:28,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 20:59:28,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 20:59:28,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 20:59:28,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 20:59:28,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 20:59:28,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 20:59:28,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 20:59:28,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 20:59:28,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 20:59:28,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 20:59:28,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 20:59:28,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 20:59:28,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 20:59:28,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 20:59:28,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 20:59:28,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 20:59:28,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 20:59:28,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 20:59:28,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 20:59:28,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 20:59:28,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 20:59:28,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 20:59:28,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 20:59:28,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 20:59:28,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 20:59:28,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 20:59:28,382 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 20:59:28,400 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 20:59:28,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 20:59:28,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 20:59:28,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 20:59:28,403 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 20:59:28,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 20:59:28,403 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 20:59:28,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 20:59:28,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 20:59:28,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 20:59:28,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 20:59:28,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 20:59:28,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 20:59:28,411 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 20:59:28,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 20:59:28,412 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 20:59:28,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 20:59:28,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 20:59:28,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 20:59:28,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 20:59:28,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 20:59:28,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 20:59:28,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 20:59:28,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 20:59:28,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 20:59:28,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 20:59:28,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 20:59:28,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 20:59:28,416 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 -> 5f1f3e9c958502587d73771213325403adeeeeae [2019-11-19 20:59:28,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 20:59:28,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 20:59:28,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 20:59:28,738 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 20:59:28,738 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 20:59:28,739 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label59.c [2019-11-19 20:59:28,810 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f75bf2a/162a03d877464d559c453cf1ec9aef59/FLAGc8484cb7b [2019-11-19 20:59:29,368 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 20:59:29,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label59.c [2019-11-19 20:59:29,386 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f75bf2a/162a03d877464d559c453cf1ec9aef59/FLAGc8484cb7b [2019-11-19 20:59:29,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f75bf2a/162a03d877464d559c453cf1ec9aef59 [2019-11-19 20:59:29,673 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 20:59:29,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 20:59:29,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 20:59:29,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 20:59:29,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 20:59:29,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:59:29" (1/1) ... [2019-11-19 20:59:29,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bfeabe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:29, skipping insertion in model container [2019-11-19 20:59:29,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:59:29" (1/1) ... [2019-11-19 20:59:29,694 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 20:59:29,750 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 20:59:30,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:59:30,223 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 20:59:30,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:59:30,434 INFO L192 MainTranslator]: Completed translation [2019-11-19 20:59:30,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:30 WrapperNode [2019-11-19 20:59:30,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 20:59:30,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 20:59:30,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 20:59:30,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 20:59:30,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:30" (1/1) ... [2019-11-19 20:59:30,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:30" (1/1) ... [2019-11-19 20:59:30,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 20:59:30,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 20:59:30,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 20:59:30,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 20:59:30,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:30" (1/1) ... [2019-11-19 20:59:30,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:30" (1/1) ... [2019-11-19 20:59:30,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:30" (1/1) ... [2019-11-19 20:59:30,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:30" (1/1) ... [2019-11-19 20:59:30,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:30" (1/1) ... [2019-11-19 20:59:30,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:30" (1/1) ... [2019-11-19 20:59:30,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:30" (1/1) ... [2019-11-19 20:59:30,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 20:59:30,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 20:59:30,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 20:59:30,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 20:59:30,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:30" (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-19 20:59:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 20:59:30,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 20:59:32,156 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 20:59:32,156 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 20:59:32,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:59:32 BoogieIcfgContainer [2019-11-19 20:59:32,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 20:59:32,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 20:59:32,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 20:59:32,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 20:59:32,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:59:29" (1/3) ... [2019-11-19 20:59:32,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd0e6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:59:32, skipping insertion in model container [2019-11-19 20:59:32,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:30" (2/3) ... [2019-11-19 20:59:32,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd0e6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:59:32, skipping insertion in model container [2019-11-19 20:59:32,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:59:32" (3/3) ... [2019-11-19 20:59:32,168 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label59.c [2019-11-19 20:59:32,179 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 20:59:32,187 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 20:59:32,200 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 20:59:32,231 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 20:59:32,231 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 20:59:32,232 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 20:59:32,232 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 20:59:32,232 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 20:59:32,232 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 20:59:32,233 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 20:59:32,233 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 20:59:32,258 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-11-19 20:59:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-19 20:59:32,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:32,269 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] [2019-11-19 20:59:32,270 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:32,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:32,277 INFO L82 PathProgramCache]: Analyzing trace with hash 962891993, now seen corresponding path program 1 times [2019-11-19 20:59:32,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:32,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129215151] [2019-11-19 20:59:32,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:32,673 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-19 20:59:32,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129215151] [2019-11-19 20:59:32,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:59:32,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:59:32,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840478227] [2019-11-19 20:59:32,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:59:32,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:32,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:59:32,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:59:32,707 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-11-19 20:59:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:34,219 INFO L93 Difference]: Finished difference Result 709 states and 1261 transitions. [2019-11-19 20:59:34,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:59:34,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-19 20:59:34,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:34,254 INFO L225 Difference]: With dead ends: 709 [2019-11-19 20:59:34,254 INFO L226 Difference]: Without dead ends: 421 [2019-11-19 20:59:34,263 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-19 20:59:34,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-19 20:59:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 282. [2019-11-19 20:59:34,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-19 20:59:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2019-11-19 20:59:34,342 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 65 [2019-11-19 20:59:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:34,343 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2019-11-19 20:59:34,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:59:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2019-11-19 20:59:34,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-19 20:59:34,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:34,349 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 20:59:34,349 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:34,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:34,350 INFO L82 PathProgramCache]: Analyzing trace with hash -2138327860, now seen corresponding path program 1 times [2019-11-19 20:59:34,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:34,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100628386] [2019-11-19 20:59:34,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:34,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100628386] [2019-11-19 20:59:34,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:59:34,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:59:34,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140827020] [2019-11-19 20:59:34,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:59:34,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:34,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:59:34,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:59:34,612 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 4 states. [2019-11-19 20:59:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:35,868 INFO L93 Difference]: Finished difference Result 1118 states and 1720 transitions. [2019-11-19 20:59:35,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:59:35,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-11-19 20:59:35,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:35,880 INFO L225 Difference]: With dead ends: 1118 [2019-11-19 20:59:35,880 INFO L226 Difference]: Without dead ends: 838 [2019-11-19 20:59:35,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:59:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-19 20:59:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-11-19 20:59:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-19 20:59:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1138 transitions. [2019-11-19 20:59:35,926 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1138 transitions. Word has length 131 [2019-11-19 20:59:35,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:35,927 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1138 transitions. [2019-11-19 20:59:35,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:59:35,928 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1138 transitions. [2019-11-19 20:59:35,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-19 20:59:35,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:35,937 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 20:59:35,937 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:35,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:35,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1097584517, now seen corresponding path program 1 times [2019-11-19 20:59:35,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:35,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708016715] [2019-11-19 20:59:35,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:36,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708016715] [2019-11-19 20:59:36,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:59:36,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:59:36,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492745919] [2019-11-19 20:59:36,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:59:36,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:36,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:59:36,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:59:36,094 INFO L87 Difference]: Start difference. First operand 838 states and 1138 transitions. Second operand 4 states. [2019-11-19 20:59:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:37,189 INFO L93 Difference]: Finished difference Result 1952 states and 2682 transitions. [2019-11-19 20:59:37,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:59:37,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-19 20:59:37,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:37,195 INFO L225 Difference]: With dead ends: 1952 [2019-11-19 20:59:37,196 INFO L226 Difference]: Without dead ends: 1116 [2019-11-19 20:59:37,197 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-19 20:59:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-11-19 20:59:37,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2019-11-19 20:59:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2019-11-19 20:59:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1386 transitions. [2019-11-19 20:59:37,233 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1386 transitions. Word has length 142 [2019-11-19 20:59:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:37,233 INFO L462 AbstractCegarLoop]: Abstraction has 1116 states and 1386 transitions. [2019-11-19 20:59:37,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:59:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1386 transitions. [2019-11-19 20:59:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-19 20:59:37,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:37,247 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:59:37,247 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:37,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:37,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1600410530, now seen corresponding path program 1 times [2019-11-19 20:59:37,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:37,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703305636] [2019-11-19 20:59:37,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:37,413 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:37,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703305636] [2019-11-19 20:59:37,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:59:37,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:59:37,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239427872] [2019-11-19 20:59:37,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:59:37,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:37,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:59:37,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:59:37,415 INFO L87 Difference]: Start difference. First operand 1116 states and 1386 transitions. Second operand 4 states. [2019-11-19 20:59:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:38,488 INFO L93 Difference]: Finished difference Result 3759 states and 4676 transitions. [2019-11-19 20:59:38,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:59:38,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-19 20:59:38,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:38,507 INFO L225 Difference]: With dead ends: 3759 [2019-11-19 20:59:38,508 INFO L226 Difference]: Without dead ends: 2645 [2019-11-19 20:59:38,511 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-19 20:59:38,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2019-11-19 20:59:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 1672. [2019-11-19 20:59:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-19 20:59:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2043 transitions. [2019-11-19 20:59:38,574 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2043 transitions. Word has length 192 [2019-11-19 20:59:38,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:38,575 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 2043 transitions. [2019-11-19 20:59:38,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:59:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2043 transitions. [2019-11-19 20:59:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-19 20:59:38,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:38,580 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-19 20:59:38,581 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:38,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:38,581 INFO L82 PathProgramCache]: Analyzing trace with hash -354141657, now seen corresponding path program 1 times [2019-11-19 20:59:38,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:38,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178468999] [2019-11-19 20:59:38,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 67 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:38,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178468999] [2019-11-19 20:59:38,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894703683] [2019-11-19 20:59:38,876 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-19 20:59:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:38,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 20:59:39,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:59:39,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:39,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 20:59:39,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:39,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 20:59:39,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 20:59:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 127 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:39,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:59:39,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-11-19 20:59:39,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890804451] [2019-11-19 20:59:39,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 20:59:39,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:39,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 20:59:39,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-19 20:59:39,578 INFO L87 Difference]: Start difference. First operand 1672 states and 2043 transitions. Second operand 8 states. [2019-11-19 20:59:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:43,106 INFO L93 Difference]: Finished difference Result 4871 states and 5954 transitions. [2019-11-19 20:59:43,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 20:59:43,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-11-19 20:59:43,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:43,123 INFO L225 Difference]: With dead ends: 4871 [2019-11-19 20:59:43,123 INFO L226 Difference]: Without dead ends: 3201 [2019-11-19 20:59:43,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-11-19 20:59:43,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2019-11-19 20:59:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 1950. [2019-11-19 20:59:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-11-19 20:59:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2231 transitions. [2019-11-19 20:59:43,178 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2231 transitions. Word has length 213 [2019-11-19 20:59:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:43,179 INFO L462 AbstractCegarLoop]: Abstraction has 1950 states and 2231 transitions. [2019-11-19 20:59:43,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 20:59:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2231 transitions. [2019-11-19 20:59:43,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-19 20:59:43,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:43,183 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:59:43,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:59:43,389 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:43,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:43,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1412343006, now seen corresponding path program 1 times [2019-11-19 20:59:43,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:43,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153227354] [2019-11-19 20:59:43,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:43,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153227354] [2019-11-19 20:59:43,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:59:43,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 20:59:43,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127864946] [2019-11-19 20:59:43,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 20:59:43,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:43,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 20:59:43,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:59:43,564 INFO L87 Difference]: Start difference. First operand 1950 states and 2231 transitions. Second operand 5 states. [2019-11-19 20:59:44,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:44,934 INFO L93 Difference]: Finished difference Result 5427 states and 6240 transitions. [2019-11-19 20:59:44,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 20:59:44,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-11-19 20:59:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:44,947 INFO L225 Difference]: With dead ends: 5427 [2019-11-19 20:59:44,947 INFO L226 Difference]: Without dead ends: 1811 [2019-11-19 20:59:44,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:59:44,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2019-11-19 20:59:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1672. [2019-11-19 20:59:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-19 20:59:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1838 transitions. [2019-11-19 20:59:45,005 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1838 transitions. Word has length 217 [2019-11-19 20:59:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:45,005 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 1838 transitions. [2019-11-19 20:59:45,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 20:59:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1838 transitions. [2019-11-19 20:59:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-19 20:59:45,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:45,013 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-19 20:59:45,014 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:45,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:45,014 INFO L82 PathProgramCache]: Analyzing trace with hash -416019249, now seen corresponding path program 1 times [2019-11-19 20:59:45,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:45,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260665258] [2019-11-19 20:59:45,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-19 20:59:45,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260665258] [2019-11-19 20:59:45,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:59:45,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:59:45,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213336756] [2019-11-19 20:59:45,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 20:59:45,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:45,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 20:59:45,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:59:45,270 INFO L87 Difference]: Start difference. First operand 1672 states and 1838 transitions. Second operand 5 states. [2019-11-19 20:59:46,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:46,805 INFO L93 Difference]: Finished difference Result 4454 states and 4918 transitions. [2019-11-19 20:59:46,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 20:59:46,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-11-19 20:59:46,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:46,819 INFO L225 Difference]: With dead ends: 4454 [2019-11-19 20:59:46,820 INFO L226 Difference]: Without dead ends: 2784 [2019-11-19 20:59:46,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:59:46,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2019-11-19 20:59:46,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2228. [2019-11-19 20:59:46,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2019-11-19 20:59:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2439 transitions. [2019-11-19 20:59:46,880 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2439 transitions. Word has length 230 [2019-11-19 20:59:46,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:46,881 INFO L462 AbstractCegarLoop]: Abstraction has 2228 states and 2439 transitions. [2019-11-19 20:59:46,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 20:59:46,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2439 transitions. [2019-11-19 20:59:46,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-11-19 20:59:46,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:46,891 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:59:46,891 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:46,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:46,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1031491534, now seen corresponding path program 1 times [2019-11-19 20:59:46,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:46,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252811229] [2019-11-19 20:59:46,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 253 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 20:59:48,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252811229] [2019-11-19 20:59:48,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271432480] [2019-11-19 20:59:48,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:59:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:48,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 20:59:48,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:59:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 317 proven. 34 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-19 20:59:48,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:59:48,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4] total 12 [2019-11-19 20:59:48,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996931267] [2019-11-19 20:59:48,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 20:59:48,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:48,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 20:59:48,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-19 20:59:48,826 INFO L87 Difference]: Start difference. First operand 2228 states and 2439 transitions. Second operand 13 states. [2019-11-19 20:59:51,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:51,346 INFO L93 Difference]: Finished difference Result 4791 states and 5270 transitions. [2019-11-19 20:59:51,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 20:59:51,346 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 341 [2019-11-19 20:59:51,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:51,363 INFO L225 Difference]: With dead ends: 4791 [2019-11-19 20:59:51,363 INFO L226 Difference]: Without dead ends: 2704 [2019-11-19 20:59:51,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 341 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-11-19 20:59:51,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2019-11-19 20:59:51,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2506. [2019-11-19 20:59:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2019-11-19 20:59:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2711 transitions. [2019-11-19 20:59:51,447 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2711 transitions. Word has length 341 [2019-11-19 20:59:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:51,448 INFO L462 AbstractCegarLoop]: Abstraction has 2506 states and 2711 transitions. [2019-11-19 20:59:51,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 20:59:51,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2711 transitions. [2019-11-19 20:59:51,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-11-19 20:59:51,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:51,467 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:59:51,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:59:51,682 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:51,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:51,683 INFO L82 PathProgramCache]: Analyzing trace with hash 352328165, now seen corresponding path program 1 times [2019-11-19 20:59:51,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:51,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584287741] [2019-11-19 20:59:51,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 89 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:52,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584287741] [2019-11-19 20:59:52,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635666308] [2019-11-19 20:59:52,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:59:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:52,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 20:59:52,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:59:52,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:52,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:52,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:52,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:52,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:52,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:52,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:52,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:53,517 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 330 proven. 62 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-19 20:59:53,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:59:53,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2019-11-19 20:59:53,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244799405] [2019-11-19 20:59:53,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 20:59:53,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:53,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 20:59:53,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-19 20:59:53,521 INFO L87 Difference]: Start difference. First operand 2506 states and 2711 transitions. Second operand 11 states. [2019-11-19 20:59:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:56,850 INFO L93 Difference]: Finished difference Result 6539 states and 7075 transitions. [2019-11-19 20:59:56,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 20:59:56,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 363 [2019-11-19 20:59:56,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:56,867 INFO L225 Difference]: With dead ends: 6539 [2019-11-19 20:59:56,867 INFO L226 Difference]: Without dead ends: 4174 [2019-11-19 20:59:56,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 360 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-19 20:59:56,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4174 states. [2019-11-19 20:59:56,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4174 to 2784. [2019-11-19 20:59:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2784 states. [2019-11-19 20:59:56,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 2978 transitions. [2019-11-19 20:59:56,935 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 2978 transitions. Word has length 363 [2019-11-19 20:59:56,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:56,936 INFO L462 AbstractCegarLoop]: Abstraction has 2784 states and 2978 transitions. [2019-11-19 20:59:56,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 20:59:56,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 2978 transitions. [2019-11-19 20:59:56,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-11-19 20:59:56,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:56,946 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:59:57,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:59:57,151 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:57,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:57,152 INFO L82 PathProgramCache]: Analyzing trace with hash -127843405, now seen corresponding path program 1 times [2019-11-19 20:59:57,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:57,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010038009] [2019-11-19 20:59:57,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 42 proven. 351 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-19 20:59:58,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010038009] [2019-11-19 20:59:58,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566632126] [2019-11-19 20:59:58,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:59:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:58,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 20:59:58,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:59:58,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:58,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:58,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 20:59:58,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:58,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:58,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:58,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:58,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:58,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 12 proven. 381 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-19 20:59:59,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:59:59,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2019-11-19 20:59:59,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110801279] [2019-11-19 20:59:59,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 20:59:59,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:59,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 20:59:59,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-19 20:59:59,579 INFO L87 Difference]: Start difference. First operand 2784 states and 2978 transitions. Second operand 12 states. [2019-11-19 21:00:05,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:00:05,317 INFO L93 Difference]: Finished difference Result 6833 states and 7328 transitions. [2019-11-19 21:00:05,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 21:00:05,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 382 [2019-11-19 21:00:05,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:00:05,332 INFO L225 Difference]: With dead ends: 6833 [2019-11-19 21:00:05,333 INFO L226 Difference]: Without dead ends: 4190 [2019-11-19 21:00:05,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 377 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-11-19 21:00:05,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2019-11-19 21:00:05,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 2708. [2019-11-19 21:00:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2708 states. [2019-11-19 21:00:05,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 2893 transitions. [2019-11-19 21:00:05,397 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 2893 transitions. Word has length 382 [2019-11-19 21:00:05,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:00:05,398 INFO L462 AbstractCegarLoop]: Abstraction has 2708 states and 2893 transitions. [2019-11-19 21:00:05,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 21:00:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 2893 transitions. [2019-11-19 21:00:05,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2019-11-19 21:00:05,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:00:05,417 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:00:05,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:00:05,621 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:00:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:00:05,622 INFO L82 PathProgramCache]: Analyzing trace with hash 318816942, now seen corresponding path program 1 times [2019-11-19 21:00:05,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:00:05,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646961942] [2019-11-19 21:00:05,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:00:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:00:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 632 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-11-19 21:00:06,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646961942] [2019-11-19 21:00:06,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:00:06,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:00:06,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417787966] [2019-11-19 21:00:06,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:00:06,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:00:06,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:00:06,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:00:06,112 INFO L87 Difference]: Start difference. First operand 2708 states and 2893 transitions. Second operand 5 states. [2019-11-19 21:00:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:00:07,683 INFO L93 Difference]: Finished difference Result 6107 states and 6523 transitions. [2019-11-19 21:00:07,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:00:07,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 581 [2019-11-19 21:00:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:00:07,685 INFO L225 Difference]: With dead ends: 6107 [2019-11-19 21:00:07,685 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 21:00:07,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:00:07,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 21:00:07,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 21:00:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 21:00:07,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 21:00:07,691 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 581 [2019-11-19 21:00:07,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:00:07,692 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 21:00:07,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:00:07,692 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 21:00:07,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 21:00:07,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 21:00:08,237 WARN L191 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 328 DAG size of output: 280 [2019-11-19 21:00:08,814 WARN L191 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 322 DAG size of output: 276 [2019-11-19 21:00:10,415 WARN L191 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 271 DAG size of output: 47 [2019-11-19 21:00:11,861 WARN L191 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 269 DAG size of output: 43 [2019-11-19 21:00:11,877 INFO L444 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-11-19 21:00:11,877 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,877 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,878 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,878 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,878 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,878 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,878 INFO L444 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-11-19 21:00:11,878 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-11-19 21:00:11,878 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-19 21:00:11,878 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-19 21:00:11,878 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-19 21:00:11,878 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-19 21:00:11,879 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-19 21:00:11,879 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-19 21:00:11,879 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-11-19 21:00:11,879 INFO L444 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-11-19 21:00:11,879 INFO L444 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-11-19 21:00:11,879 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,879 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,879 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,879 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,879 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,879 INFO L444 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-11-19 21:00:11,880 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-11-19 21:00:11,881 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-11-19 21:00:11,881 INFO L444 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-11-19 21:00:11,881 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-19 21:00:11,881 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-19 21:00:11,881 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-19 21:00:11,881 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-19 21:00:11,881 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-19 21:00:11,882 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-11-19 21:00:11,882 INFO L444 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-11-19 21:00:11,882 INFO L444 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-11-19 21:00:11,882 INFO L444 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-11-19 21:00:11,882 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-11-19 21:00:11,883 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,883 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,883 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,883 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,883 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,883 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-11-19 21:00:11,883 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-19 21:00:11,884 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-19 21:00:11,884 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-19 21:00:11,884 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-19 21:00:11,884 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-19 21:00:11,884 INFO L440 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse1 (= 14 ~a4~0)) (.cse4 (= ~a12~0 0)) (.cse2 (= ~a10~0 0)) (.cse0 (<= 0 (+ ~a1~0 600000))) (.cse3 (= 9 ~a19~0))) (or (and .cse0 (and .cse1 (and (not .cse2) .cse3) .cse4)) (and .cse1 .cse4 (= ~a10~0 2) .cse3) (and .cse1 .cse4 (or (not (= 5 ULTIMATE.start_calculate_output_~input)) (< 218 ~a1~0)) .cse2 (< 0 (+ ~a1~0 13))) (and .cse0 (<= ~a10~0 2) (not .cse3)) (and (<= ~a19~0 8) (not (= 1 ~a10~0))))) [2019-11-19 21:00:11,885 INFO L444 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-11-19 21:00:11,885 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-11-19 21:00:11,885 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-11-19 21:00:11,885 INFO L444 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-11-19 21:00:11,885 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,885 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,886 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,886 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,886 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,886 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-11-19 21:00:11,886 INFO L444 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-11-19 21:00:11,886 INFO L444 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-11-19 21:00:11,887 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-19 21:00:11,887 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-19 21:00:11,887 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-19 21:00:11,887 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-19 21:00:11,887 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-19 21:00:11,887 INFO L444 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-11-19 21:00:11,888 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-11-19 21:00:11,888 INFO L447 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-11-19 21:00:11,888 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-11-19 21:00:11,888 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-11-19 21:00:11,888 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-11-19 21:00:11,889 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,889 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,889 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,889 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,889 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,889 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-19 21:00:11,890 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-19 21:00:11,890 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-19 21:00:11,890 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-19 21:00:11,890 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-19 21:00:11,890 INFO L444 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-11-19 21:00:11,890 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-11-19 21:00:11,890 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-11-19 21:00:11,891 INFO L444 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-11-19 21:00:11,891 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,891 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,891 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,891 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,891 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,892 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-11-19 21:00:11,892 INFO L444 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-11-19 21:00:11,892 INFO L444 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-11-19 21:00:11,892 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-11-19 21:00:11,892 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-19 21:00:11,892 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-19 21:00:11,893 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-19 21:00:11,893 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-19 21:00:11,893 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-19 21:00:11,893 INFO L444 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-11-19 21:00:11,893 INFO L444 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-11-19 21:00:11,893 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 21:00:11,893 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-11-19 21:00:11,894 INFO L440 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse1 (= 14 ~a4~0)) (.cse4 (= ~a12~0 0)) (.cse2 (= ~a10~0 0)) (.cse0 (<= 0 (+ ~a1~0 600000))) (.cse5 (<= ~a10~0 2)) (.cse3 (= 9 ~a19~0))) (or (and .cse0 (and .cse1 (and (not .cse2) .cse3) .cse4)) (and .cse1 .cse4 (= ~a10~0 2) .cse3) (and (<= 23 ~a1~0) (<= ~a1~0 23) .cse1 .cse5 .cse4) (and .cse1 .cse4 (or (not (= 5 ULTIMATE.start_calculate_output_~input)) (< 218 ~a1~0)) .cse2 (< 0 (+ ~a1~0 13))) (and .cse0 .cse5 (not .cse3)) (and (<= ~a19~0 8) (not (= 1 ~a10~0))))) [2019-11-19 21:00:11,894 INFO L444 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-11-19 21:00:11,894 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,894 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,894 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,894 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,894 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-19 21:00:11,895 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,895 INFO L444 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,895 INFO L444 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-11-19 21:00:11,895 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-11-19 21:00:11,895 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-11-19 21:00:11,895 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-19 21:00:11,895 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-19 21:00:11,895 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-19 21:00:11,895 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-19 21:00:11,895 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-19 21:00:11,895 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-19 21:00:11,895 INFO L444 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-11-19 21:00:11,896 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-11-19 21:00:11,896 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-11-19 21:00:11,896 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-11-19 21:00:11,896 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,896 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,896 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,896 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,896 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,896 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,896 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-11-19 21:00:11,896 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-11-19 21:00:11,896 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-11-19 21:00:11,897 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 21:00:11,897 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-19 21:00:11,897 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-19 21:00:11,897 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-19 21:00:11,897 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-19 21:00:11,897 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-19 21:00:11,897 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-19 21:00:11,897 INFO L444 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-11-19 21:00:11,897 INFO L444 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-11-19 21:00:11,897 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-11-19 21:00:11,897 INFO L444 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-11-19 21:00:11,897 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-11-19 21:00:11,898 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-11-19 21:00:11,898 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,898 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,898 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,898 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,898 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,898 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,898 INFO L444 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-11-19 21:00:11,898 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-19 21:00:11,898 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-19 21:00:11,898 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-19 21:00:11,899 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-19 21:00:11,899 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-19 21:00:11,899 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 21:00:11,899 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-19 21:00:11,899 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-11-19 21:00:11,899 INFO L444 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-11-19 21:00:11,899 INFO L444 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-11-19 21:00:11,899 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-11-19 21:00:11,899 INFO L444 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-11-19 21:00:11,899 INFO L444 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-11-19 21:00:11,900 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,900 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,900 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,900 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,900 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,900 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,900 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-11-19 21:00:11,900 INFO L444 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-11-19 21:00:11,900 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-11-19 21:00:11,900 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-19 21:00:11,901 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-19 21:00:11,901 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-19 21:00:11,901 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-19 21:00:11,901 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-19 21:00:11,901 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-19 21:00:11,901 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-11-19 21:00:11,901 INFO L444 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-11-19 21:00:11,901 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 21:00:11,901 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 199) no Hoare annotation was computed. [2019-11-19 21:00:11,902 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-11-19 21:00:11,902 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,902 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,902 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,902 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,902 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,902 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 21:00:11,902 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-11-19 21:00:11,902 INFO L444 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-11-19 21:00:11,902 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-11-19 21:00:11,903 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-19 21:00:11,903 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-19 21:00:11,903 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-19 21:00:11,903 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-19 21:00:11,903 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-19 21:00:11,903 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-19 21:00:11,903 INFO L444 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-11-19 21:00:11,903 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-11-19 21:00:11,903 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-11-19 21:00:11,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:00:11 BoogieIcfgContainer [2019-11-19 21:00:11,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:00:11,932 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:00:11,933 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:00:11,936 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:00:11,936 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:59:32" (3/4) ... [2019-11-19 21:00:11,942 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 21:00:11,980 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 21:00:11,981 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 21:00:12,199 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:00:12,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:00:12,201 INFO L168 Benchmark]: Toolchain (without parser) took 42525.81 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 827.3 MB). Free memory was 946.9 MB in the beginning and 1.0 GB in the end (delta: -85.0 MB). Peak memory consumption was 742.3 MB. Max. memory is 11.5 GB. [2019-11-19 21:00:12,201 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:00:12,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2019-11-19 21:00:12,202 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.43 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-19 21:00:12,203 INFO L168 Benchmark]: Boogie Preprocessor took 109.39 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-19 21:00:12,203 INFO L168 Benchmark]: RCFGBuilder took 1477.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.7 MB). Peak memory consumption was 110.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:00:12,204 INFO L168 Benchmark]: TraceAbstraction took 39772.94 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 674.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -41.3 MB). Peak memory consumption was 633.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:00:12,204 INFO L168 Benchmark]: Witness Printer took 266.72 ms. Allocated memory is still 1.9 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:00:12,206 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 758.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 134.43 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 109.39 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. * RCFGBuilder took 1477.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.7 MB). Peak memory consumption was 110.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39772.94 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 674.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -41.3 MB). Peak memory consumption was 633.4 MB. Max. memory is 11.5 GB. * Witness Printer took 266.72 ms. Allocated memory is still 1.9 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 199]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: (((((0 <= a1 + 600000 && (14 == a4 && !(a10 == 0) && 9 == a19) && a12 == 0) || (((14 == a4 && a12 == 0) && a10 == 2) && 9 == a19)) || ((((23 <= a1 && a1 <= 23) && 14 == a4) && a10 <= 2) && a12 == 0)) || ((((14 == a4 && a12 == 0) && (!(5 == input) || 218 < a1)) && a10 == 0) && 0 < a1 + 13)) || ((0 <= a1 + 600000 && a10 <= 2) && !(9 == a19))) || (a19 <= 8 && !(1 == a10)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((0 <= a1 + 600000 && (14 == a4 && !(a10 == 0) && 9 == a19) && a12 == 0) || (((14 == a4 && a12 == 0) && a10 == 2) && 9 == a19)) || ((((14 == a4 && a12 == 0) && (!(5 == input) || 218 < a1)) && a10 == 0) && 0 < a1 + 13)) || ((0 <= a1 + 600000 && a10 <= 2) && !(9 == a19))) || (a19 <= 8 && !(1 == a10)) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Result: SAFE, OverallTime: 39.6s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 24.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.1s, HoareTripleCheckerStatistics: 666 SDtfs, 7177 SDslu, 293 SDs, 0 SdLazy, 15601 SolverSat, 2270 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 19.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1392 GetRequests, 1304 SyntacticMatches, 14 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2784occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 6128 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 82 NumberOfFragments, 175 HoareAnnotationTreeSize, 3 FomulaSimplifications, 24380 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 70361 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 4156 NumberOfCodeBlocks, 4156 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4141 ConstructedInterpolants, 313 QuantifiedInterpolants, 11281016 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1717 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 3296/4841 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...