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_label56.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:48:33,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:48:33,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:48:33,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:48:33,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:48:33,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:48:33,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:48:33,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:48:33,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:48:33,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:48:33,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:48:33,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:48:33,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:48:33,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:48:33,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:48:33,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:48:33,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:48:33,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:48:33,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:48:33,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:48:33,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:48:33,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:48:33,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:48:33,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:48:33,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:48:33,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:48:33,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:48:33,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:48:33,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:48:33,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:48:33,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:48:33,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:48:33,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:48:33,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:48:33,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:48:33,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:48:33,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:48:33,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:48:33,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:48:33,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:48:33,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:48:33,423 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:33,438 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:48:33,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:48:33,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:48:33,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:48:33,440 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:48:33,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:48:33,440 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:48:33,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:48:33,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:48:33,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:48:33,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:48:33,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:48:33,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:48:33,442 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:48:33,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:48:33,442 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:48:33,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:48:33,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:48:33,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:48:33,443 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:48:33,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:48:33,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:48:33,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:48:33,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:48:33,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:48:33,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:48:33,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:48:33,444 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:48:33,444 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:48:33,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:48:33,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:48:33,489 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:48:33,490 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:48:33,491 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:48:33,491 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label56.c [2019-10-02 00:48:33,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc0808c29/895214a0f690485da4397334681cc2c0/FLAG3b1e01511 [2019-10-02 00:48:34,190 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:48:34,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label56.c [2019-10-02 00:48:34,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc0808c29/895214a0f690485da4397334681cc2c0/FLAG3b1e01511 [2019-10-02 00:48:34,482 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc0808c29/895214a0f690485da4397334681cc2c0 [2019-10-02 00:48:34,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:48:34,494 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:48:34,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:48:34,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:48:34,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:48:34,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:48:34" (1/1) ... [2019-10-02 00:48:34,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eab5cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:34, skipping insertion in model container [2019-10-02 00:48:34,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:48:34" (1/1) ... [2019-10-02 00:48:34,512 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:48:34,571 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:48:35,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:48:35,052 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:48:35,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:48:35,227 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:48:35,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:35 WrapperNode [2019-10-02 00:48:35,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:48:35,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:48:35,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:48:35,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:48:35,243 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:35" (1/1) ... [2019-10-02 00:48:35,244 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:35" (1/1) ... [2019-10-02 00:48:35,264 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:35" (1/1) ... [2019-10-02 00:48:35,265 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:35" (1/1) ... [2019-10-02 00:48:35,304 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:35" (1/1) ... [2019-10-02 00:48:35,320 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:35" (1/1) ... [2019-10-02 00:48:35,330 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:35" (1/1) ... [2019-10-02 00:48:35,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:48:35,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:48:35,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:48:35,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:48:35,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:35" (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:35,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:48:35,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:48:35,411 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 00:48:35,411 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:48:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 00:48:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:48:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:48:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 00:48:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:48:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:48:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:48:36,601 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:48:36,601 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 00:48:36,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:48:36 BoogieIcfgContainer [2019-10-02 00:48:36,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:48:36,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:48:36,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:48:36,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:48:36,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:48:34" (1/3) ... [2019-10-02 00:48:36,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f7ce7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:48:36, skipping insertion in model container [2019-10-02 00:48:36,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:35" (2/3) ... [2019-10-02 00:48:36,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f7ce7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:48:36, skipping insertion in model container [2019-10-02 00:48:36,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:48:36" (3/3) ... [2019-10-02 00:48:36,612 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label56.c [2019-10-02 00:48:36,622 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:48:36,630 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:48:36,647 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:48:36,681 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:48:36,682 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:48:36,682 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:48:36,682 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:48:36,683 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:48:36,683 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:48:36,683 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:48:36,683 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:48:36,684 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:48:36,718 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 00:48:36,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 00:48:36,741 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:36,743 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] [2019-10-02 00:48:36,745 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:36,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:36,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1821084561, now seen corresponding path program 1 times [2019-10-02 00:48:36,753 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:36,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:36,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:36,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:36,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:37,347 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:37,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:37,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:48:37,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:48:37,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:48:37,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:48:37,382 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 00:48:38,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:38,280 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2019-10-02 00:48:38,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:48:38,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-10-02 00:48:38,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:38,316 INFO L225 Difference]: With dead ends: 618 [2019-10-02 00:48:38,317 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:48:38,329 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:38,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:48:38,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:48:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:48:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-02 00:48:38,403 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 129 [2019-10-02 00:48:38,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:38,404 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-02 00:48:38,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:48:38,406 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-02 00:48:38,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 00:48:38,410 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:38,411 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] [2019-10-02 00:48:38,411 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:38,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:38,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2111824342, now seen corresponding path program 1 times [2019-10-02 00:48:38,412 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:38,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:38,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:38,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:38,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:38,793 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:38,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:38,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:38,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:38,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:38,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:38,796 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-02 00:48:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:39,473 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2019-10-02 00:48:39,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:39,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-10-02 00:48:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:39,482 INFO L225 Difference]: With dead ends: 721 [2019-10-02 00:48:39,482 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:48:39,484 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:39,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:48:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:48:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:48:39,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-02 00:48:39,521 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 137 [2019-10-02 00:48:39,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:39,521 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-02 00:48:39,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-02 00:48:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 00:48:39,525 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:39,525 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] [2019-10-02 00:48:39,526 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:39,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:39,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1931807906, now seen corresponding path program 1 times [2019-10-02 00:48:39,526 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:39,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:39,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:39,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:39,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:39,857 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:39,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:39,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:39,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:39,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:39,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:39,861 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-02 00:48:40,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:40,577 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2019-10-02 00:48:40,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:40,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-02 00:48:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:40,581 INFO L225 Difference]: With dead ends: 717 [2019-10-02 00:48:40,582 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:48:40,583 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:40,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:48:40,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:48:40,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:48:40,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-02 00:48:40,599 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 143 [2019-10-02 00:48:40,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:40,599 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-02 00:48:40,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:40,600 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-02 00:48:40,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-02 00:48:40,602 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:40,603 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] [2019-10-02 00:48:40,603 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:40,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:40,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1452547207, now seen corresponding path program 1 times [2019-10-02 00:48:40,603 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:40,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:40,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:40,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:40,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:40,696 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:40,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:40,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:48:40,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:48:40,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:48:40,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:48:40,698 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-02 00:48:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:41,561 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2019-10-02 00:48:41,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:48:41,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2019-10-02 00:48:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:41,566 INFO L225 Difference]: With dead ends: 951 [2019-10-02 00:48:41,566 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 00:48:41,567 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:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 00:48:41,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-02 00:48:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:48:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2019-10-02 00:48:41,601 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 151 [2019-10-02 00:48:41,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:41,601 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2019-10-02 00:48:41,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:48:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2019-10-02 00:48:41,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 00:48:41,605 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:41,605 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] [2019-10-02 00:48:41,605 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:41,606 INFO L82 PathProgramCache]: Analyzing trace with hash 337022397, now seen corresponding path program 1 times [2019-10-02 00:48:41,606 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:41,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:41,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:41,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:41,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:41,813 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:41,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:41,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:41,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:41,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:41,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:41,815 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand 5 states. [2019-10-02 00:48:42,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:42,452 INFO L93 Difference]: Finished difference Result 1330 states and 1903 transitions. [2019-10-02 00:48:42,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:42,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-02 00:48:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:42,457 INFO L225 Difference]: With dead ends: 1330 [2019-10-02 00:48:42,457 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 00:48:42,459 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:42,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 00:48:42,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 00:48:42,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:48:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 859 transitions. [2019-10-02 00:48:42,480 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 859 transitions. Word has length 153 [2019-10-02 00:48:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:42,480 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 859 transitions. [2019-10-02 00:48:42,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 859 transitions. [2019-10-02 00:48:42,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 00:48:42,483 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:42,484 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] [2019-10-02 00:48:42,484 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:42,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:42,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1950615551, now seen corresponding path program 1 times [2019-10-02 00:48:42,485 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:42,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:42,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:42,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:42,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:42,670 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:42,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:42,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:42,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:42,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:42,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:42,672 INFO L87 Difference]: Start difference. First operand 626 states and 859 transitions. Second operand 5 states. [2019-10-02 00:48:43,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:43,272 INFO L93 Difference]: Finished difference Result 1332 states and 1878 transitions. [2019-10-02 00:48:43,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:43,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-10-02 00:48:43,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:43,276 INFO L225 Difference]: With dead ends: 1332 [2019-10-02 00:48:43,277 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 00:48:43,279 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:43,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 00:48:43,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 00:48:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:48:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 843 transitions. [2019-10-02 00:48:43,303 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 843 transitions. Word has length 155 [2019-10-02 00:48:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:43,304 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 843 transitions. [2019-10-02 00:48:43,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 843 transitions. [2019-10-02 00:48:43,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 00:48:43,307 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:43,307 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] [2019-10-02 00:48:43,308 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:43,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:43,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2134314121, now seen corresponding path program 1 times [2019-10-02 00:48:43,308 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:43,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:43,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:43,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:43,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:43,424 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:43,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:43,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:48:43,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:48:43,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:48:43,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:48:43,430 INFO L87 Difference]: Start difference. First operand 626 states and 843 transitions. Second operand 6 states. [2019-10-02 00:48:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:44,294 INFO L93 Difference]: Finished difference Result 1858 states and 2601 transitions. [2019-10-02 00:48:44,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:48:44,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-10-02 00:48:44,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:44,307 INFO L225 Difference]: With dead ends: 1858 [2019-10-02 00:48:44,307 INFO L226 Difference]: Without dead ends: 1238 [2019-10-02 00:48:44,309 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:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-02 00:48:44,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-02 00:48:44,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 00:48:44,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1637 transitions. [2019-10-02 00:48:44,358 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1637 transitions. Word has length 159 [2019-10-02 00:48:44,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:44,358 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1637 transitions. [2019-10-02 00:48:44,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:48:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1637 transitions. [2019-10-02 00:48:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 00:48:44,363 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:44,363 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,364 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:44,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1429632528, now seen corresponding path program 1 times [2019-10-02 00:48:44,364 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:44,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:44,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:44,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:44,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:44,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:48:44,560 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:44,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:44,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:48:44,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:48:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 00:48:44,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 00:48:44,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-10-02 00:48:44,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 00:48:44,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 00:48:44,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-02 00:48:44,936 INFO L87 Difference]: Start difference. First operand 1218 states and 1637 transitions. Second operand 10 states. [2019-10-02 00:48:46,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:46,927 INFO L93 Difference]: Finished difference Result 3725 states and 5739 transitions. [2019-10-02 00:48:46,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 00:48:46,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 164 [2019-10-02 00:48:46,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:46,952 INFO L225 Difference]: With dead ends: 3725 [2019-10-02 00:48:46,952 INFO L226 Difference]: Without dead ends: 1749 [2019-10-02 00:48:46,960 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-10-02 00:48:46,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2019-10-02 00:48:47,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1732. [2019-10-02 00:48:47,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2019-10-02 00:48:47,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2603 transitions. [2019-10-02 00:48:47,062 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2603 transitions. Word has length 164 [2019-10-02 00:48:47,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:47,063 INFO L475 AbstractCegarLoop]: Abstraction has 1732 states and 2603 transitions. [2019-10-02 00:48:47,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 00:48:47,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2603 transitions. [2019-10-02 00:48:47,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 00:48:47,105 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:47,106 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,106 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:47,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:47,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1714787223, now seen corresponding path program 1 times [2019-10-02 00:48:47,106 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:47,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:47,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:47,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:47,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:47,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:48:47,221 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:47,244 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:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:47,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:48:47,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:48:47,392 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 00:48:47,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 00:48:47,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 00:48:47,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 00:48:47,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 00:48:47,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 00:48:47,398 INFO L87 Difference]: Start difference. First operand 1732 states and 2603 transitions. Second operand 7 states. [2019-10-02 00:48:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:48,667 INFO L93 Difference]: Finished difference Result 4590 states and 6581 transitions. [2019-10-02 00:48:48,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 00:48:48,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 196 [2019-10-02 00:48:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:48,680 INFO L225 Difference]: With dead ends: 4590 [2019-10-02 00:48:48,681 INFO L226 Difference]: Without dead ends: 2864 [2019-10-02 00:48:48,690 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 203 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:48,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2019-10-02 00:48:48,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2398. [2019-10-02 00:48:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2398 states. [2019-10-02 00:48:48,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 2924 transitions. [2019-10-02 00:48:48,776 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 2924 transitions. Word has length 196 [2019-10-02 00:48:48,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:48,776 INFO L475 AbstractCegarLoop]: Abstraction has 2398 states and 2924 transitions. [2019-10-02 00:48:48,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 00:48:48,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 2924 transitions. [2019-10-02 00:48:48,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 00:48:48,789 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:48,790 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] [2019-10-02 00:48:48,790 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:48,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:48,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1819152053, now seen corresponding path program 1 times [2019-10-02 00:48:48,790 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:48,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:48,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:49,020 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:49,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:48:49,021 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 00:48:49,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:48:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:49,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:48:49,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:48:49,223 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:49,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:48:49,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-10-02 00:48:49,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 00:48:49,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 00:48:49,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-10-02 00:48:49,237 INFO L87 Difference]: Start difference. First operand 2398 states and 2924 transitions. Second operand 14 states. [2019-10-02 00:48:51,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:51,374 INFO L93 Difference]: Finished difference Result 4496 states and 5406 transitions. [2019-10-02 00:48:51,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 00:48:51,381 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 244 [2019-10-02 00:48:51,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:51,381 INFO L225 Difference]: With dead ends: 4496 [2019-10-02 00:48:51,381 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 00:48:51,390 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2019-10-02 00:48:51,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 00:48:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 00:48:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 00:48:51,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 00:48:51,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2019-10-02 00:48:51,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:51,391 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 00:48:51,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 00:48:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 00:48:51,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 00:48:51,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 00:48:52,626 WARN L191 SmtUtils]: Spent 936.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 76 [2019-10-02 00:48:53,089 WARN L191 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-10-02 00:48:53,538 WARN L191 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-10-02 00:48:53,541 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:48:53,542 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:53,542 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:48:53,542 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,542 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,542 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,542 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,543 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,543 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-02 00:48:53,543 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-02 00:48:53,543 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-10-02 00:48:53,543 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-10-02 00:48:53,543 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-10-02 00:48:53,543 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-10-02 00:48:53,543 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-10-02 00:48:53,543 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-02 00:48:53,544 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-02 00:48:53,544 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-02 00:48:53,544 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-10-02 00:48:53,544 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-10-02 00:48:53,544 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-02 00:48:53,544 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,544 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,544 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,545 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,545 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-02 00:48:53,545 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,545 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-02 00:48:53,545 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-10-02 00:48:53,545 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-10-02 00:48:53,545 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-10-02 00:48:53,545 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-10-02 00:48:53,545 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-10-02 00:48:53,546 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-02 00:48:53,546 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-10-02 00:48:53,546 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-10-02 00:48:53,546 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-02 00:48:53,546 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-02 00:48:53,546 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-02 00:48:53,546 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-02 00:48:53,546 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-10-02 00:48:53,546 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-02 00:48:53,546 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,547 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,547 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,547 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,547 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,547 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-10-02 00:48:53,547 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-02 00:48:53,547 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-10-02 00:48:53,547 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-10-02 00:48:53,547 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-10-02 00:48:53,547 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-10-02 00:48:53,547 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-10-02 00:48:53,547 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-10-02 00:48:53,547 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-02 00:48:53,548 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-02 00:48:53,548 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-02 00:48:53,548 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,548 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,548 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,548 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,548 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,548 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-02 00:48:53,548 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-02 00:48:53,548 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-02 00:48:53,548 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-10-02 00:48:53,548 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-10-02 00:48:53,548 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-10-02 00:48:53,548 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-10-02 00:48:53,549 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-10-02 00:48:53,549 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-02 00:48:53,549 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-02 00:48:53,549 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-02 00:48:53,549 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-02 00:48:53,549 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-02 00:48:53,549 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,549 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,549 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,549 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,549 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,549 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-02 00:48:53,549 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-10-02 00:48:53,550 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-10-02 00:48:53,550 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-10-02 00:48:53,550 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-10-02 00:48:53,550 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-10-02 00:48:53,550 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-02 00:48:53,550 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-02 00:48:53,550 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-02 00:48:53,550 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-02 00:48:53,550 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-02 00:48:53,550 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-02 00:48:53,551 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-02 00:48:53,551 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-10-02 00:48:53,551 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-02 00:48:53,551 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-10-02 00:48:53,551 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,551 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,551 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,551 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,551 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-10-02 00:48:53,552 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,552 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-10-02 00:48:53,552 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,552 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-10-02 00:48:53,552 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-10-02 00:48:53,552 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-10-02 00:48:53,552 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,552 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,552 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-10-02 00:48:53,553 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-10-02 00:48:53,553 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-10-02 00:48:53,553 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-10-02 00:48:53,553 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-10-02 00:48:53,553 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-10-02 00:48:53,553 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-02 00:48:53,553 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-02 00:48:53,553 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-02 00:48:53,553 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-02 00:48:53,553 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-02 00:48:53,553 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,554 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,554 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,554 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,554 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,554 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,554 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-02 00:48:53,554 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-10-02 00:48:53,554 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-10-02 00:48:53,554 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-10-02 00:48:53,554 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-10-02 00:48:53,555 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-10-02 00:48:53,555 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-10-02 00:48:53,555 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-02 00:48:53,555 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-02 00:48:53,555 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-02 00:48:53,555 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-02 00:48:53,555 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,555 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,555 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,555 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,555 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,555 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,555 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-02 00:48:53,555 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-02 00:48:53,556 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-02 00:48:53,556 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-10-02 00:48:53,556 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-10-02 00:48:53,556 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-10-02 00:48:53,556 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-10-02 00:48:53,556 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-10-02 00:48:53,556 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-10-02 00:48:53,556 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-02 00:48:53,556 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-02 00:48:53,556 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-02 00:48:53,556 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-02 00:48:53,556 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-02 00:48:53,557 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,557 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,557 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,557 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse5 (= 1 |old(~a11~0)|)) (.cse21 (= 1 |old(~a19~0)|)) (.cse8 (= 1 |old(~a25~0)|)) (.cse9 (not (= 1 ~a11~0))) (.cse22 (= ~a17~0 |old(~a17~0)|)) (.cse24 (= ~a19~0 |old(~a19~0)|)) (.cse23 (= ~a28~0 |old(~a28~0)|)) (.cse18 (= ~a25~0 |old(~a25~0)|)) (.cse7 (= 9 |old(~a28~0)|))) (let ((.cse4 (not .cse7)) (.cse6 (and .cse9 .cse22 .cse24 .cse23 .cse18)) (.cse12 (not (<= |old(~a28~0)| 7))) (.cse1 (and .cse22 .cse24 .cse23 .cse18)) (.cse13 (not .cse8)) (.cse2 (not .cse21)) (.cse19 (not (= 7 |old(~a28~0)|))) (.cse16 (= ~a19~0 1)) (.cse15 (= ~a17~0 8)) (.cse20 (= ~a28~0 7)) (.cse17 (= ~a11~0 1)) (.cse3 (not (= 8 |old(~a17~0)|))) (.cse14 (not .cse5)) (.cse0 (not (= 1 ~a21~0))) (.cse10 (= |old(~a17~0)| |old(~a28~0)|)) (.cse11 (not (= 7 |old(~a17~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse5 .cse6 .cse7 .cse3 .cse8) (or .cse0 .cse5 .cse2 .cse6 .cse3) (or .cse0 .cse5 .cse9 .cse10 .cse8 .cse11) (or .cse6 (or .cse0 .cse12 .cse5 .cse2 .cse10) (not (<= |old(~a17~0)| 8))) (or .cse0 .cse5 .cse10 .cse7 .cse11 .cse9) (or .cse0 (not (= 10 |old(~a28~0)|)) .cse13 .cse2 .cse3 .cse14 (and (= ~a28~0 10) .cse15 .cse16 .cse17 .cse18)) (or .cse0 .cse13 .cse2 .cse3 .cse17 .cse4 .cse14) (or .cse0 .cse5 (= 8 |old(~a28~0)|) .cse7 .cse3 .cse6) (or .cse0 .cse12 .cse2 .cse1 .cse3) (or .cse0 .cse19 .cse13 .cse2 (and (= ~a17~0 7) .cse16 .cse20 .cse17 .cse18) .cse14 .cse11) (or .cse21 .cse0 .cse19 (and (not .cse16) (not (= ~a25~0 1)) .cse15 .cse20 .cse17) .cse3 .cse14 .cse8) (or .cse0 (and .cse22 .cse23 .cse18) .cse10 .cse11)))) [2019-10-02 00:48:53,557 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,558 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,558 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,558 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-02 00:48:53,558 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-02 00:48:53,558 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-02 00:48:53,558 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 541) no Hoare annotation was computed. [2019-10-02 00:48:53,558 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-10-02 00:48:53,558 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-10-02 00:48:53,559 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-10-02 00:48:53,559 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-10-02 00:48:53,559 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-10-02 00:48:53,559 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-10-02 00:48:53,559 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-02 00:48:53,559 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-02 00:48:53,559 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-02 00:48:53,559 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-02 00:48:53,559 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,560 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,560 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,560 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,560 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,560 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,560 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-02 00:48:53,560 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-02 00:48:53,560 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-10-02 00:48:53,560 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-10-02 00:48:53,560 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-10-02 00:48:53,561 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-10-02 00:48:53,561 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-10-02 00:48:53,561 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-10-02 00:48:53,561 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-02 00:48:53,561 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-02 00:48:53,561 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-02 00:48:53,561 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-10-02 00:48:53,561 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-10-02 00:48:53,561 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-02 00:48:53,562 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-02 00:48:53,562 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-10-02 00:48:53,562 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,562 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,562 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,562 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,562 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:53,562 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-02 00:48:53,562 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-02 00:48:53,562 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-02 00:48:53,563 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-02 00:48:53,563 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-10-02 00:48:53,563 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-10-02 00:48:53,563 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-10-02 00:48:53,563 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-10-02 00:48:53,563 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-10-02 00:48:53,563 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-10-02 00:48:53,563 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-02 00:48:53,563 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-10-02 00:48:53,564 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-02 00:48:53,564 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-10-02 00:48:53,564 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-02 00:48:53,564 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-10-02 00:48:53,564 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-10-02 00:48:53,564 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-02 00:48:53,564 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-02 00:48:53,564 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:48:53,564 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 1 ~a11~0)) (<= ~a28~0 7) (not (= ~a28~0 ~a17~0)) (not (= ~a25~0 1)) (= ~a19~0 1) (= ~a21~0 1) (<= ~a17~0 8)) [2019-10-02 00:48:53,565 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 00:48:53,565 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:48:53,565 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (<= |old(~a28~0)| 7)) (= 1 |old(~a11~0)|) (not (= 1 |old(~a19~0)|)) (= |old(~a17~0)| |old(~a28~0)|) (not (<= |old(~a17~0)| 8)) (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)|)) (= 1 |old(~a25~0)|)) [2019-10-02 00:48:53,565 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse10 (= ~a28~0 9)) (.cse13 (= ~a25~0 1))) (let ((.cse0 (not (= 1 ~a11~0))) (.cse11 (not (= ~a28~0 ~a17~0))) (.cse8 (= ~a28~0 7)) (.cse7 (= ~a17~0 8)) (.cse2 (not .cse13)) (.cse5 (not .cse10))) (let ((.cse12 (= ~a17~0 7)) (.cse14 (and .cse0 .cse11 (or (not .cse8) (not .cse7)) .cse2 (= ~a21~0 1) .cse5)) (.cse15 (= ~a19~0 |old(~a19~0)|)) (.cse16 (<= ~a28~0 7)) (.cse1 (= ~a17~0 |old(~a17~0)|)) (.cse3 (= 7 |old(~a28~0)|)) (.cse4 (= 8 |old(~a17~0)|)) (.cse6 (= ~a19~0 1)) (.cse9 (= ~a11~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 1 ~a21~0)) (not (<= |old(~a28~0)| 7)) (and (not .cse6) .cse2 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse3 .cse6 .cse4) (and .cse11 .cse12) (and .cse0 .cse1 .cse3 (not (= ~a28~0 8)) .cse4 .cse5) (and .cse10 .cse7 .cse6 .cse13 .cse9) (= 1 |old(~a25~0)|) (and .cse12 .cse6 .cse13 .cse9) (= 1 |old(~a11~0)|) (and .cse14 .cse1 .cse15 (= ~a28~0 |old(~a28~0)|)) (and .cse0 .cse1 .cse3 .cse6 .cse4) (not (= 1 |old(~a19~0)|)) (and .cse16 .cse14 .cse1 .cse15 .cse4) (= |old(~a17~0)| |old(~a28~0)|) (and .cse16 .cse1 .cse3 .cse6 .cse4) (and (= ~a28~0 10) .cse7 .cse6 .cse13 .cse9) (not (<= |old(~a17~0)| 8)))))) [2019-10-02 00:48:53,566 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-10-02 00:48:53,566 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-10-02 00:48:53,566 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse10 (= ~a28~0 9)) (.cse13 (= ~a25~0 1))) (let ((.cse0 (not (= 1 ~a11~0))) (.cse11 (not (= ~a28~0 ~a17~0))) (.cse8 (= ~a28~0 7)) (.cse7 (= ~a17~0 8)) (.cse2 (not .cse13)) (.cse5 (not .cse10))) (let ((.cse12 (= ~a17~0 7)) (.cse14 (and .cse0 .cse11 (or (not .cse8) (not .cse7)) .cse2 (= ~a21~0 1) .cse5)) (.cse15 (= ~a19~0 |old(~a19~0)|)) (.cse16 (<= ~a28~0 7)) (.cse1 (= ~a17~0 |old(~a17~0)|)) (.cse3 (= 7 |old(~a28~0)|)) (.cse4 (= 8 |old(~a17~0)|)) (.cse6 (= ~a19~0 1)) (.cse9 (= ~a11~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 1 ~a21~0)) (not (<= |old(~a28~0)| 7)) (and (not .cse6) .cse2 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse3 .cse6 .cse4) (and .cse11 .cse12) (and .cse0 .cse1 .cse3 (not (= ~a28~0 8)) .cse4 .cse5) (and .cse10 .cse7 .cse6 .cse13 .cse9) (= 1 |old(~a25~0)|) (and .cse12 .cse6 .cse13 .cse9) (= 1 |old(~a11~0)|) (and .cse14 .cse1 .cse15 (= ~a28~0 |old(~a28~0)|)) (and .cse0 .cse1 .cse3 .cse6 .cse4) (not (= 1 |old(~a19~0)|)) (and .cse16 .cse14 .cse1 .cse15 .cse4) (= |old(~a17~0)| |old(~a28~0)|) (and .cse16 .cse1 .cse3 .cse6 .cse4) (and (= ~a28~0 10) .cse7 .cse6 .cse13 .cse9) (not (<= |old(~a17~0)| 8)))))) [2019-10-02 00:48:53,566 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-10-02 00:48:53,566 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-02 00:48:53,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:48:53 BoogieIcfgContainer [2019-10-02 00:48:53,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 00:48:53,592 INFO L168 Benchmark]: Toolchain (without parser) took 19098.83 ms. Allocated memory was 138.9 MB in the beginning and 594.5 MB in the end (delta: 455.6 MB). Free memory was 85.2 MB in the beginning and 452.2 MB in the end (delta: -367.0 MB). Peak memory consumption was 402.3 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:53,593 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 105.0 MB in the beginning and 104.8 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:53,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.65 ms. Allocated memory was 138.9 MB in the beginning and 198.7 MB in the end (delta: 59.8 MB). Free memory was 85.0 MB in the beginning and 156.5 MB in the end (delta: -71.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:53,595 INFO L168 Benchmark]: Boogie Preprocessor took 114.03 ms. Allocated memory is still 198.7 MB. Free memory was 156.5 MB in the beginning and 151.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:53,596 INFO L168 Benchmark]: RCFGBuilder took 1259.31 ms. Allocated memory was 198.7 MB in the beginning and 221.8 MB in the end (delta: 23.1 MB). Free memory was 151.5 MB in the beginning and 166.4 MB in the end (delta: -15.0 MB). Peak memory consumption was 84.7 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:53,597 INFO L168 Benchmark]: TraceAbstraction took 16986.17 ms. Allocated memory was 221.8 MB in the beginning and 594.5 MB in the end (delta: 372.8 MB). Free memory was 166.4 MB in the beginning and 452.2 MB in the end (delta: -285.7 MB). Peak memory consumption was 400.7 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:53,602 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.23 ms. Allocated memory is still 138.9 MB. Free memory was 105.0 MB in the beginning and 104.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 733.65 ms. Allocated memory was 138.9 MB in the beginning and 198.7 MB in the end (delta: 59.8 MB). Free memory was 85.0 MB in the beginning and 156.5 MB in the end (delta: -71.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.03 ms. Allocated memory is still 198.7 MB. Free memory was 156.5 MB in the beginning and 151.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1259.31 ms. Allocated memory was 198.7 MB in the beginning and 221.8 MB in the end (delta: 23.1 MB). Free memory was 151.5 MB in the beginning and 166.4 MB in the end (delta: -15.0 MB). Peak memory consumption was 84.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16986.17 ms. Allocated memory was 221.8 MB in the beginning and 594.5 MB in the end (delta: 372.8 MB). Free memory was 166.4 MB in the beginning and 452.2 MB in the end (delta: -285.7 MB). Peak memory consumption was 400.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: 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 == a11) && a17 == \old(a17)) && !(a25 == 1)) && 7 == \old(a28)) && 8 == \old(a17)) && !(a28 == 9)) || !(1 == a21)) || !(\old(a28) <= 7)) || ((((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && a28 == 7) && a11 == 1)) || ((((a28 == 9 && a17 == \old(a17)) && 7 == \old(a28)) && a19 == 1) && 8 == \old(a17))) || (!(a28 == a17) && a17 == 7)) || (((((!(1 == a11) && a17 == \old(a17)) && 7 == \old(a28)) && !(a28 == 8)) && 8 == \old(a17)) && !(a28 == 9))) || ((((a28 == 9 && a17 == 8) && a19 == 1) && a25 == 1) && a11 == 1)) || 1 == \old(a25)) || (((a17 == 7 && a19 == 1) && a25 == 1) && a11 == 1)) || 1 == \old(a11)) || ((((((((!(1 == a11) && !(a28 == a17)) && (!(a28 == 7) || !(a17 == 8))) && !(a25 == 1)) && a21 == 1) && !(a28 == 9)) && a17 == \old(a17)) && a19 == \old(a19)) && a28 == \old(a28))) || ((((!(1 == a11) && a17 == \old(a17)) && 7 == \old(a28)) && a19 == 1) && 8 == \old(a17))) || !(1 == \old(a19))) || ((((a28 <= 7 && ((((!(1 == a11) && !(a28 == a17)) && (!(a28 == 7) || !(a17 == 8))) && !(a25 == 1)) && a21 == 1) && !(a28 == 9)) && a17 == \old(a17)) && a19 == \old(a19)) && 8 == \old(a17))) || \old(a17) == \old(a28)) || ((((a28 <= 7 && a17 == \old(a17)) && 7 == \old(a28)) && a19 == 1) && 8 == \old(a17))) || ((((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, 16.8s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 10.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 583 SDtfs, 6390 SDslu, 633 SDs, 0 SdLazy, 8504 SolverSat, 1518 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 737 GetRequests, 656 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2398occurred in iteration=9, 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.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 514 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 106 PreInvPairs, 162 NumberOfFragments, 1046 HoareAnnotationTreeSize, 106 FomulaSimplifications, 3579 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1448 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2235 NumberOfCodeBlocks, 2235 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2222 ConstructedInterpolants, 0 QuantifiedInterpolants, 1729010 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1416 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 617/664 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...