java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label49.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:48:07,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:48:07,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:48:07,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:48:07,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:48:07,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:48:07,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:48:07,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:48:07,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:48:07,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:48:07,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:48:07,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:48:07,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:48:07,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:48:07,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:48:07,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:48:07,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:48:07,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:48:07,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:48:07,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:48:07,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:48:07,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:48:07,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:48:07,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:48:07,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:48:07,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:48:07,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:48:07,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:48:07,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:48:07,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:48:07,479 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:48:07,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:48:07,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:48:07,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:48:07,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:48:07,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:48:07,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:48:07,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:48:07,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:48:07,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:48:07,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:48:07,506 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 00:48:07,530 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:48:07,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:48:07,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:48:07,533 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:48:07,533 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:48:07,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:48:07,534 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:48:07,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:48:07,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:48:07,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:48:07,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:48:07,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:48:07,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:48:07,536 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:48:07,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:48:07,537 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:48:07,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:48:07,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:48:07,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:48:07,537 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:48:07,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:48:07,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:48:07,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:48:07,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:48:07,539 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:48:07,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:48:07,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:48:07,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:48:07,539 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:48:07,568 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:48:07,584 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:48:07,587 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:48:07,589 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:48:07,589 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:48:07,590 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label49.c [2019-10-02 00:48:07,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b5dd7e3e/829ef9996e7a451b9b9e42724a9cf38d/FLAG1aa89274d [2019-10-02 00:48:08,265 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:48:08,266 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label49.c [2019-10-02 00:48:08,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b5dd7e3e/829ef9996e7a451b9b9e42724a9cf38d/FLAG1aa89274d [2019-10-02 00:48:08,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b5dd7e3e/829ef9996e7a451b9b9e42724a9cf38d [2019-10-02 00:48:08,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:48:08,558 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:48:08,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:48:08,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:48:08,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:48:08,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:48:08" (1/1) ... [2019-10-02 00:48:08,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6509102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:08, skipping insertion in model container [2019-10-02 00:48:08,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:48:08" (1/1) ... [2019-10-02 00:48:08,575 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:48:08,622 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:48:09,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:48:09,140 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:48:09,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:48:09,269 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:48:09,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:09 WrapperNode [2019-10-02 00:48:09,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:48:09,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:48:09,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:48:09,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:48:09,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:09" (1/1) ... [2019-10-02 00:48:09,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:09" (1/1) ... [2019-10-02 00:48:09,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:09" (1/1) ... [2019-10-02 00:48:09,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:09" (1/1) ... [2019-10-02 00:48:09,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:09" (1/1) ... [2019-10-02 00:48:09,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:09" (1/1) ... [2019-10-02 00:48:09,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:09" (1/1) ... [2019-10-02 00:48:09,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:48:09,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:48:09,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:48:09,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:48:09,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48: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 [2019-10-02 00:48:09,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:48:09,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:48:09,446 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 00:48:09,446 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:48:09,446 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 00:48:09,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:48:09,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:48:09,447 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 00:48:09,447 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:48:09,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:48:09,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:48:10,627 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:48:10,628 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 00:48:10,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:48:10 BoogieIcfgContainer [2019-10-02 00:48:10,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:48:10,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:48:10,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:48:10,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:48:10,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:48:08" (1/3) ... [2019-10-02 00:48:10,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17dcb773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:48:10, skipping insertion in model container [2019-10-02 00:48:10,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:09" (2/3) ... [2019-10-02 00:48:10,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17dcb773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:48:10, skipping insertion in model container [2019-10-02 00:48:10,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:48:10" (3/3) ... [2019-10-02 00:48:10,639 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label49.c [2019-10-02 00:48:10,650 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:48:10,660 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:48:10,682 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:48:10,721 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:48:10,722 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:48:10,723 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:48:10,723 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:48:10,723 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:48:10,724 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:48:10,724 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:48:10,724 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:48:10,724 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:48:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 00:48:10,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-02 00:48:10,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:10,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:48:10,771 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:10,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:10,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2010725689, now seen corresponding path program 1 times [2019-10-02 00:48:10,781 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:10,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:10,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:10,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:10,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:11,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:11,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:48:11,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:48:11,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:48:11,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:48:11,427 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 00:48:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:12,412 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2019-10-02 00:48:12,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:48:12,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-10-02 00:48:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:12,447 INFO L225 Difference]: With dead ends: 618 [2019-10-02 00:48:12,448 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:48:12,457 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:48:12,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:48:12,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:48:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:48:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-02 00:48:12,540 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 131 [2019-10-02 00:48:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:12,542 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-02 00:48:12,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:48:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-02 00:48:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 00:48:12,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:12,548 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:48:12,549 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:12,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:12,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2056186306, now seen corresponding path program 1 times [2019-10-02 00:48:12,550 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:12,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:12,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:12,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:12,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:12,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:12,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:12,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:12,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:12,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:12,914 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-02 00:48:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:13,578 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2019-10-02 00:48:13,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:13,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-10-02 00:48:13,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:13,587 INFO L225 Difference]: With dead ends: 721 [2019-10-02 00:48:13,587 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:48:13,589 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:13,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:48:13,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:48:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:48:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-02 00:48:13,613 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 139 [2019-10-02 00:48:13,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:13,613 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-02 00:48:13,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:13,614 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-02 00:48:13,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 00:48:13,616 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:13,616 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:48:13,617 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:13,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:13,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1041677834, now seen corresponding path program 1 times [2019-10-02 00:48:13,617 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:13,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:13,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:13,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:13,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:13,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:13,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:13,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:13,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:13,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:13,947 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-02 00:48:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:14,670 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2019-10-02 00:48:14,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:14,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-10-02 00:48:14,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:14,674 INFO L225 Difference]: With dead ends: 717 [2019-10-02 00:48:14,674 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:48:14,676 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:14,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:48:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:48:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:48:14,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-02 00:48:14,696 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 145 [2019-10-02 00:48:14,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:14,696 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-02 00:48:14,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-02 00:48:14,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 00:48:14,699 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:14,699 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:48:14,700 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:14,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:14,700 INFO L82 PathProgramCache]: Analyzing trace with hash -33342687, now seen corresponding path program 1 times [2019-10-02 00:48:14,700 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:14,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:14,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:14,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:14,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:14,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:14,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:48:14,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:48:14,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:48:14,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:48:14,817 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-02 00:48:15,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:15,597 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2019-10-02 00:48:15,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:48:15,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-10-02 00:48:15,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:15,602 INFO L225 Difference]: With dead ends: 951 [2019-10-02 00:48:15,602 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 00:48:15,604 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 00:48:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 00:48:15,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-02 00:48:15,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:48:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 870 transitions. [2019-10-02 00:48:15,635 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 870 transitions. Word has length 153 [2019-10-02 00:48:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:15,636 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 870 transitions. [2019-10-02 00:48:15,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:48:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 870 transitions. [2019-10-02 00:48:15,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 00:48:15,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:15,640 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:48:15,640 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:15,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:15,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1756128357, now seen corresponding path program 1 times [2019-10-02 00:48:15,641 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:15,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:15,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:15,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:15,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:15,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:15,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:15,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:15,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:15,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:15,871 INFO L87 Difference]: Start difference. First operand 626 states and 870 transitions. Second operand 5 states. [2019-10-02 00:48:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:16,546 INFO L93 Difference]: Finished difference Result 1330 states and 1901 transitions. [2019-10-02 00:48:16,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:16,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-10-02 00:48:16,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:16,550 INFO L225 Difference]: With dead ends: 1330 [2019-10-02 00:48:16,551 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 00:48:16,553 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:16,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 00:48:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 00:48:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:48:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 858 transitions. [2019-10-02 00:48:16,574 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 858 transitions. Word has length 155 [2019-10-02 00:48:16,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:16,574 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 858 transitions. [2019-10-02 00:48:16,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 858 transitions. [2019-10-02 00:48:16,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 00:48:16,579 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:16,579 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:48:16,579 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:16,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:16,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1935651415, now seen corresponding path program 1 times [2019-10-02 00:48:16,580 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:16,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:16,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:16,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:16,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:16,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:16,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:16,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:16,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:16,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:16,784 INFO L87 Difference]: Start difference. First operand 626 states and 858 transitions. Second operand 5 states. [2019-10-02 00:48:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:17,444 INFO L93 Difference]: Finished difference Result 1332 states and 1876 transitions. [2019-10-02 00:48:17,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:17,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-02 00:48:17,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:17,449 INFO L225 Difference]: With dead ends: 1332 [2019-10-02 00:48:17,449 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 00:48:17,451 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:17,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 00:48:17,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 00:48:17,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:48:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 842 transitions. [2019-10-02 00:48:17,471 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 842 transitions. Word has length 157 [2019-10-02 00:48:17,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:17,471 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 842 transitions. [2019-10-02 00:48:17,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:17,471 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 842 transitions. [2019-10-02 00:48:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 00:48:17,474 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:17,475 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:48:17,475 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:17,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:17,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1918345167, now seen corresponding path program 1 times [2019-10-02 00:48:17,475 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:17,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:17,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:17,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:17,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:17,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:17,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:48:17,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:48:17,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:48:17,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:48:17,559 INFO L87 Difference]: Start difference. First operand 626 states and 842 transitions. Second operand 6 states. [2019-10-02 00:48:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:18,373 INFO L93 Difference]: Finished difference Result 1858 states and 2598 transitions. [2019-10-02 00:48:18,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:48:18,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-10-02 00:48:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:18,385 INFO L225 Difference]: With dead ends: 1858 [2019-10-02 00:48:18,385 INFO L226 Difference]: Without dead ends: 1238 [2019-10-02 00:48:18,387 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 00:48:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-02 00:48:18,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-02 00:48:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 00:48:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1635 transitions. [2019-10-02 00:48:18,442 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1635 transitions. Word has length 161 [2019-10-02 00:48:18,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:18,442 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1635 transitions. [2019-10-02 00:48:18,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:48:18,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1635 transitions. [2019-10-02 00:48:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 00:48:18,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:18,448 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:48:18,448 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:18,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:18,449 INFO L82 PathProgramCache]: Analyzing trace with hash 264500657, now seen corresponding path program 1 times [2019-10-02 00:48:18,449 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:18,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:18,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:18,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:18,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:18,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:48:18,573 INFO L224 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 [2019-10-02 00:48:18,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:18,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:48:18,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:48:18,845 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 00:48:18,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 00:48:18,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 00:48:18,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 00:48:18,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 00:48:18,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 00:48:18,853 INFO L87 Difference]: Start difference. First operand 1218 states and 1635 transitions. Second operand 7 states. [2019-10-02 00:48:20,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:20,581 INFO L93 Difference]: Finished difference Result 3651 states and 5065 transitions. [2019-10-02 00:48:20,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 00:48:20,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 195 [2019-10-02 00:48:20,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:20,590 INFO L225 Difference]: With dead ends: 3651 [2019-10-02 00:48:20,591 INFO L226 Difference]: Without dead ends: 1542 [2019-10-02 00:48:20,597 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-10-02 00:48:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-10-02 00:48:20,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1518. [2019-10-02 00:48:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1518 states. [2019-10-02 00:48:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1898 transitions. [2019-10-02 00:48:20,642 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1898 transitions. Word has length 195 [2019-10-02 00:48:20,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:20,642 INFO L475 AbstractCegarLoop]: Abstraction has 1518 states and 1898 transitions. [2019-10-02 00:48:20,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 00:48:20,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1898 transitions. [2019-10-02 00:48:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-02 00:48:20,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:20,650 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:48:20,650 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:20,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:20,650 INFO L82 PathProgramCache]: Analyzing trace with hash -153281421, now seen corresponding path program 1 times [2019-10-02 00:48:20,651 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:20,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:20,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:20,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:20,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 139 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:20,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:48:20,850 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 00:48:20,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:48:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:20,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:48:20,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:48:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 153 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 00:48:21,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:48:21,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-10-02 00:48:21,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 00:48:21,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 00:48:21,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-10-02 00:48:21,080 INFO L87 Difference]: Start difference. First operand 1518 states and 1898 transitions. Second operand 14 states. [2019-10-02 00:48:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:23,313 INFO L93 Difference]: Finished difference Result 3186 states and 3998 transitions. [2019-10-02 00:48:23,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 00:48:23,314 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 246 [2019-10-02 00:48:23,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:23,315 INFO L225 Difference]: With dead ends: 3186 [2019-10-02 00:48:23,315 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 00:48:23,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2019-10-02 00:48:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 00:48:23,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 00:48:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 00:48:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 00:48:23,323 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2019-10-02 00:48:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:23,324 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 00:48:23,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 00:48:23,324 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 00:48:23,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 00:48:23,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 00:48:23,646 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-10-02 00:48:24,495 WARN L191 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-10-02 00:48:24,847 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-10-02 00:48:25,219 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-10-02 00:48:25,222 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:48:25,222 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2019-10-02 00:48:25,222 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:48:25,222 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,223 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,223 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,223 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,223 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,223 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-02 00:48:25,223 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-02 00:48:25,224 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-10-02 00:48:25,224 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-10-02 00:48:25,224 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-10-02 00:48:25,224 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-10-02 00:48:25,224 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-10-02 00:48:25,224 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-02 00:48:25,224 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-02 00:48:25,224 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-02 00:48:25,225 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-10-02 00:48:25,225 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-10-02 00:48:25,225 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-02 00:48:25,225 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,225 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,225 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,225 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,225 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-02 00:48:25,226 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,226 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-02 00:48:25,226 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-10-02 00:48:25,226 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-10-02 00:48:25,226 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-10-02 00:48:25,226 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-10-02 00:48:25,226 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-10-02 00:48:25,226 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-02 00:48:25,227 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-10-02 00:48:25,227 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-10-02 00:48:25,227 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-02 00:48:25,227 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-02 00:48:25,227 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-02 00:48:25,227 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-02 00:48:25,227 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-10-02 00:48:25,228 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-02 00:48:25,228 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,228 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,228 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,228 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,228 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,229 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-10-02 00:48:25,229 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-02 00:48:25,229 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-10-02 00:48:25,229 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-10-02 00:48:25,229 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-10-02 00:48:25,229 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-10-02 00:48:25,229 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-10-02 00:48:25,229 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-10-02 00:48:25,230 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-02 00:48:25,230 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-02 00:48:25,230 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-02 00:48:25,230 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,230 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,230 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,230 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,231 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,231 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-02 00:48:25,231 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-02 00:48:25,231 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-02 00:48:25,231 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-10-02 00:48:25,231 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-10-02 00:48:25,231 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-10-02 00:48:25,232 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-10-02 00:48:25,232 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-10-02 00:48:25,232 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-02 00:48:25,232 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-02 00:48:25,232 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-02 00:48:25,232 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-02 00:48:25,232 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-02 00:48:25,232 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,233 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,233 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,233 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,233 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,233 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-02 00:48:25,233 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-10-02 00:48:25,233 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-10-02 00:48:25,233 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-10-02 00:48:25,234 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-10-02 00:48:25,234 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-10-02 00:48:25,234 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-02 00:48:25,234 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-02 00:48:25,234 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-02 00:48:25,234 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-02 00:48:25,234 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-02 00:48:25,235 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-02 00:48:25,235 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-02 00:48:25,235 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-10-02 00:48:25,235 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-02 00:48:25,235 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-10-02 00:48:25,235 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,235 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,235 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,235 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,236 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-10-02 00:48:25,236 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,236 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-10-02 00:48:25,236 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,236 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-10-02 00:48:25,236 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-10-02 00:48:25,236 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-10-02 00:48:25,237 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,237 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,237 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-10-02 00:48:25,237 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-10-02 00:48:25,237 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-10-02 00:48:25,237 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-10-02 00:48:25,237 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-10-02 00:48:25,237 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-10-02 00:48:25,238 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-02 00:48:25,238 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-02 00:48:25,238 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-02 00:48:25,238 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-02 00:48:25,238 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-02 00:48:25,238 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,238 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,239 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,239 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,239 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,239 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,239 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-02 00:48:25,239 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-10-02 00:48:25,239 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-10-02 00:48:25,239 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-10-02 00:48:25,239 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-10-02 00:48:25,239 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-10-02 00:48:25,239 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-10-02 00:48:25,240 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-02 00:48:25,240 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-02 00:48:25,240 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-02 00:48:25,240 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-02 00:48:25,240 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,240 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,240 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,241 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,241 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,241 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,241 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-02 00:48:25,241 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-02 00:48:25,241 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-02 00:48:25,241 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-10-02 00:48:25,242 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-10-02 00:48:25,242 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-10-02 00:48:25,242 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-10-02 00:48:25,242 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-10-02 00:48:25,242 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-10-02 00:48:25,242 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-02 00:48:25,242 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-02 00:48:25,242 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-02 00:48:25,243 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-02 00:48:25,243 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-02 00:48:25,243 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,243 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,243 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,244 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse14 (= 1 |old(~a19~0)|)) (.cse1 (= 1 |old(~a11~0)|)) (.cse6 (= 1 |old(~a25~0)|)) (.cse7 (not (= 1 ~a11~0))) (.cse15 (= ~a17~0 |old(~a17~0)|)) (.cse16 (= ~a19~0 |old(~a19~0)|)) (.cse17 (= ~a28~0 |old(~a28~0)|)) (.cse18 (= ~a25~0 |old(~a25~0)|))) (let ((.cse3 (and .cse7 .cse15 .cse16 .cse17 .cse18)) (.cse12 (not (= 7 |old(~a28~0)|))) (.cse5 (= 9 |old(~a28~0)|)) (.cse9 (not .cse6)) (.cse11 (not .cse1)) (.cse10 (= ~a11~0 1)) (.cse8 (not (<= |old(~a17~0)| 7))) (.cse0 (not (= 1 ~a21~0))) (.cse2 (not .cse14)) (.cse13 (= 8 |old(~a28~0)|)) (.cse4 (not (= 8 |old(~a17~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse3 .cse5 .cse4 .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse5 .cse8) (or .cse0 .cse9 .cse2 .cse4 .cse10 (not .cse5) .cse11) (or .cse0 .cse12 .cse9 .cse2 (and (= ~a17~0 7) .cse10) .cse11 (not (= 7 |old(~a17~0)|))) (or .cse0 .cse1 .cse13 .cse5 .cse4 .cse3) (or .cse0 .cse1 .cse7 .cse8 .cse6) (or .cse14 .cse0 .cse12 (and (not (= ~a19~0 1)) (not (= ~a25~0 1)) (= ~a17~0 8) (= ~a28~0 7) .cse10) .cse4 .cse11 .cse6) (or .cse0 .cse1 .cse2 .cse13 .cse15 .cse5 (not (<= |old(~a17~0)| 8)) .cse6) (or .cse0 (not (= 10 |old(~a28~0)|)) .cse9 .cse2 .cse4 .cse11 .cse10) (or .cse0 (and (<= ~a17~0 7) .cse16 .cse17 .cse18) .cse8) (or .cse0 .cse2 (and .cse15 .cse16 .cse17 .cse18) .cse13 .cse4)))) [2019-10-02 00:48:25,244 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,244 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,244 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,244 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-02 00:48:25,244 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-02 00:48:25,244 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-02 00:48:25,244 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 547) no Hoare annotation was computed. [2019-10-02 00:48:25,244 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-10-02 00:48:25,245 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-10-02 00:48:25,245 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-10-02 00:48:25,245 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-10-02 00:48:25,245 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-10-02 00:48:25,245 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-10-02 00:48:25,245 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-02 00:48:25,248 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-02 00:48:25,249 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-02 00:48:25,249 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-02 00:48:25,249 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,249 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,249 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,249 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,249 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,249 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,249 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-02 00:48:25,249 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-02 00:48:25,249 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-10-02 00:48:25,249 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-10-02 00:48:25,250 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-10-02 00:48:25,250 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-10-02 00:48:25,250 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-10-02 00:48:25,250 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-10-02 00:48:25,250 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-02 00:48:25,250 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-02 00:48:25,250 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-02 00:48:25,250 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-10-02 00:48:25,250 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-10-02 00:48:25,250 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-02 00:48:25,250 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-02 00:48:25,251 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-10-02 00:48:25,251 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,251 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,251 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,251 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,251 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:25,251 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-02 00:48:25,251 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-02 00:48:25,251 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-02 00:48:25,251 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-02 00:48:25,251 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-10-02 00:48:25,251 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-10-02 00:48:25,251 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-10-02 00:48:25,252 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-10-02 00:48:25,252 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-10-02 00:48:25,252 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-10-02 00:48:25,252 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-02 00:48:25,252 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-10-02 00:48:25,252 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-02 00:48:25,252 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-10-02 00:48:25,252 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-02 00:48:25,252 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-10-02 00:48:25,253 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-10-02 00:48:25,253 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-02 00:48:25,253 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-02 00:48:25,253 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:48:25,253 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 1 ~a11~0)) (not (= ~a25~0 1)) (not (= ~a28~0 8)) (= ~a19~0 1) (= ~a21~0 1) (<= ~a17~0 8) (not (= ~a28~0 9))) [2019-10-02 00:48:25,253 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 00:48:25,254 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:48:25,254 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (= 1 |old(~a11~0)|) (not (= 1 |old(~a19~0)|)) (= 8 |old(~a28~0)|) (and (not (= 1 ~a11~0)) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (= 9 |old(~a28~0)|) (not (<= |old(~a17~0)| 8)) (= 1 |old(~a25~0)|)) [2019-10-02 00:48:25,254 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse8 (= ~a28~0 9)) (.cse9 (= ~a25~0 1))) (let ((.cse2 (not (= ~a28~0 8))) (.cse0 (not (= 1 ~a11~0))) (.cse1 (= ~a17~0 |old(~a17~0)|)) (.cse5 (not .cse9)) (.cse3 (not .cse8)) (.cse6 (= ~a17~0 8)) (.cse4 (= ~a19~0 1)) (.cse7 (= ~a11~0 1))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4) (and (not .cse4) .cse5 .cse6 (= ~a28~0 7) .cse7) (= 9 |old(~a28~0)|) (and .cse8 .cse6 .cse4 .cse9 .cse7) (<= ~a17~0 7) (= 1 |old(~a25~0)|) (and .cse1 .cse2 .cse4) (= 1 |old(~a11~0)|) (and .cse0 .cse1 .cse5 .cse3) (not (= 1 |old(~a19~0)|)) (= 8 |old(~a28~0)|) (and (= ~a28~0 10) .cse6 .cse4 .cse9 .cse7) (not (<= |old(~a17~0)| 8))))) [2019-10-02 00:48:25,254 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-10-02 00:48:25,254 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-10-02 00:48:25,255 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse8 (= ~a28~0 9)) (.cse9 (= ~a25~0 1))) (let ((.cse2 (not (= ~a28~0 8))) (.cse0 (not (= 1 ~a11~0))) (.cse1 (= ~a17~0 |old(~a17~0)|)) (.cse5 (not .cse9)) (.cse3 (not .cse8)) (.cse6 (= ~a17~0 8)) (.cse4 (= ~a19~0 1)) (.cse7 (= ~a11~0 1))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4) (and (not .cse4) .cse5 .cse6 (= ~a28~0 7) .cse7) (= 9 |old(~a28~0)|) (and .cse8 .cse6 .cse4 .cse9 .cse7) (<= ~a17~0 7) (= 1 |old(~a25~0)|) (and .cse1 .cse2 .cse4) (= 1 |old(~a11~0)|) (and .cse0 .cse1 .cse5 .cse3) (not (= 1 |old(~a19~0)|)) (= 8 |old(~a28~0)|) (and (= ~a28~0 10) .cse6 .cse4 .cse9 .cse7) (not (<= |old(~a17~0)| 8))))) [2019-10-02 00:48:25,255 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-10-02 00:48:25,255 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-02 00:48:25,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:48:25 BoogieIcfgContainer [2019-10-02 00:48:25,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 00:48:25,278 INFO L168 Benchmark]: Toolchain (without parser) took 16719.65 ms. Allocated memory was 133.2 MB in the beginning and 470.3 MB in the end (delta: 337.1 MB). Free memory was 85.9 MB in the beginning and 174.0 MB in the end (delta: -88.1 MB). Peak memory consumption was 350.5 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:25,279 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 00:48:25,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.58 ms. Allocated memory was 133.2 MB in the beginning and 200.8 MB in the end (delta: 67.6 MB). Free memory was 85.7 MB in the beginning and 159.3 MB in the end (delta: -73.6 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:25,281 INFO L168 Benchmark]: Boogie Preprocessor took 109.43 ms. Allocated memory is still 200.8 MB. Free memory was 159.3 MB in the beginning and 154.5 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:25,282 INFO L168 Benchmark]: RCFGBuilder took 1248.90 ms. Allocated memory was 200.8 MB in the beginning and 226.0 MB in the end (delta: 25.2 MB). Free memory was 154.5 MB in the beginning and 169.3 MB in the end (delta: -14.9 MB). Peak memory consumption was 83.5 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:25,283 INFO L168 Benchmark]: TraceAbstraction took 14645.57 ms. Allocated memory was 226.0 MB in the beginning and 470.3 MB in the end (delta: 244.3 MB). Free memory was 169.3 MB in the beginning and 174.0 MB in the end (delta: -4.7 MB). Peak memory consumption was 341.2 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:25,287 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 711.58 ms. Allocated memory was 133.2 MB in the beginning and 200.8 MB in the end (delta: 67.6 MB). Free memory was 85.7 MB in the beginning and 159.3 MB in the end (delta: -73.6 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.43 ms. Allocated memory is still 200.8 MB. Free memory was 159.3 MB in the beginning and 154.5 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1248.90 ms. Allocated memory was 200.8 MB in the beginning and 226.0 MB in the end (delta: 25.2 MB). Free memory was 154.5 MB in the beginning and 169.3 MB in the end (delta: -14.9 MB). Peak memory consumption was 83.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14645.57 ms. Allocated memory was 226.0 MB in the beginning and 470.3 MB in the end (delta: 244.3 MB). Free memory was 169.3 MB in the beginning and 174.0 MB in the end (delta: -4.7 MB). Peak memory consumption was 341.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 547]: 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: 606]: Loop Invariant Derived loop invariant: (((((((((((((!(1 == a21) || (((!(1 == a11) && a17 == \old(a17)) && !(a28 == 8)) && !(a28 == 9))) || ((!(1 == a11) && a17 == \old(a17)) && a19 == 1)) || ((((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && a28 == 7) && a11 == 1)) || 9 == \old(a28)) || ((((a28 == 9 && a17 == 8) && a19 == 1) && a25 == 1) && a11 == 1)) || a17 <= 7) || 1 == \old(a25)) || ((a17 == \old(a17) && !(a28 == 8)) && a19 == 1)) || 1 == \old(a11)) || (((!(1 == a11) && a17 == \old(a17)) && !(a25 == 1)) && !(a28 == 9))) || !(1 == \old(a19))) || 8 == \old(a28)) || ((((a28 == 10 && a17 == 8) && a19 == 1) && a25 == 1) && a11 == 1)) || !(\old(a17) <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. SAFE Result, 14.5s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 9.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 537 SDtfs, 5605 SDslu, 532 SDs, 0 SdLazy, 7246 SolverSat, 1196 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 549 GetRequests, 484 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1518occurred 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 55 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 71 PreInvPairs, 127 NumberOfFragments, 700 HoareAnnotationTreeSize, 71 FomulaSimplifications, 2676 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1186 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1923 NumberOfCodeBlocks, 1923 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1912 ConstructedInterpolants, 0 QuantifiedInterpolants, 1549323 SizeOfPredicates, 2 NumberOfNonLiveVariables, 998 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 582/612 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...