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/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:05:43,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:05:43,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:05:43,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:05:43,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:05:43,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:05:43,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:05:43,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:05:43,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:05:43,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:05:43,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:05:43,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:05:43,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:05:43,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:05:43,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:05:43,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:05:43,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:05:43,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:05:43,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:05:43,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:05:43,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:05:43,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:05:43,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:05:43,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:05:43,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:05:43,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:05:43,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:05:43,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:05:43,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:05:43,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:05:43,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:05:43,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:05:43,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:05:43,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:05:43,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:05:43,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:05:43,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:05:43,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:05:43,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:05:43,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:05:43,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:05:43,641 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-13 21:05:43,674 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:05:43,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:05:43,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:05:43,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:05:43,678 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:05:43,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:05:43,678 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:05:43,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:05:43,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:05:43,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:05:43,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:05:43,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:05:43,683 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:05:43,684 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:05:43,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:05:43,684 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:05:43,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:05:43,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:05:43,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:05:43,686 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:05:43,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:05:43,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:05:43,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:05:43,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:05:43,687 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:05:43,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:05:43,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:05:43,688 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:05:43,688 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-13 21:05:44,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:05:44,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:05:44,027 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:05:44,029 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:05:44,029 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:05:44,030 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-10-13 21:05:44,109 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f2f5caee/29e35e9f1b5646eda05d80feafb8e5a7/FLAG6d09e8398 [2019-10-13 21:05:44,633 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:05:44,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-10-13 21:05:44,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f2f5caee/29e35e9f1b5646eda05d80feafb8e5a7/FLAG6d09e8398 [2019-10-13 21:05:45,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f2f5caee/29e35e9f1b5646eda05d80feafb8e5a7 [2019-10-13 21:05:45,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:05:45,121 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:05:45,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:45,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:05:45,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:05:45,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:45" (1/1) ... [2019-10-13 21:05:45,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7110c535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:45, skipping insertion in model container [2019-10-13 21:05:45,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:45" (1/1) ... [2019-10-13 21:05:45,140 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:05:45,169 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:05:45,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:45,374 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:05:45,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:45,509 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:05:45,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:45 WrapperNode [2019-10-13 21:05:45,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:45,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:05:45,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:05:45,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:05:45,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:45" (1/1) ... [2019-10-13 21:05:45,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:45" (1/1) ... [2019-10-13 21:05:45,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:45" (1/1) ... [2019-10-13 21:05:45,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:45" (1/1) ... [2019-10-13 21:05:45,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:45" (1/1) ... [2019-10-13 21:05:45,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:45" (1/1) ... [2019-10-13 21:05:45,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:45" (1/1) ... [2019-10-13 21:05:45,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:05:45,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:05:45,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:05:45,547 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:05:45,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:45" (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-13 21:05:45,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:05:45,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:05:45,629 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:05:45,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:05:45,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:05:45,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:05:45,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-13 21:05:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:05:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:05:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:05:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:05:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:05:45,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:05:45,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:05:46,025 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:05:46,025 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:05:46,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:46 BoogieIcfgContainer [2019-10-13 21:05:46,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:05:46,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:05:46,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:05:46,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:05:46,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:05:45" (1/3) ... [2019-10-13 21:05:46,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750b106b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:46, skipping insertion in model container [2019-10-13 21:05:46,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:45" (2/3) ... [2019-10-13 21:05:46,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750b106b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:46, skipping insertion in model container [2019-10-13 21:05:46,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:46" (3/3) ... [2019-10-13 21:05:46,039 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2019-10-13 21:05:46,049 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:05:46,057 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-13 21:05:46,069 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-13 21:05:46,093 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:05:46,093 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:05:46,093 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:05:46,093 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:05:46,094 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:05:46,094 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:05:46,094 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:05:46,094 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:05:46,110 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-10-13 21:05:46,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:05:46,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:46,117 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:46,118 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:46,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:46,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900034, now seen corresponding path program 1 times [2019-10-13 21:05:46,131 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:46,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035226594] [2019-10-13 21:05:46,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:46,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:46,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:46,328 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-13 21:05:46,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035226594] [2019-10-13 21:05:46,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:46,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:46,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339481794] [2019-10-13 21:05:46,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:46,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:46,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:46,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:46,358 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-10-13 21:05:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:46,402 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2019-10-13 21:05:46,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:46,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:05:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:46,415 INFO L225 Difference]: With dead ends: 56 [2019-10-13 21:05:46,416 INFO L226 Difference]: Without dead ends: 34 [2019-10-13 21:05:46,419 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-13 21:05:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-13 21:05:46,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-10-13 21:05:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 21:05:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-10-13 21:05:46,466 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2019-10-13 21:05:46,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:46,466 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-10-13 21:05:46,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:46,467 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-10-13 21:05:46,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:05:46,468 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:46,468 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:46,468 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:46,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:46,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1256853917, now seen corresponding path program 1 times [2019-10-13 21:05:46,469 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:46,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621982972] [2019-10-13 21:05:46,470 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:46,470 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:46,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:46,538 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-13 21:05:46,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621982972] [2019-10-13 21:05:46,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:46,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:05:46,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487814491] [2019-10-13 21:05:46,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:05:46,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:46,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:05:46,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:05:46,543 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2019-10-13 21:05:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:46,590 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-10-13 21:05:46,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:05:46,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-13 21:05:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:46,593 INFO L225 Difference]: With dead ends: 53 [2019-10-13 21:05:46,593 INFO L226 Difference]: Without dead ends: 51 [2019-10-13 21:05:46,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:05:46,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-13 21:05:46,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2019-10-13 21:05:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 21:05:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-10-13 21:05:46,603 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2019-10-13 21:05:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:46,603 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-10-13 21:05:46,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:05:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-10-13 21:05:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:05:46,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:46,605 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:46,605 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:46,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:46,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1192177656, now seen corresponding path program 1 times [2019-10-13 21:05:46,606 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:46,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960475781] [2019-10-13 21:05:46,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:46,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:46,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:46,662 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-13 21:05:46,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960475781] [2019-10-13 21:05:46,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:46,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:46,664 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438729723] [2019-10-13 21:05:46,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:46,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:46,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:46,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:46,668 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2019-10-13 21:05:46,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:46,716 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-13 21:05:46,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:46,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:05:46,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:46,718 INFO L225 Difference]: With dead ends: 62 [2019-10-13 21:05:46,718 INFO L226 Difference]: Without dead ends: 41 [2019-10-13 21:05:46,719 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-13 21:05:46,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-13 21:05:46,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2019-10-13 21:05:46,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 21:05:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-13 21:05:46,726 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2019-10-13 21:05:46,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:46,727 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-13 21:05:46,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:46,727 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-10-13 21:05:46,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:05:46,728 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:46,728 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:46,728 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:46,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:46,729 INFO L82 PathProgramCache]: Analyzing trace with hash -249616619, now seen corresponding path program 1 times [2019-10-13 21:05:46,729 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:46,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724650281] [2019-10-13 21:05:46,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:46,730 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:46,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:46,782 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-13 21:05:46,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724650281] [2019-10-13 21:05:46,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:46,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:46,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951606676] [2019-10-13 21:05:46,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:46,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:46,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:46,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:46,785 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2019-10-13 21:05:46,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:46,840 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-10-13 21:05:46,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:46,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-13 21:05:46,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:46,842 INFO L225 Difference]: With dead ends: 56 [2019-10-13 21:05:46,842 INFO L226 Difference]: Without dead ends: 35 [2019-10-13 21:05:46,843 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-13 21:05:46,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-13 21:05:46,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-10-13 21:05:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 21:05:46,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-10-13 21:05:46,848 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2019-10-13 21:05:46,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:46,849 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-10-13 21:05:46,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:46,849 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-10-13 21:05:46,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:05:46,850 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:46,850 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] [2019-10-13 21:05:46,850 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:46,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:46,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1739668830, now seen corresponding path program 1 times [2019-10-13 21:05:46,851 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:46,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628929790] [2019-10-13 21:05:46,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:46,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:46,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:47,684 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 40 [2019-10-13 21:05:47,987 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 44 [2019-10-13 21:05:48,005 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-13 21:05:48,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628929790] [2019-10-13 21:05:48,006 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:48,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:05:48,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060897531] [2019-10-13 21:05:48,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:05:48,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:48,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:05:48,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:05:48,008 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 9 states. [2019-10-13 21:05:50,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:50,393 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-10-13 21:05:50,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:05:50,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-10-13 21:05:50,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:50,397 INFO L225 Difference]: With dead ends: 47 [2019-10-13 21:05:50,397 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 21:05:50,398 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:05:50,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 21:05:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-13 21:05:50,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 21:05:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-10-13 21:05:50,404 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2019-10-13 21:05:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:50,405 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-10-13 21:05:50,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:05:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-10-13 21:05:50,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:50,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:50,406 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] [2019-10-13 21:05:50,407 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:50,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:50,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1253973443, now seen corresponding path program 1 times [2019-10-13 21:05:50,408 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:50,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576795368] [2019-10-13 21:05:50,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:50,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:50,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:50,488 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-13 21:05:50,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576795368] [2019-10-13 21:05:50,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:50,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:05:50,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140694852] [2019-10-13 21:05:50,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:05:50,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:50,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:05:50,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:05:50,493 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2019-10-13 21:05:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:50,584 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-10-13 21:05:50,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:05:50,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-13 21:05:50,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:50,586 INFO L225 Difference]: With dead ends: 44 [2019-10-13 21:05:50,587 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 21:05:50,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:05:50,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 21:05:50,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-10-13 21:05:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-13 21:05:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-10-13 21:05:50,600 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2019-10-13 21:05:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:50,606 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-10-13 21:05:50,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:05:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-10-13 21:05:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:50,608 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:50,609 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:50,609 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:50,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:50,610 INFO L82 PathProgramCache]: Analyzing trace with hash 899200671, now seen corresponding path program 1 times [2019-10-13 21:05:50,610 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:50,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455967172] [2019-10-13 21:05:50,611 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:50,611 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:50,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:59,020 WARN L191 SmtUtils]: Spent 5.95 s on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-10-13 21:05:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:59,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455967172] [2019-10-13 21:05:59,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511981275] [2019-10-13 21:05:59,393 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-13 21:05:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:59,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:05:59,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:06:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:01,766 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:06:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:06,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1936609002] [2019-10-13 21:06:06,364 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 24 [2019-10-13 21:06:06,398 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:06:06,398 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:06:06,459 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-13 21:06:06,461 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 0. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 38 variables. [2019-10-13 21:06:06,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:06,465 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-13 21:06:06,498 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-13 21:06:06,499 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-13 21:06:06,500 INFO L553 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2019-10-13 21:06:06,500 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-13 21:06:06,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:06:06,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8, 4, 4] total 12 [2019-10-13 21:06:06,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699594347] [2019-10-13 21:06:06,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 21:06:06,503 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:06,503 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-13 21:06:06,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 21:06:06,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:06:06,503 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 2 states. [2019-10-13 21:06:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:06,505 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-10-13 21:06:06,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 21:06:06,505 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2019-10-13 21:06:06,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:06,506 INFO L225 Difference]: With dead ends: 28 [2019-10-13 21:06:06,506 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:06:06,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:06:06,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:06:06,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:06:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:06:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:06:06,507 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-10-13 21:06:06,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:06,508 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:06:06,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 21:06:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:06:06,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:06:06,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:06:06,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:06:06,751 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:06:06,752 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:06:06,752 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:06:06,752 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:06:06,752 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 21:06:06,752 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:06:06,752 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:06:06,752 INFO L446 ceAbstractionStarter]: At program point L126(lines 92 127) the Hoare annotation is: true [2019-10-13 21:06:06,753 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 9 191) no Hoare annotation was computed. [2019-10-13 21:06:06,753 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2019-10-13 21:06:06,753 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 179) no Hoare annotation was computed. [2019-10-13 21:06:06,753 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-10-13 21:06:06,753 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 185) no Hoare annotation was computed. [2019-10-13 21:06:06,753 INFO L439 ceAbstractionStarter]: At program point L114(lines 93 123) the Hoare annotation is: false [2019-10-13 21:06:06,753 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 115) no Hoare annotation was computed. [2019-10-13 21:06:06,754 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 168) no Hoare annotation was computed. [2019-10-13 21:06:06,754 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-10-13 21:06:06,754 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-10-13 21:06:06,754 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-10-13 21:06:06,754 INFO L439 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: false [2019-10-13 21:06:06,754 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 190) no Hoare annotation was computed. [2019-10-13 21:06:06,754 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-10-13 21:06:06,759 INFO L439 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: false [2019-10-13 21:06:06,759 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-13 21:06:06,759 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-10-13 21:06:06,759 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 174) no Hoare annotation was computed. [2019-10-13 21:06:06,760 INFO L439 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-10-13 21:06:06,760 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-10-13 21:06:06,760 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 180) no Hoare annotation was computed. [2019-10-13 21:06:06,760 INFO L439 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: false [2019-10-13 21:06:06,760 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 9 191) no Hoare annotation was computed. [2019-10-13 21:06:06,760 INFO L443 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2019-10-13 21:06:06,761 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-10-13 21:06:06,761 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 9 191) the Hoare annotation is: true [2019-10-13 21:06:06,761 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 127) no Hoare annotation was computed. [2019-10-13 21:06:06,761 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-10-13 21:06:06,761 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2019-10-13 21:06:06,761 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-10-13 21:06:06,762 INFO L439 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-10-13 21:06:06,762 INFO L439 ceAbstractionStarter]: At program point L167(lines 21 180) the Hoare annotation is: false [2019-10-13 21:06:06,762 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-10-13 21:06:06,762 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-10-13 21:06:06,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:06:06 BoogieIcfgContainer [2019-10-13 21:06:06,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:06:06,774 INFO L168 Benchmark]: Toolchain (without parser) took 21652.70 ms. Allocated memory was 140.0 MB in the beginning and 247.5 MB in the end (delta: 107.5 MB). Free memory was 102.3 MB in the beginning and 156.8 MB in the end (delta: -54.5 MB). Peak memory consumption was 53.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:06:06,775 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 140.0 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:06:06,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.02 ms. Allocated memory was 140.0 MB in the beginning and 201.3 MB in the end (delta: 61.3 MB). Free memory was 102.1 MB in the beginning and 179.0 MB in the end (delta: -76.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:06:06,777 INFO L168 Benchmark]: Boogie Preprocessor took 35.50 ms. Allocated memory is still 201.3 MB. Free memory was 179.0 MB in the beginning and 176.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:06:06,778 INFO L168 Benchmark]: RCFGBuilder took 480.31 ms. Allocated memory is still 201.3 MB. Free memory was 176.9 MB in the beginning and 156.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:06:06,782 INFO L168 Benchmark]: TraceAbstraction took 20744.81 ms. Allocated memory was 201.3 MB in the beginning and 247.5 MB in the end (delta: 46.1 MB). Free memory was 156.8 MB in the beginning and 156.8 MB in the end (delta: 76.8 kB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-10-13 21:06:06,789 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 140.0 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 387.02 ms. Allocated memory was 140.0 MB in the beginning and 201.3 MB in the end (delta: 61.3 MB). Free memory was 102.1 MB in the beginning and 179.0 MB in the end (delta: -76.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.50 ms. Allocated memory is still 201.3 MB. Free memory was 179.0 MB in the beginning and 176.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 480.31 ms. Allocated memory is still 201.3 MB. Free memory was 176.9 MB in the beginning and 156.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20744.81 ms. Allocated memory was 201.3 MB in the beginning and 247.5 MB in the end (delta: 46.1 MB). Free memory was 156.8 MB in the beginning and 156.8 MB in the end (delta: 76.8 kB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 4 error locations. Result: SAFE, OverallTime: 20.6s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 201 SDtfs, 157 SDslu, 258 SDs, 0 SdLazy, 109 SolverSat, 11 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 13 NumberOfFragments, 12 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 30832 SizeOfPredicates, 3 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 3/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 102, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9772727272727273, AVG_VARS_REMOVED_DURING_WEAKENING: 1.4545454545454546, AVG_WEAKENED_CONJUNCTS: 0.9545454545454546, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...