./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label01_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem01_label01_true-unreach-call_false-termination.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 dab50d57c53f23a15c1109c01d840c6793808077 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 19:37:07,304 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 19:37:07,306 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 19:37:07,324 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 19:37:07,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 19:37:07,326 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 19:37:07,330 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 19:37:07,332 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 19:37:07,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 19:37:07,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 19:37:07,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 19:37:07,336 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 19:37:07,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 19:37:07,337 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 19:37:07,339 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 19:37:07,339 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 19:37:07,340 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 19:37:07,342 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 19:37:07,344 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 19:37:07,346 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 19:37:07,347 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 19:37:07,348 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 19:37:07,351 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 19:37:07,351 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 19:37:07,352 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 19:37:07,353 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 19:37:07,354 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 19:37:07,355 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 19:37:07,356 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 19:37:07,358 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 19:37:07,358 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 19:37:07,359 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 19:37:07,359 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 19:37:07,359 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 19:37:07,363 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 19:37:07,364 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 19:37:07,365 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 19:37:07,394 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 19:37:07,395 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 19:37:07,397 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 19:37:07,400 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 19:37:07,400 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 19:37:07,400 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 19:37:07,401 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 19:37:07,401 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 19:37:07,402 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 19:37:07,402 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 19:37:07,402 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 19:37:07,402 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 19:37:07,402 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 19:37:07,403 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 19:37:07,403 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 19:37:07,403 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 19:37:07,403 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 19:37:07,403 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 19:37:07,403 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 19:37:07,405 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 19:37:07,405 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 19:37:07,405 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 19:37:07,408 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 19:37:07,408 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 19:37:07,408 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 19:37:07,408 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 19:37:07,409 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 19:37:07,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 19:37:07,410 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dab50d57c53f23a15c1109c01d840c6793808077 [2018-12-30 19:37:07,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 19:37:07,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 19:37:07,487 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 19:37:07,489 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 19:37:07,490 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 19:37:07,491 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label01_true-unreach-call_false-termination.c [2018-12-30 19:37:07,555 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe66fca0/7fea072a771346e797eda8c7bc8a286e/FLAGc21f784fc [2018-12-30 19:37:08,099 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 19:37:08,100 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label01_true-unreach-call_false-termination.c [2018-12-30 19:37:08,112 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe66fca0/7fea072a771346e797eda8c7bc8a286e/FLAGc21f784fc [2018-12-30 19:37:08,374 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe66fca0/7fea072a771346e797eda8c7bc8a286e [2018-12-30 19:37:08,378 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 19:37:08,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 19:37:08,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 19:37:08,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 19:37:08,390 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 19:37:08,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:37:08" (1/1) ... [2018-12-30 19:37:08,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2998007b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:37:08, skipping insertion in model container [2018-12-30 19:37:08,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:37:08" (1/1) ... [2018-12-30 19:37:08,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 19:37:08,475 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 19:37:08,978 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:37:08,984 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 19:37:09,152 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:37:09,179 INFO L195 MainTranslator]: Completed translation [2018-12-30 19:37:09,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:37:09 WrapperNode [2018-12-30 19:37:09,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 19:37:09,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 19:37:09,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 19:37:09,181 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 19:37:09,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:37:09" (1/1) ... [2018-12-30 19:37:09,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:37:09" (1/1) ... [2018-12-30 19:37:09,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 19:37:09,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 19:37:09,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 19:37:09,347 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 19:37:09,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:37:09" (1/1) ... [2018-12-30 19:37:09,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:37:09" (1/1) ... [2018-12-30 19:37:09,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:37:09" (1/1) ... [2018-12-30 19:37:09,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:37:09" (1/1) ... [2018-12-30 19:37:09,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:37:09" (1/1) ... [2018-12-30 19:37:09,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:37:09" (1/1) ... [2018-12-30 19:37:09,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:37:09" (1/1) ... [2018-12-30 19:37:09,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 19:37:09,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 19:37:09,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 19:37:09,446 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 19:37:09,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:37:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 19:37:09,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 19:37:09,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 19:37:12,490 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 19:37:12,491 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 19:37:12,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:37:12 BoogieIcfgContainer [2018-12-30 19:37:12,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 19:37:12,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 19:37:12,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 19:37:12,497 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 19:37:12,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 07:37:08" (1/3) ... [2018-12-30 19:37:12,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f25eb9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:37:12, skipping insertion in model container [2018-12-30 19:37:12,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:37:09" (2/3) ... [2018-12-30 19:37:12,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f25eb9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:37:12, skipping insertion in model container [2018-12-30 19:37:12,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:37:12" (3/3) ... [2018-12-30 19:37:12,502 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label01_true-unreach-call_false-termination.c [2018-12-30 19:37:12,513 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 19:37:12,522 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 19:37:12,539 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 19:37:12,577 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 19:37:12,578 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 19:37:12,578 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 19:37:12,578 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 19:37:12,579 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 19:37:12,579 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 19:37:12,579 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 19:37:12,579 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 19:37:12,579 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 19:37:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-12-30 19:37:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-30 19:37:12,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:37:12,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:37:12,619 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:37:12,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:37:12,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1687716446, now seen corresponding path program 1 times [2018-12-30 19:37:12,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:37:12,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:37:12,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:12,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:37:12,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:37:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:37:13,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:37:13,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:37:13,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:37:13,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:37:13,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:37:13,308 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2018-12-30 19:37:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:37:16,498 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2018-12-30 19:37:16,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:37:16,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-30 19:37:16,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:37:16,525 INFO L225 Difference]: With dead ends: 662 [2018-12-30 19:37:16,525 INFO L226 Difference]: Without dead ends: 397 [2018-12-30 19:37:16,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:37:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-12-30 19:37:16,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2018-12-30 19:37:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-12-30 19:37:16,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2018-12-30 19:37:16,638 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 91 [2018-12-30 19:37:16,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:37:16,638 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2018-12-30 19:37:16,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:37:16,639 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2018-12-30 19:37:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-30 19:37:16,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:37:16,644 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:37:16,644 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:37:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:37:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1583336838, now seen corresponding path program 1 times [2018-12-30 19:37:16,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:37:16,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:37:16,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:16,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:37:16,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:37:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:37:16,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:37:16,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:37:16,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:37:16,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:37:16,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:37:16,783 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2018-12-30 19:37:17,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:37:17,896 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2018-12-30 19:37:17,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:37:17,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-30 19:37:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:37:17,903 INFO L225 Difference]: With dead ends: 1185 [2018-12-30 19:37:17,904 INFO L226 Difference]: Without dead ends: 790 [2018-12-30 19:37:17,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:37:17,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-30 19:37:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2018-12-30 19:37:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-12-30 19:37:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2018-12-30 19:37:17,972 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 96 [2018-12-30 19:37:17,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:37:17,972 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2018-12-30 19:37:17,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:37:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2018-12-30 19:37:17,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-30 19:37:17,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:37:17,978 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:37:17,978 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:37:17,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:37:17,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1473567844, now seen corresponding path program 1 times [2018-12-30 19:37:17,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:37:17,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:37:17,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:17,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:37:17,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:37:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-30 19:37:18,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:37:18,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:37:18,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:37:18,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:37:18,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:37:18,122 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2018-12-30 19:37:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:37:19,334 INFO L93 Difference]: Finished difference Result 1971 states and 2686 transitions. [2018-12-30 19:37:19,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:37:19,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-12-30 19:37:19,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:37:19,342 INFO L225 Difference]: With dead ends: 1971 [2018-12-30 19:37:19,343 INFO L226 Difference]: Without dead ends: 1183 [2018-12-30 19:37:19,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:37:19,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2018-12-30 19:37:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 921. [2018-12-30 19:37:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2018-12-30 19:37:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2018-12-30 19:37:19,382 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 117 [2018-12-30 19:37:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:37:19,382 INFO L480 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2018-12-30 19:37:19,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:37:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2018-12-30 19:37:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-30 19:37:19,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:37:19,387 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:37:19,387 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:37:19,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:37:19,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1222693529, now seen corresponding path program 1 times [2018-12-30 19:37:19,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:37:19,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:37:19,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:19,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:37:19,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:37:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-30 19:37:19,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:37:19,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:37:19,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:37:19,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:37:19,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:37:19,553 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2018-12-30 19:37:21,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:37:21,546 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2018-12-30 19:37:21,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:37:21,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2018-12-30 19:37:21,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:37:21,555 INFO L225 Difference]: With dead ends: 2233 [2018-12-30 19:37:21,555 INFO L226 Difference]: Without dead ends: 1314 [2018-12-30 19:37:21,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:37:21,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2018-12-30 19:37:21,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2018-12-30 19:37:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2018-12-30 19:37:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1508 transitions. [2018-12-30 19:37:21,592 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1508 transitions. Word has length 153 [2018-12-30 19:37:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:37:21,592 INFO L480 AbstractCegarLoop]: Abstraction has 1183 states and 1508 transitions. [2018-12-30 19:37:21,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:37:21,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1508 transitions. [2018-12-30 19:37:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-30 19:37:21,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:37:21,598 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:37:21,598 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:37:21,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:37:21,599 INFO L82 PathProgramCache]: Analyzing trace with hash 160905897, now seen corresponding path program 1 times [2018-12-30 19:37:21,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:37:21,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:37:21,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:21,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:37:21,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:37:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-30 19:37:21,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:37:21,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:37:21,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:37:21,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:37:21,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:37:21,791 INFO L87 Difference]: Start difference. First operand 1183 states and 1508 transitions. Second operand 3 states. [2018-12-30 19:37:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:37:22,368 INFO L93 Difference]: Finished difference Result 3150 states and 4004 transitions. [2018-12-30 19:37:22,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:37:22,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-12-30 19:37:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:37:22,378 INFO L225 Difference]: With dead ends: 3150 [2018-12-30 19:37:22,379 INFO L226 Difference]: Without dead ends: 1969 [2018-12-30 19:37:22,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:37:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-12-30 19:37:22,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2018-12-30 19:37:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2018-12-30 19:37:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2134 transitions. [2018-12-30 19:37:22,419 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2134 transitions. Word has length 172 [2018-12-30 19:37:22,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:37:22,420 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 2134 transitions. [2018-12-30 19:37:22,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:37:22,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2134 transitions. [2018-12-30 19:37:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-30 19:37:22,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:37:22,425 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:37:22,425 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:37:22,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:37:22,425 INFO L82 PathProgramCache]: Analyzing trace with hash -645359518, now seen corresponding path program 1 times [2018-12-30 19:37:22,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:37:22,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:37:22,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:22,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:37:22,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:37:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-30 19:37:22,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:37:22,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:37:22,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:37:22,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:37:22,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:37:22,522 INFO L87 Difference]: Start difference. First operand 1707 states and 2134 transitions. Second operand 3 states. [2018-12-30 19:37:22,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:37:22,993 INFO L93 Difference]: Finished difference Result 3674 states and 4582 transitions. [2018-12-30 19:37:22,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:37:22,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-12-30 19:37:22,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:37:23,002 INFO L225 Difference]: With dead ends: 3674 [2018-12-30 19:37:23,003 INFO L226 Difference]: Without dead ends: 1969 [2018-12-30 19:37:23,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:37:23,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-12-30 19:37:23,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2018-12-30 19:37:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-12-30 19:37:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2408 transitions. [2018-12-30 19:37:23,049 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2408 transitions. Word has length 175 [2018-12-30 19:37:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:37:23,049 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2408 transitions. [2018-12-30 19:37:23,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:37:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2408 transitions. [2018-12-30 19:37:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-30 19:37:23,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:37:23,056 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:37:23,056 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:37:23,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:37:23,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1056675030, now seen corresponding path program 1 times [2018-12-30 19:37:23,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:37:23,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:37:23,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:23,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:37:23,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:37:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-30 19:37:23,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:37:23,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-30 19:37:23,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 19:37:23,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 19:37:23,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 19:37:23,329 INFO L87 Difference]: Start difference. First operand 1969 states and 2408 transitions. Second operand 8 states. [2018-12-30 19:37:24,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:37:24,667 INFO L93 Difference]: Finished difference Result 4106 states and 4990 transitions. [2018-12-30 19:37:24,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 19:37:24,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2018-12-30 19:37:24,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:37:24,678 INFO L225 Difference]: With dead ends: 4106 [2018-12-30 19:37:24,679 INFO L226 Difference]: Without dead ends: 2139 [2018-12-30 19:37:24,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 19:37:24,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2018-12-30 19:37:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1969. [2018-12-30 19:37:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-12-30 19:37:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2396 transitions. [2018-12-30 19:37:24,763 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2396 transitions. Word has length 179 [2018-12-30 19:37:24,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:37:24,764 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2396 transitions. [2018-12-30 19:37:24,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 19:37:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2396 transitions. [2018-12-30 19:37:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-30 19:37:24,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:37:24,772 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-12-30 19:37:24,772 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:37:24,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:37:24,773 INFO L82 PathProgramCache]: Analyzing trace with hash 916250074, now seen corresponding path program 1 times [2018-12-30 19:37:24,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:37:24,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:37:24,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:24,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:37:24,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:37:25,256 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-12-30 19:37:25,284 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-30 19:37:25,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:37:25,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:37:25,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:37:25,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:37:25,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:37:25,286 INFO L87 Difference]: Start difference. First operand 1969 states and 2396 transitions. Second operand 4 states. [2018-12-30 19:37:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:37:26,266 INFO L93 Difference]: Finished difference Result 4198 states and 5112 transitions. [2018-12-30 19:37:26,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:37:26,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2018-12-30 19:37:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:37:26,276 INFO L225 Difference]: With dead ends: 4198 [2018-12-30 19:37:26,276 INFO L226 Difference]: Without dead ends: 2231 [2018-12-30 19:37:26,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:37:26,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2018-12-30 19:37:26,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2100. [2018-12-30 19:37:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2018-12-30 19:37:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2461 transitions. [2018-12-30 19:37:26,319 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2461 transitions. Word has length 212 [2018-12-30 19:37:26,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:37:26,319 INFO L480 AbstractCegarLoop]: Abstraction has 2100 states and 2461 transitions. [2018-12-30 19:37:26,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:37:26,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2461 transitions. [2018-12-30 19:37:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-30 19:37:26,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:37:26,326 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:37:26,326 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:37:26,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:37:26,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1317230938, now seen corresponding path program 1 times [2018-12-30 19:37:26,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:37:26,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:37:26,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:26,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:37:26,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:37:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-30 19:37:26,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:37:26,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:37:26,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:37:26,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:37:26,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:37:26,608 INFO L87 Difference]: Start difference. First operand 2100 states and 2461 transitions. Second operand 4 states. [2018-12-30 19:37:30,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:37:30,302 INFO L93 Difference]: Finished difference Result 4722 states and 5498 transitions. [2018-12-30 19:37:30,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:37:30,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2018-12-30 19:37:30,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:37:30,317 INFO L225 Difference]: With dead ends: 4722 [2018-12-30 19:37:30,317 INFO L226 Difference]: Without dead ends: 2624 [2018-12-30 19:37:30,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:37:30,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2018-12-30 19:37:30,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1969. [2018-12-30 19:37:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-12-30 19:37:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2311 transitions. [2018-12-30 19:37:30,367 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2311 transitions. Word has length 238 [2018-12-30 19:37:30,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:37:30,367 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2311 transitions. [2018-12-30 19:37:30,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:37:30,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2311 transitions. [2018-12-30 19:37:30,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-12-30 19:37:30,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:37:30,376 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-30 19:37:30,377 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:37:30,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:37:30,377 INFO L82 PathProgramCache]: Analyzing trace with hash 503715675, now seen corresponding path program 1 times [2018-12-30 19:37:30,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:37:30,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:37:30,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:30,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:37:30,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:37:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-30 19:37:30,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:37:30,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 19:37:30,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 19:37:30,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 19:37:30,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 19:37:30,733 INFO L87 Difference]: Start difference. First operand 1969 states and 2311 transitions. Second operand 6 states. [2018-12-30 19:37:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:37:32,076 INFO L93 Difference]: Finished difference Result 4105 states and 4795 transitions. [2018-12-30 19:37:32,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:37:32,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2018-12-30 19:37:32,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:37:32,084 INFO L225 Difference]: With dead ends: 4105 [2018-12-30 19:37:32,084 INFO L226 Difference]: Without dead ends: 2138 [2018-12-30 19:37:32,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 19:37:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2018-12-30 19:37:32,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1838. [2018-12-30 19:37:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-12-30 19:37:32,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2102 transitions. [2018-12-30 19:37:32,123 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2102 transitions. Word has length 259 [2018-12-30 19:37:32,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:37:32,124 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2102 transitions. [2018-12-30 19:37:32,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 19:37:32,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2102 transitions. [2018-12-30 19:37:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-12-30 19:37:32,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:37:32,131 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:37:32,131 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:37:32,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:37:32,131 INFO L82 PathProgramCache]: Analyzing trace with hash 221877156, now seen corresponding path program 1 times [2018-12-30 19:37:32,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:37:32,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:37:32,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:32,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:37:32,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:37:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:37:32,753 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-12-30 19:37:32,995 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-12-30 19:37:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-12-30 19:37:33,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 19:37:33,511 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 19:37:33,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:37:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:37:33,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 19:37:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-12-30 19:37:33,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 19:37:33,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-12-30 19:37:33,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-30 19:37:33,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-30 19:37:33,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-12-30 19:37:33,961 INFO L87 Difference]: Start difference. First operand 1838 states and 2102 transitions. Second operand 14 states. [2018-12-30 19:37:37,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:37:37,394 INFO L93 Difference]: Finished difference Result 3589 states and 4108 transitions. [2018-12-30 19:37:37,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 19:37:37,395 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 281 [2018-12-30 19:37:37,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:37:37,396 INFO L225 Difference]: With dead ends: 3589 [2018-12-30 19:37:37,396 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 19:37:37,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2018-12-30 19:37:37,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 19:37:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 19:37:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 19:37:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 19:37:37,400 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2018-12-30 19:37:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:37:37,401 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 19:37:37,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-30 19:37:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 19:37:37,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 19:37:37,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 19:37:37,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:37:37,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:37:37,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:37:37,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:37:37,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:37:37,568 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 111 [2018-12-30 19:37:37,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:37:37,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:37:37,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:37:37,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:37:37,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:37:37,734 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 108 [2018-12-30 19:37:40,328 WARN L181 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 102 DAG size of output: 56 [2018-12-30 19:37:41,024 WARN L181 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2018-12-30 19:37:41,027 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-30 19:37:41,027 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-30 19:37:41,027 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,027 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,027 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,027 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,027 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,027 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,028 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-30 19:37:41,028 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-30 19:37:41,028 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-30 19:37:41,028 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-30 19:37:41,028 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-30 19:37:41,028 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-30 19:37:41,028 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-30 19:37:41,028 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-30 19:37:41,028 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-30 19:37:41,028 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-30 19:37:41,029 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,029 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,029 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,029 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,029 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,029 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,029 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-30 19:37:41,029 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-30 19:37:41,029 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-30 19:37:41,029 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-30 19:37:41,029 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-30 19:37:41,030 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-30 19:37:41,030 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-30 19:37:41,030 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-30 19:37:41,030 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-30 19:37:41,030 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-30 19:37:41,030 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-30 19:37:41,030 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-30 19:37:41,030 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-30 19:37:41,030 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-30 19:37:41,030 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-30 19:37:41,030 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,031 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,031 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,031 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,031 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,031 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-30 19:37:41,031 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-30 19:37:41,031 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-30 19:37:41,031 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-30 19:37:41,031 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-30 19:37:41,031 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-30 19:37:41,031 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-30 19:37:41,032 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-30 19:37:41,032 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-30 19:37:41,032 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse11 (= ~a16~0 6))) (let ((.cse0 (= ~a16~0 4)) (.cse5 (<= ~a21~0 0)) (.cse7 (= ~a8~0 13)) (.cse8 (<= ~a17~0 0)) (.cse6 (not .cse11)) (.cse2 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse9 (not .cse4)) (.cse12 (= ~a8~0 15)) (.cse3 (= ~a12~0 8)) (.cse1 (= ~a21~0 1))) (or (and (and .cse0 .cse1 (not .cse2)) .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse2 .cse3) (and (and .cse1 (= ~a16~0 5)) .cse3) (and .cse4 .cse5 .cse0 .cse7 .cse3 .cse8) (and .cse3 (and .cse9 .cse6 .cse2 .cse1)) (and .cse4 .cse5 .cse7 .cse3 .cse8 .cse10 .cse11 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6))) (and (or (and .cse2 (or (and .cse6 .cse1 .cse10) (and .cse12 .cse1 .cse10))) (and .cse9 .cse2 .cse1 .cse10)) .cse3) (and .cse9 .cse12 .cse3 .cse1 .cse11)))) [2018-12-30 19:37:41,032 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,033 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,033 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,033 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,033 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,033 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-30 19:37:41,033 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-30 19:37:41,033 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-30 19:37:41,033 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-30 19:37:41,033 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-30 19:37:41,033 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-30 19:37:41,034 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-30 19:37:41,034 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-30 19:37:41,034 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-30 19:37:41,034 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-30 19:37:41,034 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-30 19:37:41,034 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-30 19:37:41,034 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-30 19:37:41,034 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-12-30 19:37:41,063 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,063 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,063 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,063 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,063 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,063 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-30 19:37:41,063 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-30 19:37:41,063 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-30 19:37:41,065 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-30 19:37:41,065 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-30 19:37:41,065 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-30 19:37:41,065 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-30 19:37:41,065 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-30 19:37:41,065 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-30 19:37:41,065 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,065 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,065 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,066 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,066 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-30 19:37:41,066 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,066 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-30 19:37:41,066 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-30 19:37:41,066 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-30 19:37:41,066 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-30 19:37:41,066 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-30 19:37:41,066 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-30 19:37:41,066 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-30 19:37:41,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 19:37:41,067 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-30 19:37:41,067 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-30 19:37:41,067 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-30 19:37:41,067 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-30 19:37:41,067 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-30 19:37:41,067 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-30 19:37:41,067 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,068 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse11 (= ~a16~0 6))) (let ((.cse0 (= ~a16~0 4)) (.cse5 (<= ~a21~0 0)) (.cse7 (= ~a8~0 13)) (.cse8 (<= ~a17~0 0)) (.cse6 (not .cse11)) (.cse10 (= ~a20~0 1)) (.cse2 (= ~a17~0 1)) (.cse9 (not .cse4)) (.cse12 (= ~a8~0 15)) (.cse3 (= ~a12~0 8)) (.cse1 (= ~a21~0 1))) (or (and (and .cse0 .cse1 (not .cse2)) .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse2 .cse3) (and (and .cse1 (= ~a16~0 5)) .cse3) (and .cse4 .cse5 .cse0 .cse7 .cse3 .cse8) (and .cse3 (and .cse9 .cse6 .cse2 .cse1)) (and .cse4 .cse5 .cse7 .cse3 .cse8 .cse10 .cse11 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6))) (and (or (and .cse9 .cse2 .cse1 .cse10) (and (or (and .cse6 .cse1 .cse10) (and .cse12 .cse1 .cse10)) .cse2)) .cse3) (and .cse9 .cse12 .cse3 .cse1 .cse11)))) [2018-12-30 19:37:41,068 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,068 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,068 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,068 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,068 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-30 19:37:41,068 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-30 19:37:41,068 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-30 19:37:41,068 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-30 19:37:41,069 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-30 19:37:41,075 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-30 19:37:41,075 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-30 19:37:41,075 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 449) no Hoare annotation was computed. [2018-12-30 19:37:41,075 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-30 19:37:41,075 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,075 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,075 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,075 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,076 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,076 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-30 19:37:41,076 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 19:37:41,076 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-30 19:37:41,076 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-30 19:37:41,076 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-30 19:37:41,076 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-30 19:37:41,076 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-30 19:37:41,076 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-30 19:37:41,076 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-30 19:37:41,076 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-30 19:37:41,076 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-30 19:37:41,077 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-30 19:37:41,077 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-30 19:37:41,077 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,077 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,077 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,077 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,077 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-30 19:37:41,077 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,077 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,077 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-30 19:37:41,077 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-30 19:37:41,077 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 19:37:41,078 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-30 19:37:41,079 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-30 19:37:41,079 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-30 19:37:41,079 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-30 19:37:41,080 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-30 19:37:41,080 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-30 19:37:41,080 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-30 19:37:41,080 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-30 19:37:41,080 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-30 19:37:41,080 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-30 19:37:41,080 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,080 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,080 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,080 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,080 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,080 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-30 19:37:41,083 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,083 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-30 19:37:41,083 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-30 19:37:41,083 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-30 19:37:41,083 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-30 19:37:41,083 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-30 19:37:41,083 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-30 19:37:41,083 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-30 19:37:41,083 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-30 19:37:41,083 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-30 19:37:41,084 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-30 19:37:41,084 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-30 19:37:41,084 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 19:37:41,084 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-30 19:37:41,084 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-30 19:37:41,084 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-30 19:37:41,084 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,084 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,084 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,084 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,084 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,084 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:37:41,085 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-30 19:37:41,085 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-30 19:37:41,085 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-30 19:37:41,085 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-30 19:37:41,085 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-30 19:37:41,085 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-30 19:37:41,085 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-30 19:37:41,085 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-30 19:37:41,085 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-30 19:37:41,085 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-30 19:37:41,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 07:37:41 BoogieIcfgContainer [2018-12-30 19:37:41,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 19:37:41,122 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 19:37:41,122 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 19:37:41,122 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 19:37:41,123 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:37:12" (3/4) ... [2018-12-30 19:37:41,127 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 19:37:41,164 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 19:37:41,168 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 19:37:41,394 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 19:37:41,397 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 19:37:41,398 INFO L168 Benchmark]: Toolchain (without parser) took 33019.45 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 492.3 MB). Free memory was 947.3 MB in the beginning and 1.5 GB in the end (delta: -512.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 19:37:41,399 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 19:37:41,399 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.42 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 915.1 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-12-30 19:37:41,400 INFO L168 Benchmark]: Boogie Procedure Inliner took 165.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-12-30 19:37:41,400 INFO L168 Benchmark]: Boogie Preprocessor took 99.37 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-30 19:37:41,400 INFO L168 Benchmark]: RCFGBuilder took 3045.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.0 MB in the end (delta: 106.2 MB). Peak memory consumption was 106.2 MB. Max. memory is 11.5 GB. [2018-12-30 19:37:41,401 INFO L168 Benchmark]: TraceAbstraction took 28628.25 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 367.0 MB). Free memory was 999.0 MB in the beginning and 1.5 GB in the end (delta: -474.4 MB). Peak memory consumption was 476.4 MB. Max. memory is 11.5 GB. [2018-12-30 19:37:41,401 INFO L168 Benchmark]: Witness Printer took 275.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-30 19:37:41,404 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 799.42 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 915.1 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 165.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.37 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3045.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.0 MB in the end (delta: 106.2 MB). Peak memory consumption was 106.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28628.25 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 367.0 MB). Free memory was 999.0 MB in the beginning and 1.5 GB in the end (delta: -474.4 MB). Peak memory consumption was 476.4 MB. Max. memory is 11.5 GB. * Witness Printer took 275.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 449]: 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: 30]: Loop Invariant Derived loop invariant: (((((((((a16 == 4 && a21 == 1) && !(a17 == 1)) && a12 == 8) || (((((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a8 == 13) && a17 == 1) && a12 == 8)) || ((a21 == 1 && a16 == 5) && a12 == 8)) || (((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0)) || (a12 == 8 && ((!(a7 == 1) && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6) && ((((input == 2 || input == 4) || 1 == input) || 5 == input) || input == 6))) || (((a17 == 1 && (((!(a16 == 6) && a21 == 1) && a20 == 1) || ((a8 == 15 && a21 == 1) && a20 == 1))) || (((!(a7 == 1) && a17 == 1) && a21 == 1) && a20 == 1)) && a12 == 8)) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((a16 == 4 && a21 == 1) && !(a17 == 1)) && a12 == 8) || (((((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a8 == 13) && a17 == 1) && a12 == 8)) || ((a21 == 1 && a16 == 5) && a12 == 8)) || (((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0)) || (a12 == 8 && ((!(a7 == 1) && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6) && ((((input == 2 || input == 4) || 1 == input) || 5 == input) || input == 6))) || (((((!(a7 == 1) && a17 == 1) && a21 == 1) && a20 == 1) || ((((!(a16 == 6) && a21 == 1) && a20 == 1) || ((a8 == 15 && a21 == 1) && a20 == 1)) && a17 == 1)) && a12 == 8)) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 28.5s OverallTime, 11 OverallIterations, 7 TraceHistogramMax, 19.5s AutomataDifference, 0.0s DeadEndRemovalTime, 3.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 779 SDtfs, 2518 SDslu, 139 SDs, 0 SdLazy, 6918 SolverSat, 976 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 294 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2100occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 1911 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 34 NumberOfFragments, 371 HoareAnnotationTreeSize, 3 FomulaSimplifications, 7022 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2781 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2254 NumberOfCodeBlocks, 2254 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2242 ConstructedInterpolants, 0 QuantifiedInterpolants, 1614108 SizeOfPredicates, 1 NumberOfNonLiveVariables, 513 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2711/2719 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...