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/ldv-regression/stateful_check.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:01:26,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:01:26,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:01:26,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:01:26,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:01:26,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:01:26,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:01:26,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:01:26,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:01:26,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:01:26,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:01:26,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:01:26,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:01:26,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:01:26,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:01:26,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:01:26,762 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:01:26,763 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:01:26,764 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:01:26,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:01:26,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:01:26,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:01:26,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:01:26,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:01:26,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:01:26,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:01:26,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:01:26,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:01:26,776 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:01:26,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:01:26,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:01:26,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:01:26,779 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:01:26,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:01:26,780 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:01:26,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:01:26,781 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:01:26,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:01:26,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:01:26,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:01:26,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:01:26,784 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 01:01:26,799 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:01:26,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:01:26,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:01:26,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:01:26,801 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:01:26,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:01:26,801 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:01:26,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:01:26,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:01:26,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:01:26,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:01:26,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:01:26,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:01:26,803 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:01:26,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:01:26,803 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:01:26,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:01:26,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:01:26,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:01:26,804 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:01:26,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:01:26,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:01:26,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:01:26,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:01:26,805 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:01:26,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:01:26,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:01:26,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:01:26,806 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 01:01:27,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:01:27,107 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:01:27,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:01:27,114 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:01:27,114 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:01:27,115 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/stateful_check.c [2019-10-15 01:01:27,193 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5567a1eda/e00f2aa0ea4e4570b003540a744b1c6b/FLAGfb92c2160 [2019-10-15 01:01:27,694 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:01:27,695 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/stateful_check.c [2019-10-15 01:01:27,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5567a1eda/e00f2aa0ea4e4570b003540a744b1c6b/FLAGfb92c2160 [2019-10-15 01:01:28,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5567a1eda/e00f2aa0ea4e4570b003540a744b1c6b [2019-10-15 01:01:28,021 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:01:28,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:01:28,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:01:28,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:01:28,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:01:28,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:01:28" (1/1) ... [2019-10-15 01:01:28,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d5ca97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:28, skipping insertion in model container [2019-10-15 01:01:28,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:01:28" (1/1) ... [2019-10-15 01:01:28,040 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:01:28,062 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:01:28,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:01:28,313 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:01:28,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:01:28,362 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:01:28,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:28 WrapperNode [2019-10-15 01:01:28,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:01:28,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:01:28,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:01:28,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:01:28,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:28" (1/1) ... [2019-10-15 01:01:28,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:28" (1/1) ... [2019-10-15 01:01:28,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:28" (1/1) ... [2019-10-15 01:01:28,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:28" (1/1) ... [2019-10-15 01:01:28,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:28" (1/1) ... [2019-10-15 01:01:28,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:28" (1/1) ... [2019-10-15 01:01:28,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:28" (1/1) ... [2019-10-15 01:01:28,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:01:28,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:01:28,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:01:28,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:01:28,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:28" (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 01:01:28,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:01:28,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:01:28,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2019-10-15 01:01:28,558 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-15 01:01:28,559 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-15 01:01:28,559 INFO L138 BoogieDeclarations]: Found implementation of procedure check_final_state [2019-10-15 01:01:28,559 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_release [2019-10-15 01:01:28,559 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_llseek [2019-10-15 01:01:28,559 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_read [2019-10-15 01:01:28,559 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_open [2019-10-15 01:01:28,559 INFO L138 BoogieDeclarations]: Found implementation of procedure my_init [2019-10-15 01:01:28,560 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:01:28,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:01:28,560 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2019-10-15 01:01:28,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:01:28,560 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-15 01:01:28,561 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-15 01:01:28,561 INFO L130 BoogieDeclarations]: Found specification of procedure check_final_state [2019-10-15 01:01:28,561 INFO L130 BoogieDeclarations]: Found specification of procedure misc_release [2019-10-15 01:01:28,561 INFO L130 BoogieDeclarations]: Found specification of procedure misc_llseek [2019-10-15 01:01:28,561 INFO L130 BoogieDeclarations]: Found specification of procedure misc_read [2019-10-15 01:01:28,561 INFO L130 BoogieDeclarations]: Found specification of procedure misc_open [2019-10-15 01:01:28,562 INFO L130 BoogieDeclarations]: Found specification of procedure my_init [2019-10-15 01:01:28,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:01:28,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:01:28,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:01:28,884 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:01:28,884 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:01:28,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:01:28 BoogieIcfgContainer [2019-10-15 01:01:28,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:01:28,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:01:28,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:01:28,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:01:28,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:01:28" (1/3) ... [2019-10-15 01:01:28,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ab8d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:01:28, skipping insertion in model container [2019-10-15 01:01:28,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:01:28" (2/3) ... [2019-10-15 01:01:28,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ab8d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:01:28, skipping insertion in model container [2019-10-15 01:01:28,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:01:28" (3/3) ... [2019-10-15 01:01:28,895 INFO L109 eAbstractionObserver]: Analyzing ICFG stateful_check.c [2019-10-15 01:01:28,903 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:01:28,909 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:01:28,917 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:01:28,942 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:01:28,942 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:01:28,942 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:01:28,943 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:01:28,943 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:01:28,943 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:01:28,943 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:01:28,943 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:01:28,964 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-10-15 01:01:28,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 01:01:28,971 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:01:28,972 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:01:28,974 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:01:28,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:01:28,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1865767033, now seen corresponding path program 1 times [2019-10-15 01:01:28,990 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:01:28,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455247567] [2019-10-15 01:01:28,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:28,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:28,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:01:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:29,115 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 01:01:29,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455247567] [2019-10-15 01:01:29,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:01:29,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 01:01:29,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624606869] [2019-10-15 01:01:29,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 01:01:29,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:01:29,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 01:01:29,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:01:29,136 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 2 states. [2019-10-15 01:01:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:01:29,174 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2019-10-15 01:01:29,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 01:01:29,175 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-15 01:01:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:01:29,187 INFO L225 Difference]: With dead ends: 135 [2019-10-15 01:01:29,187 INFO L226 Difference]: Without dead ends: 65 [2019-10-15 01:01:29,192 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-15 01:01:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-15 01:01:29,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-10-15 01:01:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-15 01:01:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2019-10-15 01:01:29,239 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 16 [2019-10-15 01:01:29,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:01:29,239 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2019-10-15 01:01:29,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 01:01:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2019-10-15 01:01:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:01:29,241 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:01:29,241 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:01:29,241 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:01:29,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:01:29,242 INFO L82 PathProgramCache]: Analyzing trace with hash 6927045, now seen corresponding path program 1 times [2019-10-15 01:01:29,242 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:01:29,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198724179] [2019-10-15 01:01:29,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:29,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:29,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:01:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:29,308 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 01:01:29,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198724179] [2019-10-15 01:01:29,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:01:29,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:01:29,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222277571] [2019-10-15 01:01:29,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:01:29,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:01:29,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:01:29,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:01:29,313 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand 3 states. [2019-10-15 01:01:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:01:29,363 INFO L93 Difference]: Finished difference Result 108 states and 139 transitions. [2019-10-15 01:01:29,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:01:29,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-15 01:01:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:01:29,369 INFO L225 Difference]: With dead ends: 108 [2019-10-15 01:01:29,369 INFO L226 Difference]: Without dead ends: 102 [2019-10-15 01:01:29,370 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 01:01:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-15 01:01:29,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-10-15 01:01:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-15 01:01:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 132 transitions. [2019-10-15 01:01:29,394 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 132 transitions. Word has length 17 [2019-10-15 01:01:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:01:29,395 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 132 transitions. [2019-10-15 01:01:29,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:01:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 132 transitions. [2019-10-15 01:01:29,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:01:29,397 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:01:29,397 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] [2019-10-15 01:01:29,397 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:01:29,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:01:29,398 INFO L82 PathProgramCache]: Analyzing trace with hash -695621135, now seen corresponding path program 1 times [2019-10-15 01:01:29,398 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:01:29,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426216404] [2019-10-15 01:01:29,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:29,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:29,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:01:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:29,450 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 01:01:29,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426216404] [2019-10-15 01:01:29,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:01:29,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:01:29,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035294114] [2019-10-15 01:01:29,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:01:29,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:01:29,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:01:29,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:01:29,453 INFO L87 Difference]: Start difference. First operand 102 states and 132 transitions. Second operand 3 states. [2019-10-15 01:01:29,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:01:29,525 INFO L93 Difference]: Finished difference Result 218 states and 297 transitions. [2019-10-15 01:01:29,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:01:29,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:01:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:01:29,530 INFO L225 Difference]: With dead ends: 218 [2019-10-15 01:01:29,530 INFO L226 Difference]: Without dead ends: 127 [2019-10-15 01:01:29,531 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 01:01:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-15 01:01:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-10-15 01:01:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-15 01:01:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 169 transitions. [2019-10-15 01:01:29,554 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 169 transitions. Word has length 29 [2019-10-15 01:01:29,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:01:29,555 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 169 transitions. [2019-10-15 01:01:29,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:01:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 169 transitions. [2019-10-15 01:01:29,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 01:01:29,557 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:01:29,557 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:01:29,558 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:01:29,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:01:29,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1328709660, now seen corresponding path program 1 times [2019-10-15 01:01:29,558 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:01:29,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458424183] [2019-10-15 01:01:29,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:29,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:29,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:01:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:01:29,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458424183] [2019-10-15 01:01:29,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128375434] [2019-10-15 01:01:29,658 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 01:01:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:29,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:01:29,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:01:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:01:29,794 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:01:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:01:29,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [185037343] [2019-10-15 01:01:29,860 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 41 [2019-10-15 01:01:29,910 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:01:29,910 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:01:30,053 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 01:01:30,056 INFO L272 AbstractInterpreter]: Visited 27 different actions 36 times. Merged at 8 different actions 8 times. Never widened. Performed 69 root evaluator evaluations with a maximum evaluation depth of 5. Performed 69 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 11 variables. [2019-10-15 01:01:30,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:01:30,060 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-15 01:01:30,174 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 46.98% of their original sizes. [2019-10-15 01:01:30,174 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-15 01:01:30,308 INFO L553 sIntCurrentIteration]: We unified 39 AI predicates to 39 [2019-10-15 01:01:30,308 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-15 01:01:30,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:01:30,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [5, 4, 4] total 19 [2019-10-15 01:01:30,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347774503] [2019-10-15 01:01:30,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-15 01:01:30,311 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-15 01:01:30,311 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-15 01:01:30,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-15 01:01:30,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:01:30,312 INFO L87 Difference]: Start difference. First operand 126 states and 169 transitions. Second operand 15 states. [2019-10-15 01:01:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:01:31,704 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2019-10-15 01:01:31,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:01:31,704 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-10-15 01:01:31,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:01:31,709 INFO L225 Difference]: With dead ends: 291 [2019-10-15 01:01:31,711 INFO L226 Difference]: Without dead ends: 176 [2019-10-15 01:01:31,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-10-15 01:01:31,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-15 01:01:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168. [2019-10-15 01:01:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-15 01:01:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 227 transitions. [2019-10-15 01:01:31,736 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 227 transitions. Word has length 40 [2019-10-15 01:01:31,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:01:31,736 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 227 transitions. [2019-10-15 01:01:31,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-15 01:01:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 227 transitions. [2019-10-15 01:01:31,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 01:01:31,738 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:01:31,739 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:01:31,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:01:31,946 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:01:31,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:01:31,946 INFO L82 PathProgramCache]: Analyzing trace with hash -83945179, now seen corresponding path program 1 times [2019-10-15 01:01:31,946 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:01:31,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920067507] [2019-10-15 01:01:31,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:31,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:31,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:01:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:01:32,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920067507] [2019-10-15 01:01:32,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712590023] [2019-10-15 01:01:32,038 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 01:01:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:32,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:01:32,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:01:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:01:32,096 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:01:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:01:32,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1473026356] [2019-10-15 01:01:32,132 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 41 [2019-10-15 01:01:32,134 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:01:32,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:01:32,145 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 01:01:32,146 INFO L272 AbstractInterpreter]: Visited 27 different actions 36 times. Merged at 8 different actions 8 times. Never widened. Performed 69 root evaluator evaluations with a maximum evaluation depth of 5. Performed 69 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 11 variables. [2019-10-15 01:01:32,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:01:32,146 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-15 01:01:32,168 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 53.78% of their original sizes. [2019-10-15 01:01:32,169 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-15 01:01:32,289 INFO L553 sIntCurrentIteration]: We unified 39 AI predicates to 39 [2019-10-15 01:01:32,289 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-15 01:01:32,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:01:32,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [5, 4, 4] total 19 [2019-10-15 01:01:32,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816219543] [2019-10-15 01:01:32,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-15 01:01:32,291 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-15 01:01:32,291 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-15 01:01:32,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-15 01:01:32,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:01:32,292 INFO L87 Difference]: Start difference. First operand 168 states and 227 transitions. Second operand 15 states. [2019-10-15 01:01:33,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:01:33,279 INFO L93 Difference]: Finished difference Result 367 states and 513 transitions. [2019-10-15 01:01:33,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:01:33,279 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-10-15 01:01:33,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:01:33,282 INFO L225 Difference]: With dead ends: 367 [2019-10-15 01:01:33,283 INFO L226 Difference]: Without dead ends: 210 [2019-10-15 01:01:33,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:01:33,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-15 01:01:33,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2019-10-15 01:01:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-10-15 01:01:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 283 transitions. [2019-10-15 01:01:33,319 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 283 transitions. Word has length 40 [2019-10-15 01:01:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:01:33,320 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 283 transitions. [2019-10-15 01:01:33,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-15 01:01:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 283 transitions. [2019-10-15 01:01:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 01:01:33,323 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:01:33,324 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:01:33,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:01:33,535 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:01:33,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:01:33,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1902321111, now seen corresponding path program 1 times [2019-10-15 01:01:33,536 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:01:33,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174098689] [2019-10-15 01:01:33,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:33,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:33,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:01:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:33,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:01:33,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174098689] [2019-10-15 01:01:33,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:01:33,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:01:33,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278404528] [2019-10-15 01:01:33,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:01:33,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:01:33,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:01:33,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:01:33,621 INFO L87 Difference]: Start difference. First operand 207 states and 283 transitions. Second operand 4 states. [2019-10-15 01:01:33,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:01:33,677 INFO L93 Difference]: Finished difference Result 525 states and 755 transitions. [2019-10-15 01:01:33,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:01:33,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-10-15 01:01:33,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:01:33,680 INFO L225 Difference]: With dead ends: 525 [2019-10-15 01:01:33,681 INFO L226 Difference]: Without dead ends: 329 [2019-10-15 01:01:33,682 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 01:01:33,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-10-15 01:01:33,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 279. [2019-10-15 01:01:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-10-15 01:01:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 402 transitions. [2019-10-15 01:01:33,703 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 402 transitions. Word has length 51 [2019-10-15 01:01:33,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:01:33,704 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 402 transitions. [2019-10-15 01:01:33,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:01:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 402 transitions. [2019-10-15 01:01:33,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 01:01:33,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:01:33,707 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:01:33,708 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:01:33,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:01:33,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1918799396, now seen corresponding path program 1 times [2019-10-15 01:01:33,708 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:01:33,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909095031] [2019-10-15 01:01:33,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:33,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:33,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:01:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:01:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:01:33,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909095031] [2019-10-15 01:01:33,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:01:33,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:01:33,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410291304] [2019-10-15 01:01:33,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:01:33,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:01:33,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:01:33,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:01:33,838 INFO L87 Difference]: Start difference. First operand 279 states and 402 transitions. Second operand 3 states. [2019-10-15 01:01:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:01:33,879 INFO L93 Difference]: Finished difference Result 612 states and 889 transitions. [2019-10-15 01:01:33,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:01:33,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-15 01:01:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:01:33,883 INFO L225 Difference]: With dead ends: 612 [2019-10-15 01:01:33,883 INFO L226 Difference]: Without dead ends: 344 [2019-10-15 01:01:33,884 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 01:01:33,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-10-15 01:01:33,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 338. [2019-10-15 01:01:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-10-15 01:01:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 489 transitions. [2019-10-15 01:01:33,916 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 489 transitions. Word has length 63 [2019-10-15 01:01:33,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:01:33,918 INFO L462 AbstractCegarLoop]: Abstraction has 338 states and 489 transitions. [2019-10-15 01:01:33,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:01:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 489 transitions. [2019-10-15 01:01:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 01:01:33,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:01:33,931 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:01:33,931 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:01:33,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:01:33,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1192820603, now seen corresponding path program 1 times [2019-10-15 01:01:33,934 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:01:33,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272576955] [2019-10-15 01:01:33,934 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:33,934 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:01:33,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:01:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-15 01:01:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-15 01:01:34,026 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-15 01:01:34,026 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-15 01:01:34,048 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-10-15 01:01:34,049 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-10-15 01:01:34,050 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-10-15 01:01:34,051 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-10-15 01:01:34,051 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-10-15 01:01:34,052 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-10-15 01:01:34,052 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-10-15 01:01:34,053 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-10-15 01:01:34,053 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-10-15 01:01:34,054 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-10-15 01:01:34,054 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-10-15 01:01:34,055 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-10-15 01:01:34,055 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-10-15 01:01:34,055 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-10-15 01:01:34,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:01:34 BoogieIcfgContainer [2019-10-15 01:01:34,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:01:34,077 INFO L168 Benchmark]: Toolchain (without parser) took 6053.75 ms. Allocated memory was 142.6 MB in the beginning and 253.8 MB in the end (delta: 111.1 MB). Free memory was 100.7 MB in the beginning and 84.1 MB in the end (delta: 16.6 MB). Peak memory consumption was 127.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:01:34,077 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 142.6 MB. Free memory is still 118.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-15 01:01:34,078 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.56 ms. Allocated memory is still 142.6 MB. Free memory was 100.7 MB in the beginning and 90.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-10-15 01:01:34,079 INFO L168 Benchmark]: Boogie Preprocessor took 132.41 ms. Allocated memory was 142.6 MB in the beginning and 198.7 MB in the end (delta: 56.1 MB). Free memory was 90.0 MB in the beginning and 176.3 MB in the end (delta: -86.3 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:01:34,080 INFO L168 Benchmark]: RCFGBuilder took 389.49 ms. Allocated memory is still 198.7 MB. Free memory was 176.3 MB in the beginning and 156.9 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:01:34,081 INFO L168 Benchmark]: TraceAbstraction took 5187.39 ms. Allocated memory was 198.7 MB in the beginning and 253.8 MB in the end (delta: 55.1 MB). Free memory was 156.9 MB in the beginning and 84.1 MB in the end (delta: 72.8 MB). Peak memory consumption was 127.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:01:34,085 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.24 ms. Allocated memory is still 142.6 MB. Free memory is still 118.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 339.56 ms. Allocated memory is still 142.6 MB. Free memory was 100.7 MB in the beginning and 90.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.41 ms. Allocated memory was 142.6 MB in the beginning and 198.7 MB in the end (delta: 56.1 MB). Free memory was 90.0 MB in the beginning and 176.3 MB in the end (delta: -86.3 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 389.49 ms. Allocated memory is still 198.7 MB. Free memory was 176.3 MB in the beginning and 156.9 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5187.39 ms. Allocated memory was 198.7 MB in the beginning and 253.8 MB in the end (delta: 55.1 MB). Free memory was 156.9 MB in the beginning and 84.1 MB in the end (delta: 72.8 MB). Peak memory consumption was 127.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] int ldv_mutex = 1; [L11] int open_called = 0; VAL [\old(ldv_mutex)=4, \old(open_called)=3, ldv_mutex=1, open_called=0] [L74] int ldv_s_misc_fops_file_operations = 0; VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, ldv_s_misc_fops_file_operations=0, open_called=0] [L75] CALL my_init() VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, open_called=0] [L69] open_called = 0 [L70] return 0; VAL [\old(ldv_mutex)=1, \old(open_called)=0, \result=0, ldv_mutex=1, open_called=0] [L75] RET my_init() VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, ldv_s_misc_fops_file_operations=0, my_init()=0, open_called=0] [L76] COND TRUE __VERIFIER_nondet_int() [L80] case 0: VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=0, ldv_mutex=1, ldv_s_misc_fops_file_operations=0, open_called=0] [L81] COND TRUE ldv_s_misc_fops_file_operations==0 VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=0, ldv_mutex=1, ldv_s_misc_fops_file_operations=0, open_called=0] [L82] CALL misc_open() VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, open_called=0] [L57] COND TRUE __VERIFIER_nondet_int() [L59] return 1; VAL [\old(ldv_mutex)=1, \old(open_called)=0, \result=1, ldv_mutex=1, open_called=0] [L82] RET misc_open() VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=0, ldv_mutex=1, ldv_s_misc_fops_file_operations=0, misc_open()=1, open_called=0] [L83] ldv_s_misc_fops_file_operations++ VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=0, ldv_mutex=1, ldv_s_misc_fops_file_operations=1, open_called=0] [L76] COND TRUE __VERIFIER_nondet_int() [L80] case 0: [L88] case 1: VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=1, ldv_mutex=1, ldv_s_misc_fops_file_operations=1, open_called=0] [L89] COND TRUE ldv_s_misc_fops_file_operations==1 VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=1, ldv_mutex=1, ldv_s_misc_fops_file_operations=1, open_called=0] [L90] CALL misc_read() VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, open_called=0] [L52] return 0; VAL [\old(ldv_mutex)=1, \old(open_called)=0, \result=0, ldv_mutex=1, open_called=0] [L90] RET misc_read() VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=1, ldv_mutex=1, ldv_s_misc_fops_file_operations=1, misc_read()=0, open_called=0] [L91] ldv_s_misc_fops_file_operations++ VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=1, ldv_mutex=1, ldv_s_misc_fops_file_operations=2, open_called=0] [L76] COND TRUE __VERIFIER_nondet_int() [L80] case 0: [L88] case 1: [L96] case 2: VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=2, ldv_mutex=1, ldv_s_misc_fops_file_operations=2, open_called=0] [L97] COND TRUE ldv_s_misc_fops_file_operations==2 VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=2, ldv_mutex=1, ldv_s_misc_fops_file_operations=2, open_called=0] [L98] CALL misc_llseek() VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, open_called=0] [L48] return 0; VAL [\old(ldv_mutex)=1, \old(open_called)=0, \result=0, ldv_mutex=1, open_called=0] [L98] RET misc_llseek() VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=2, ldv_mutex=1, ldv_s_misc_fops_file_operations=2, misc_llseek()=0, open_called=0] [L99] ldv_s_misc_fops_file_operations++ VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=2, ldv_mutex=1, ldv_s_misc_fops_file_operations=3, open_called=0] [L76] COND TRUE __VERIFIER_nondet_int() [L80] case 0: [L88] case 1: [L96] case 2: [L104] case 3: VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=3, ldv_mutex=1, ldv_s_misc_fops_file_operations=3, open_called=0] [L105] COND TRUE ldv_s_misc_fops_file_operations==3 VAL [\old(ldv_mutex)=1, \old(open_called)=0, __VERIFIER_nondet_int()=3, ldv_mutex=1, ldv_s_misc_fops_file_operations=3, open_called=0] [L106] CALL misc_release() VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, open_called=0] [L34] COND FALSE !(\read(open_called)) VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, open_called=0] [L41] CALL mutex_lock() VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, open_called=0] [L16] (ldv_mutex == 1) ? 0 : __blast_assert() VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=1, open_called=0] [L17] ldv_mutex = 2 VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=2, open_called=0] [L41] RET mutex_lock() VAL [\old(ldv_mutex)=1, \old(open_called)=0, ldv_mutex=2, open_called=0] [L42] CALL mutex_lock() VAL [\old(ldv_mutex)=2, \old(open_called)=0, ldv_mutex=2, open_called=0] [L16] (ldv_mutex == 1) ? 0 : __blast_assert() VAL [\old(ldv_mutex)=2, \old(open_called)=0, ldv_mutex=2, open_called=0] [L16] CALL __blast_assert() VAL [\old(ldv_mutex)=2, \old(open_called)=0, ldv_mutex=2, open_called=0] [L4] __VERIFIER_error() VAL [\old(ldv_mutex)=2, \old(open_called)=0, ldv_mutex=2, open_called=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 74 locations, 1 error locations. Result: UNSAFE, OverallTime: 5.1s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 618 SDtfs, 430 SDslu, 1137 SDs, 0 SdLazy, 283 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 68 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 399 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 31627 SizeOfPredicates, 2 NumberOfNonLiveVariables, 233 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 38/56 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 215, ITERATIONS: 2, WAS_STRONG: 2, WEAKENING_RATIO: 1.8874847374847374, AVG_VARS_REMOVED_DURING_WEAKENING: 0.7435897435897436, AVG_WEAKENED_CONJUNCTS: 2.2564102564102564, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...