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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label53.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 00:04:05,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 00:04:05,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 00:04:05,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 00:04:05,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 00:04:05,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 00:04:05,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 00:04:05,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 00:04:05,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 00:04:05,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 00:04:05,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 00:04:05,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 00:04:05,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 00:04:05,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 00:04:05,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 00:04:05,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 00:04:05,615 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 00:04:05,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 00:04:05,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 00:04:05,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 00:04:05,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 00:04:05,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 00:04:05,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 00:04:05,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 00:04:05,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 00:04:05,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 00:04:05,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 00:04:05,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 00:04:05,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 00:04:05,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 00:04:05,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 00:04:05,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 00:04:05,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 00:04:05,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 00:04:05,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 00:04:05,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 00:04:05,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 00:04:05,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 00:04:05,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 00:04:05,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 00:04:05,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 00:04:05,652 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-15 00:04:05,688 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 00:04:05,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 00:04:05,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 00:04:05,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 00:04:05,690 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 00:04:05,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 00:04:05,691 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 00:04:05,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 00:04:05,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 00:04:05,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 00:04:05,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 00:04:05,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 00:04:05,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 00:04:05,692 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 00:04:05,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 00:04:05,692 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 00:04:05,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 00:04:05,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 00:04:05,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 00:04:05,693 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 00:04:05,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 00:04:05,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:04:05,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 00:04:05,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 00:04:05,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 00:04:05,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 00:04:05,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 00:04:05,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 00:04:05,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 00:04:05,977 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 00:04:05,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 00:04:05,998 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 00:04:06,000 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 00:04:06,000 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 00:04:06,001 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label53.c [2019-10-15 00:04:06,057 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93833b762/8b2df217b0e44db994e52210368ef1b0/FLAG86f91770a [2019-10-15 00:04:06,672 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 00:04:06,672 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label53.c [2019-10-15 00:04:06,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93833b762/8b2df217b0e44db994e52210368ef1b0/FLAG86f91770a [2019-10-15 00:04:06,950 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93833b762/8b2df217b0e44db994e52210368ef1b0 [2019-10-15 00:04:06,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 00:04:06,963 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 00:04:06,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 00:04:06,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 00:04:06,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 00:04:06,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:04:06" (1/1) ... [2019-10-15 00:04:06,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e7ef353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:06, skipping insertion in model container [2019-10-15 00:04:06,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:04:06" (1/1) ... [2019-10-15 00:04:06,981 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 00:04:07,049 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 00:04:07,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:04:07,752 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 00:04:07,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:04:07,990 INFO L192 MainTranslator]: Completed translation [2019-10-15 00:04:07,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:07 WrapperNode [2019-10-15 00:04:07,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 00:04:07,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 00:04:07,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 00:04:07,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 00:04:08,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:07" (1/1) ... [2019-10-15 00:04:08,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:07" (1/1) ... [2019-10-15 00:04:08,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:07" (1/1) ... [2019-10-15 00:04:08,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:07" (1/1) ... [2019-10-15 00:04:08,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:07" (1/1) ... [2019-10-15 00:04:08,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:07" (1/1) ... [2019-10-15 00:04:08,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:07" (1/1) ... [2019-10-15 00:04:08,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 00:04:08,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 00:04:08,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 00:04:08,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 00:04:08,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:07" (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-15 00:04:08,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 00:04:08,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 00:04:08,302 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-15 00:04:08,302 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 00:04:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-15 00:04:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 00:04:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 00:04:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 00:04:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 00:04:08,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 00:04:08,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 00:04:10,257 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 00:04:10,257 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 00:04:10,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:04:10 BoogieIcfgContainer [2019-10-15 00:04:10,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 00:04:10,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 00:04:10,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 00:04:10,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 00:04:10,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 12:04:06" (1/3) ... [2019-10-15 00:04:10,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4541096c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:04:10, skipping insertion in model container [2019-10-15 00:04:10,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:07" (2/3) ... [2019-10-15 00:04:10,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4541096c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:04:10, skipping insertion in model container [2019-10-15 00:04:10,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:04:10" (3/3) ... [2019-10-15 00:04:10,267 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label53.c [2019-10-15 00:04:10,277 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 00:04:10,285 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 00:04:10,296 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 00:04:10,324 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 00:04:10,324 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 00:04:10,324 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 00:04:10,324 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 00:04:10,324 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 00:04:10,324 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 00:04:10,324 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 00:04:10,324 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 00:04:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-10-15 00:04:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 00:04:10,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:10,358 INFO L380 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] [2019-10-15 00:04:10,360 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:10,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:10,366 INFO L82 PathProgramCache]: Analyzing trace with hash 640789778, now seen corresponding path program 1 times [2019-10-15 00:04:10,375 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:10,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649182099] [2019-10-15 00:04:10,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:10,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:10,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:10,758 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-15 00:04:10,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649182099] [2019-10-15 00:04:10,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:04:10,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:04:10,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688298266] [2019-10-15 00:04:10,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:04:10,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:10,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:04:10,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:04:10,783 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 4 states. [2019-10-15 00:04:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:13,112 INFO L93 Difference]: Finished difference Result 997 states and 1776 transitions. [2019-10-15 00:04:13,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:04:13,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-10-15 00:04:13,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:13,136 INFO L225 Difference]: With dead ends: 997 [2019-10-15 00:04:13,137 INFO L226 Difference]: Without dead ends: 623 [2019-10-15 00:04:13,147 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:04:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-15 00:04:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 620. [2019-10-15 00:04:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-15 00:04:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 896 transitions. [2019-10-15 00:04:13,265 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 896 transitions. Word has length 53 [2019-10-15 00:04:13,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:13,265 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 896 transitions. [2019-10-15 00:04:13,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:04:13,266 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 896 transitions. [2019-10-15 00:04:13,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-15 00:04:13,274 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:13,274 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:04:13,274 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:13,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:13,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1201480114, now seen corresponding path program 1 times [2019-10-15 00:04:13,275 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:13,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350603596] [2019-10-15 00:04:13,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:13,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:13,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:13,545 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:04:13,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350603596] [2019-10-15 00:04:13,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:04:13,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 00:04:13,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301334110] [2019-10-15 00:04:13,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 00:04:13,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:13,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 00:04:13,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:04:13,556 INFO L87 Difference]: Start difference. First operand 620 states and 896 transitions. Second operand 6 states. [2019-10-15 00:04:15,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:15,077 INFO L93 Difference]: Finished difference Result 1833 states and 2715 transitions. [2019-10-15 00:04:15,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 00:04:15,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2019-10-15 00:04:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:15,087 INFO L225 Difference]: With dead ends: 1833 [2019-10-15 00:04:15,087 INFO L226 Difference]: Without dead ends: 1219 [2019-10-15 00:04:15,090 INFO L600 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-15 00:04:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2019-10-15 00:04:15,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1200. [2019-10-15 00:04:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2019-10-15 00:04:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1734 transitions. [2019-10-15 00:04:15,190 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1734 transitions. Word has length 125 [2019-10-15 00:04:15,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:15,193 INFO L462 AbstractCegarLoop]: Abstraction has 1200 states and 1734 transitions. [2019-10-15 00:04:15,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 00:04:15,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1734 transitions. [2019-10-15 00:04:15,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-15 00:04:15,207 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:15,208 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 00:04:15,208 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:15,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:15,209 INFO L82 PathProgramCache]: Analyzing trace with hash 260139594, now seen corresponding path program 1 times [2019-10-15 00:04:15,209 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:15,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319700172] [2019-10-15 00:04:15,210 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:15,210 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:15,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:15,738 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 9 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:04:15,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319700172] [2019-10-15 00:04:15,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760557684] [2019-10-15 00:04:15,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:04:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:15,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-15 00:04:15,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:04:15,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:04:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-15 00:04:16,107 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:04:16,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:16,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:16,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:16,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:04:16,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:16,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:16,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:16,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:16,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:04:16,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 92 proven. 69 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 00:04:16,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 00:04:16,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 5] total 16 [2019-10-15 00:04:16,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804439931] [2019-10-15 00:04:16,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:04:16,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:16,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:04:16,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-10-15 00:04:16,567 INFO L87 Difference]: Start difference. First operand 1200 states and 1734 transitions. Second operand 5 states. [2019-10-15 00:04:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:18,132 INFO L93 Difference]: Finished difference Result 2827 states and 4067 transitions. [2019-10-15 00:04:18,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 00:04:18,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 227 [2019-10-15 00:04:18,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:18,142 INFO L225 Difference]: With dead ends: 2827 [2019-10-15 00:04:18,142 INFO L226 Difference]: Without dead ends: 1633 [2019-10-15 00:04:18,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 451 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-10-15 00:04:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2019-10-15 00:04:18,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1601. [2019-10-15 00:04:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-10-15 00:04:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2178 transitions. [2019-10-15 00:04:18,226 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2178 transitions. Word has length 227 [2019-10-15 00:04:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:18,228 INFO L462 AbstractCegarLoop]: Abstraction has 1601 states and 2178 transitions. [2019-10-15 00:04:18,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:04:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2178 transitions. [2019-10-15 00:04:18,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-15 00:04:18,236 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:18,236 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:04:18,450 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:04:18,450 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:18,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:18,451 INFO L82 PathProgramCache]: Analyzing trace with hash -701389057, now seen corresponding path program 1 times [2019-10-15 00:04:18,451 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:18,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453793436] [2019-10-15 00:04:18,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:18,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:18,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-15 00:04:18,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453793436] [2019-10-15 00:04:18,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:04:18,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:04:18,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881274383] [2019-10-15 00:04:18,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:04:18,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:18,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:04:18,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:04:18,660 INFO L87 Difference]: Start difference. First operand 1601 states and 2178 transitions. Second operand 4 states. [2019-10-15 00:04:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:20,281 INFO L93 Difference]: Finished difference Result 3784 states and 5386 transitions. [2019-10-15 00:04:20,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:04:20,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 280 [2019-10-15 00:04:20,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:20,300 INFO L225 Difference]: With dead ends: 3784 [2019-10-15 00:04:20,300 INFO L226 Difference]: Without dead ends: 2189 [2019-10-15 00:04:20,305 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:04:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2019-10-15 00:04:20,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2181. [2019-10-15 00:04:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2181 states. [2019-10-15 00:04:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 2895 transitions. [2019-10-15 00:04:20,371 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 2895 transitions. Word has length 280 [2019-10-15 00:04:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:20,375 INFO L462 AbstractCegarLoop]: Abstraction has 2181 states and 2895 transitions. [2019-10-15 00:04:20,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:04:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2895 transitions. [2019-10-15 00:04:20,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-15 00:04:20,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:20,384 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:04:20,384 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:20,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:20,385 INFO L82 PathProgramCache]: Analyzing trace with hash -129583605, now seen corresponding path program 1 times [2019-10-15 00:04:20,385 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:20,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443201625] [2019-10-15 00:04:20,386 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:20,386 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:20,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:04:20,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443201625] [2019-10-15 00:04:20,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520706521] [2019-10-15 00:04:20,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:04:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:20,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 00:04:20,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:04:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-15 00:04:20,869 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:04:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-15 00:04:21,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 00:04:21,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-15 00:04:21,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294396912] [2019-10-15 00:04:21,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:04:21,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:21,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:04:21,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-15 00:04:21,163 INFO L87 Difference]: Start difference. First operand 2181 states and 2895 transitions. Second operand 5 states. [2019-10-15 00:04:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:22,545 INFO L93 Difference]: Finished difference Result 5733 states and 7932 transitions. [2019-10-15 00:04:22,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 00:04:22,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 286 [2019-10-15 00:04:22,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:22,566 INFO L225 Difference]: With dead ends: 5733 [2019-10-15 00:04:22,566 INFO L226 Difference]: Without dead ends: 3558 [2019-10-15 00:04:22,573 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 566 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-10-15 00:04:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2019-10-15 00:04:22,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3556. [2019-10-15 00:04:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3556 states. [2019-10-15 00:04:22,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3556 states to 3556 states and 4727 transitions. [2019-10-15 00:04:22,701 INFO L78 Accepts]: Start accepts. Automaton has 3556 states and 4727 transitions. Word has length 286 [2019-10-15 00:04:22,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:22,702 INFO L462 AbstractCegarLoop]: Abstraction has 3556 states and 4727 transitions. [2019-10-15 00:04:22,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:04:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 4727 transitions. [2019-10-15 00:04:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-10-15 00:04:22,714 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:22,715 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:04:22,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:04:22,921 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:22,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:22,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1564473395, now seen corresponding path program 1 times [2019-10-15 00:04:22,922 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:22,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097342693] [2019-10-15 00:04:22,923 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:22,923 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:22,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-15 00:04:23,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097342693] [2019-10-15 00:04:23,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:04:23,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:04:23,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382418726] [2019-10-15 00:04:23,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:04:23,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:23,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:04:23,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:04:23,106 INFO L87 Difference]: Start difference. First operand 3556 states and 4727 transitions. Second operand 3 states. [2019-10-15 00:04:24,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:24,075 INFO L93 Difference]: Finished difference Result 8814 states and 12014 transitions. [2019-10-15 00:04:24,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:04:24,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 291 [2019-10-15 00:04:24,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:24,107 INFO L225 Difference]: With dead ends: 8814 [2019-10-15 00:04:24,107 INFO L226 Difference]: Without dead ends: 5264 [2019-10-15 00:04:24,118 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:04:24,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5264 states. [2019-10-15 00:04:24,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5264 to 4883. [2019-10-15 00:04:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4883 states. [2019-10-15 00:04:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4883 states to 4883 states and 6450 transitions. [2019-10-15 00:04:24,293 INFO L78 Accepts]: Start accepts. Automaton has 4883 states and 6450 transitions. Word has length 291 [2019-10-15 00:04:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:24,294 INFO L462 AbstractCegarLoop]: Abstraction has 4883 states and 6450 transitions. [2019-10-15 00:04:24,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:04:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4883 states and 6450 transitions. [2019-10-15 00:04:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-10-15 00:04:24,309 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:24,309 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 00:04:24,309 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:24,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:24,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1371805830, now seen corresponding path program 1 times [2019-10-15 00:04:24,310 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:24,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9526109] [2019-10-15 00:04:24,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:24,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:24,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-15 00:04:24,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9526109] [2019-10-15 00:04:24,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:04:24,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:04:24,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845463354] [2019-10-15 00:04:24,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:04:24,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:24,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:04:24,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:04:24,497 INFO L87 Difference]: Start difference. First operand 4883 states and 6450 transitions. Second operand 3 states. [2019-10-15 00:04:25,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:25,568 INFO L93 Difference]: Finished difference Result 11457 states and 15430 transitions. [2019-10-15 00:04:25,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:04:25,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-10-15 00:04:25,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:25,598 INFO L225 Difference]: With dead ends: 11457 [2019-10-15 00:04:25,598 INFO L226 Difference]: Without dead ends: 6580 [2019-10-15 00:04:25,612 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:04:25,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2019-10-15 00:04:25,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 5638. [2019-10-15 00:04:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5638 states. [2019-10-15 00:04:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5638 states to 5638 states and 7381 transitions. [2019-10-15 00:04:25,751 INFO L78 Accepts]: Start accepts. Automaton has 5638 states and 7381 transitions. Word has length 328 [2019-10-15 00:04:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:25,752 INFO L462 AbstractCegarLoop]: Abstraction has 5638 states and 7381 transitions. [2019-10-15 00:04:25,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:04:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 5638 states and 7381 transitions. [2019-10-15 00:04:25,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-10-15 00:04:25,773 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:25,774 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:04:25,774 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:25,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:25,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1172446445, now seen corresponding path program 1 times [2019-10-15 00:04:25,775 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:25,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175366411] [2019-10-15 00:04:25,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:25,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:25,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-10-15 00:04:26,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175366411] [2019-10-15 00:04:26,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171781411] [2019-10-15 00:04:26,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:04:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:26,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 00:04:26,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:04:26,583 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-10-15 00:04:26,583 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:04:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-10-15 00:04:26,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 00:04:26,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2019-10-15 00:04:26,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507851112] [2019-10-15 00:04:26,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:04:26,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:26,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:04:26,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 00:04:26,838 INFO L87 Difference]: Start difference. First operand 5638 states and 7381 transitions. Second operand 4 states. [2019-10-15 00:04:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:27,984 INFO L93 Difference]: Finished difference Result 12615 states and 16660 transitions. [2019-10-15 00:04:27,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:04:27,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 383 [2019-10-15 00:04:27,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:27,986 INFO L225 Difference]: With dead ends: 12615 [2019-10-15 00:04:27,986 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 00:04:28,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 770 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 00:04:28,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 00:04:28,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 00:04:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 00:04:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 00:04:28,011 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 383 [2019-10-15 00:04:28,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:28,012 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 00:04:28,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:04:28,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 00:04:28,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 00:04:28,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:04:28,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 00:04:29,002 WARN L191 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 56 [2019-10-15 00:04:29,111 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-15 00:04:29,111 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= |old(~a23~0)| ~a23~0) (<= ~a29~0 |old(~a29~0)|) (= ~a25~0 |old(~a25~0)|)) [2019-10-15 00:04:29,111 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 00:04:29,111 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-10-15 00:04:29,111 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-10-15 00:04:29,112 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-10-15 00:04:29,112 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,112 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,112 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,112 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,112 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,112 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,112 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,113 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-10-15 00:04:29,113 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-10-15 00:04:29,113 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-10-15 00:04:29,113 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,113 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,113 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,113 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,114 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,114 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,114 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,114 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,114 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,114 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-10-15 00:04:29,114 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-10-15 00:04:29,114 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-10-15 00:04:29,115 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,115 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,115 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,115 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,115 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,115 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,115 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,115 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,116 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,116 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-10-15 00:04:29,116 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-10-15 00:04:29,116 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-10-15 00:04:29,116 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-10-15 00:04:29,116 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-10-15 00:04:29,116 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-10-15 00:04:29,116 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-10-15 00:04:29,116 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,117 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,117 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,117 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,117 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,117 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,117 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,117 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,117 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,117 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,118 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-10-15 00:04:29,118 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-10-15 00:04:29,118 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-10-15 00:04:29,118 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,118 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,118 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,118 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,118 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,119 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-10-15 00:04:29,119 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-10-15 00:04:29,119 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-10-15 00:04:29,119 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,119 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,119 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,119 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,119 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,119 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-10-15 00:04:29,120 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-10-15 00:04:29,120 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,120 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,120 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,120 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,120 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,120 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,120 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-10-15 00:04:29,121 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-10-15 00:04:29,121 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,121 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,121 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-10-15 00:04:29,121 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-10-15 00:04:29,121 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-10-15 00:04:29,121 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,121 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,121 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,122 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,122 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,122 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,122 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,122 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-10-15 00:04:29,122 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-10-15 00:04:29,122 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-10-15 00:04:29,123 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2019-10-15 00:04:29,123 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-10-15 00:04:29,123 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-10-15 00:04:29,123 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-10-15 00:04:29,123 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-10-15 00:04:29,123 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,123 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,123 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-10-15 00:04:29,123 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-10-15 00:04:29,124 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,124 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,124 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,124 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,124 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 22 1026) the Hoare annotation is: (let ((.cse10 (+ |old(~a23~0)| 43)) (.cse7 (<= |old(~a23~0)| ~a23~0)) (.cse8 (<= ~a29~0 |old(~a29~0)|)) (.cse9 (= ~a25~0 |old(~a25~0)|))) (let ((.cse0 (and .cse7 .cse8 .cse9)) (.cse1 (not (<= |old(~a29~0)| 245))) (.cse3 (= 13 |old(~a25~0)|)) (.cse2 (not (<= 99912 |old(~a29~0)|))) (.cse4 (<= 99912 ~a29~0)) (.cse11 (= 1 |old(~a4~0)|)) (.cse6 (not (<= .cse10 0))) (.cse5 (<= (+ ~a23~0 43) 0))) (and (or (not (< 306 |old(~a23~0)|)) .cse0) (or .cse1 .cse0) (or .cse2 .cse3 .cse4) (or .cse0 .cse3) (or .cse5 (or .cse1 .cse6)) (or .cse5 (or .cse6 .cse3)) (or (< 277 ~a29~0) .cse3 (not (< 277 |old(~a29~0)|))) (or .cse2 (and .cse4 .cse7 .cse8 .cse9) (not (< 0 .cse10))) (or .cse11 (and .cse7 .cse8 (not (= 1 ~a4~0)) .cse9)) (or .cse11 .cse6 .cse5)))) [2019-10-15 00:04:29,124 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,125 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-10-15 00:04:29,125 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-10-15 00:04:29,125 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-10-15 00:04:29,125 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,125 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,125 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,126 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,126 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,127 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,127 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-10-15 00:04:29,127 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-10-15 00:04:29,127 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-10-15 00:04:29,127 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,127 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,127 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,127 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,127 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,128 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,128 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,128 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,128 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-10-15 00:04:29,128 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-10-15 00:04:29,128 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-10-15 00:04:29,128 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,128 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,128 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,129 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,129 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,129 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,129 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,129 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,130 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,130 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,130 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,130 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-10-15 00:04:29,130 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-10-15 00:04:29,130 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-10-15 00:04:29,130 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-10-15 00:04:29,130 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-10-15 00:04:29,130 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,131 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,131 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,131 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,131 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,131 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,131 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,131 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-10-15 00:04:29,131 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-10-15 00:04:29,131 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-10-15 00:04:29,132 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,132 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,132 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,132 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-10-15 00:04:29,132 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-10-15 00:04:29,132 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,132 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,132 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,132 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,132 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,133 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-10-15 00:04:29,133 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-10-15 00:04:29,133 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,133 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,133 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-10-15 00:04:29,133 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-10-15 00:04:29,133 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,133 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,133 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,133 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,133 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,133 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,133 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-10-15 00:04:29,134 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-10-15 00:04:29,134 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-10-15 00:04:29,134 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-10-15 00:04:29,134 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,134 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,134 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,134 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,134 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,134 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,134 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,134 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,134 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-10-15 00:04:29,134 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-10-15 00:04:29,135 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-10-15 00:04:29,135 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-10-15 00:04:29,135 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-10-15 00:04:29,135 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-10-15 00:04:29,135 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,135 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,135 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,135 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,135 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,135 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,135 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,135 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-10-15 00:04:29,135 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-10-15 00:04:29,135 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,136 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,136 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,136 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,136 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,136 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,136 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,136 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-10-15 00:04:29,136 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-10-15 00:04:29,136 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,136 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,136 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,136 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,136 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,137 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,137 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,137 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-10-15 00:04:29,137 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,137 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,137 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,137 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-10-15 00:04:29,137 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-10-15 00:04:29,137 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-10-15 00:04:29,137 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,137 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-10-15 00:04:29,137 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,137 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-10-15 00:04:29,138 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,138 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,138 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,138 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,138 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,138 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,138 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-10-15 00:04:29,138 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-10-15 00:04:29,138 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-10-15 00:04:29,138 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,138 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,138 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,139 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,139 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,139 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,139 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,139 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,139 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,139 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,139 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-10-15 00:04:29,140 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-10-15 00:04:29,140 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-10-15 00:04:29,140 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,140 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-10-15 00:04:29,140 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-10-15 00:04:29,140 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,140 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,140 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,140 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,141 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,141 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,141 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-10-15 00:04:29,141 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-10-15 00:04:29,141 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-10-15 00:04:29,141 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,141 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,141 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,142 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,142 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-10-15 00:04:29,142 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-10-15 00:04:29,142 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,142 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,142 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-10-15 00:04:29,142 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,142 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,143 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-10-15 00:04:29,143 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 00:04:29,143 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a25~0 13)) (<= ~a29~0 130) (<= 312 ~a23~0)) [2019-10-15 00:04:29,143 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 00:04:29,143 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 00:04:29,143 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1028 1044) the Hoare annotation is: (or (not (<= 312 |old(~a23~0)|)) (= 13 |old(~a25~0)|) (not (<= |old(~a29~0)| 130)) (and (<= |old(~a23~0)| ~a23~0) (<= ~a29~0 |old(~a29~0)|) (= ~a25~0 |old(~a25~0)|))) [2019-10-15 00:04:29,143 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1028 1044) no Hoare annotation was computed. [2019-10-15 00:04:29,144 INFO L439 ceAbstractionStarter]: At program point L1042(line 1042) the Hoare annotation is: (or (and (<= 99912 ~a29~0) (< 0 (+ ~a23~0 43))) (not (<= 312 |old(~a23~0)|)) (not (= ~a25~0 13)) (not (= 1 ~a4~0)) (= 13 |old(~a25~0)|) (< 306 ~a23~0) (not (<= |old(~a29~0)| 130)) (<= ~a29~0 245)) [2019-10-15 00:04:29,144 INFO L443 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2019-10-15 00:04:29,144 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-10-15 00:04:29,144 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (or (and (<= 99912 ~a29~0) (< 0 (+ ~a23~0 43))) (not (<= 312 |old(~a23~0)|)) (not (= ~a25~0 13)) (not (= 1 ~a4~0)) (= 13 |old(~a25~0)|) (< 306 ~a23~0) (not (<= |old(~a29~0)| 130)) (<= ~a29~0 245)) [2019-10-15 00:04:29,144 INFO L443 ceAbstractionStarter]: For program point L1034-3(lines 1028 1044) no Hoare annotation was computed. [2019-10-15 00:04:29,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:04:29 BoogieIcfgContainer [2019-10-15 00:04:29,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 00:04:29,180 INFO L168 Benchmark]: Toolchain (without parser) took 22210.72 ms. Allocated memory was 143.1 MB in the beginning and 630.7 MB in the end (delta: 487.6 MB). Free memory was 100.7 MB in the beginning and 296.3 MB in the end (delta: -195.7 MB). Peak memory consumption was 291.9 MB. Max. memory is 7.1 GB. [2019-10-15 00:04:29,181 INFO L168 Benchmark]: CDTParser took 1.35 ms. Allocated memory is still 143.1 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 00:04:29,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1027.88 ms. Allocated memory was 143.1 MB in the beginning and 204.5 MB in the end (delta: 61.3 MB). Free memory was 100.5 MB in the beginning and 143.3 MB in the end (delta: -42.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-10-15 00:04:29,184 INFO L168 Benchmark]: Boogie Preprocessor took 196.33 ms. Allocated memory is still 204.5 MB. Free memory was 143.3 MB in the beginning and 136.0 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. [2019-10-15 00:04:29,185 INFO L168 Benchmark]: RCFGBuilder took 2069.51 ms. Allocated memory was 204.5 MB in the beginning and 248.5 MB in the end (delta: 44.0 MB). Free memory was 136.0 MB in the beginning and 207.1 MB in the end (delta: -71.1 MB). Peak memory consumption was 88.4 MB. Max. memory is 7.1 GB. [2019-10-15 00:04:29,190 INFO L168 Benchmark]: TraceAbstraction took 18912.16 ms. Allocated memory was 248.5 MB in the beginning and 630.7 MB in the end (delta: 382.2 MB). Free memory was 205.4 MB in the beginning and 296.3 MB in the end (delta: -91.0 MB). Peak memory consumption was 291.2 MB. Max. memory is 7.1 GB. [2019-10-15 00:04:29,195 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.35 ms. Allocated memory is still 143.1 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1027.88 ms. Allocated memory was 143.1 MB in the beginning and 204.5 MB in the end (delta: 61.3 MB). Free memory was 100.5 MB in the beginning and 143.3 MB in the end (delta: -42.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 196.33 ms. Allocated memory is still 204.5 MB. Free memory was 143.3 MB in the beginning and 136.0 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2069.51 ms. Allocated memory was 204.5 MB in the beginning and 248.5 MB in the end (delta: 44.0 MB). Free memory was 136.0 MB in the beginning and 207.1 MB in the end (delta: -71.1 MB). Peak memory consumption was 88.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18912.16 ms. Allocated memory was 248.5 MB in the beginning and 630.7 MB in the end (delta: 382.2 MB). Free memory was 205.4 MB in the beginning and 296.3 MB in the end (delta: -91.0 MB). Peak memory consumption was 291.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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: 1034]: Loop Invariant Derived loop invariant: (((((((99912 <= a29 && 0 < a23 + 43) || !(312 <= \old(a23))) || !(a25 == 13)) || !(1 == a4)) || 13 == \old(a25)) || 306 < a23) || !(\old(a29) <= 130)) || a29 <= 245 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 292 locations, 1 error locations. Result: SAFE, OverallTime: 18.8s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 1445 SDtfs, 2981 SDslu, 506 SDs, 0 SdLazy, 7121 SolverSat, 1320 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1850 GetRequests, 1802 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5638occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 1387 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 143 PreInvPairs, 215 NumberOfFragments, 271 HoareAnnotationTreeSize, 143 FomulaSimplifications, 1979 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2270 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2869 NumberOfCodeBlocks, 2869 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3751 ConstructedInterpolants, 0 QuantifiedInterpolants, 4351245 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1509 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 2103/2504 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...