/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 03:57:18,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 03:57:18,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 03:57:18,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 03:57:18,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 03:57:18,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 03:57:18,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 03:57:18,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 03:57:18,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 03:57:18,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 03:57:18,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 03:57:18,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 03:57:18,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 03:57:18,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 03:57:18,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 03:57:18,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 03:57:18,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 03:57:18,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 03:57:18,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 03:57:18,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 03:57:18,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 03:57:18,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 03:57:18,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 03:57:18,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 03:57:18,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 03:57:18,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 03:57:18,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 03:57:18,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 03:57:18,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 03:57:18,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 03:57:18,634 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 03:57:18,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 03:57:18,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 03:57:18,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 03:57:18,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 03:57:18,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 03:57:18,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 03:57:18,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 03:57:18,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 03:57:18,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 03:57:18,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 03:57:18,642 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 03:57:18,660 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 03:57:18,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 03:57:18,661 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 03:57:18,661 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 03:57:18,662 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 03:57:18,662 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 03:57:18,662 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 03:57:18,662 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 03:57:18,662 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 03:57:18,662 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 03:57:18,663 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 03:57:18,663 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 03:57:18,663 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 03:57:18,663 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 03:57:18,663 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 03:57:18,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 03:57:18,664 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 03:57:18,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 03:57:18,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 03:57:18,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 03:57:18,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 03:57:18,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 03:57:18,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 03:57:18,666 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 03:57:18,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 03:57:18,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 03:57:18,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 03:57:18,667 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 03:57:18,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 03:57:18,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 03:57:18,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 03:57:18,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 03:57:18,668 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 03:57:18,668 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 03:57:18,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 03:57:18,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 03:57:18,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 03:57:18,668 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 03:57:18,965 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 03:57:18,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 03:57:18,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 03:57:18,989 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 03:57:18,989 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 03:57:18,990 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i [2019-11-24 03:57:19,050 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54c3b0a00/0fa338e6154344ac94485c79c95ec718/FLAG188f15f7d [2019-11-24 03:57:19,584 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 03:57:19,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i [2019-11-24 03:57:19,601 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54c3b0a00/0fa338e6154344ac94485c79c95ec718/FLAG188f15f7d [2019-11-24 03:57:19,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54c3b0a00/0fa338e6154344ac94485c79c95ec718 [2019-11-24 03:57:19,918 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 03:57:19,919 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 03:57:19,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 03:57:19,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 03:57:19,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 03:57:19,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:57:19" (1/1) ... [2019-11-24 03:57:19,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1905c6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:19, skipping insertion in model container [2019-11-24 03:57:19,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:57:19" (1/1) ... [2019-11-24 03:57:19,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 03:57:19,998 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 03:57:20,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:57:20,476 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 03:57:20,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:57:20,600 INFO L208 MainTranslator]: Completed translation [2019-11-24 03:57:20,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:20 WrapperNode [2019-11-24 03:57:20,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 03:57:20,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 03:57:20,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 03:57:20,602 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 03:57:20,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:20" (1/1) ... [2019-11-24 03:57:20,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:20" (1/1) ... [2019-11-24 03:57:20,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 03:57:20,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 03:57:20,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 03:57:20,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 03:57:20,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:20" (1/1) ... [2019-11-24 03:57:20,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:20" (1/1) ... [2019-11-24 03:57:20,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:20" (1/1) ... [2019-11-24 03:57:20,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:20" (1/1) ... [2019-11-24 03:57:20,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:20" (1/1) ... [2019-11-24 03:57:20,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:20" (1/1) ... [2019-11-24 03:57:20,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:20" (1/1) ... [2019-11-24 03:57:20,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 03:57:20,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 03:57:20,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 03:57:20,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 03:57:20,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:20" (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-11-24 03:57:20,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 03:57:20,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 03:57:20,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 03:57:20,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 03:57:20,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 03:57:20,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 03:57:20,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 03:57:20,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 03:57:22,142 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 03:57:22,142 INFO L284 CfgBuilder]: Removed 62 assume(true) statements. [2019-11-24 03:57:22,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:57:22 BoogieIcfgContainer [2019-11-24 03:57:22,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 03:57:22,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 03:57:22,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 03:57:22,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 03:57:22,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 03:57:19" (1/3) ... [2019-11-24 03:57:22,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4091bed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:57:22, skipping insertion in model container [2019-11-24 03:57:22,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:20" (2/3) ... [2019-11-24 03:57:22,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4091bed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:57:22, skipping insertion in model container [2019-11-24 03:57:22,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:57:22" (3/3) ... [2019-11-24 03:57:22,152 INFO L109 eAbstractionObserver]: Analyzing ICFG test_mutex_unlock_at_exit.i [2019-11-24 03:57:22,162 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 03:57:22,172 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-24 03:57:22,185 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-24 03:57:22,216 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 03:57:22,217 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 03:57:22,217 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 03:57:22,217 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 03:57:22,217 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 03:57:22,218 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 03:57:22,218 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 03:57:22,218 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 03:57:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-11-24 03:57:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-24 03:57:22,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:22,250 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-24 03:57:22,251 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:22,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:22,258 INFO L82 PathProgramCache]: Analyzing trace with hash 239101669, now seen corresponding path program 1 times [2019-11-24 03:57:22,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:22,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278220584] [2019-11-24 03:57:22,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:57:22,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278220584] [2019-11-24 03:57:22,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:57:22,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:57:22,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491730016] [2019-11-24 03:57:22,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:57:22,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:22,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:57:22,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:57:22,543 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 4 states. [2019-11-24 03:57:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:22,723 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-11-24 03:57:22,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:57:22,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-11-24 03:57:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:22,738 INFO L225 Difference]: With dead ends: 82 [2019-11-24 03:57:22,738 INFO L226 Difference]: Without dead ends: 49 [2019-11-24 03:57:22,742 INFO L630 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-11-24 03:57:22,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-24 03:57:22,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2019-11-24 03:57:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-24 03:57:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2019-11-24 03:57:22,805 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 5 [2019-11-24 03:57:22,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:22,806 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-11-24 03:57:22,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:57:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2019-11-24 03:57:22,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-24 03:57:22,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:22,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-24 03:57:22,808 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:22,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:22,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1388646432, now seen corresponding path program 1 times [2019-11-24 03:57:22,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:22,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177385758] [2019-11-24 03:57:22,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:57:22,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177385758] [2019-11-24 03:57:22,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:57:22,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:57:22,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341918728] [2019-11-24 03:57:22,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:57:22,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:22,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:57:22,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:57:22,940 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand 3 states. [2019-11-24 03:57:23,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:23,014 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2019-11-24 03:57:23,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:57:23,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-24 03:57:23,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:23,015 INFO L225 Difference]: With dead ends: 66 [2019-11-24 03:57:23,015 INFO L226 Difference]: Without dead ends: 31 [2019-11-24 03:57:23,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-24 03:57:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-24 03:57:23,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-24 03:57:23,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 03:57:23,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-11-24 03:57:23,023 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 6 [2019-11-24 03:57:23,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:23,023 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-11-24 03:57:23,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:57:23,023 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2019-11-24 03:57:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 03:57:23,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:23,024 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:57:23,025 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:23,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:23,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1937926445, now seen corresponding path program 1 times [2019-11-24 03:57:23,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:23,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638694719] [2019-11-24 03:57:23,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:57:23,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638694719] [2019-11-24 03:57:23,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:57:23,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 03:57:23,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490176440] [2019-11-24 03:57:23,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 03:57:23,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:23,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 03:57:23,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-24 03:57:23,416 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 7 states. [2019-11-24 03:57:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:23,788 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2019-11-24 03:57:23,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 03:57:23,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-24 03:57:23,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:23,791 INFO L225 Difference]: With dead ends: 56 [2019-11-24 03:57:23,791 INFO L226 Difference]: Without dead ends: 37 [2019-11-24 03:57:23,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-24 03:57:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-24 03:57:23,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2019-11-24 03:57:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-24 03:57:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2019-11-24 03:57:23,803 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 12 [2019-11-24 03:57:23,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:23,804 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-11-24 03:57:23,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 03:57:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2019-11-24 03:57:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 03:57:23,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:23,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:57:23,807 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:23,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:23,808 INFO L82 PathProgramCache]: Analyzing trace with hash -557807987, now seen corresponding path program 1 times [2019-11-24 03:57:23,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:23,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935903793] [2019-11-24 03:57:23,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:57:24,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935903793] [2019-11-24 03:57:24,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:57:24,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:57:24,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31869355] [2019-11-24 03:57:24,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 03:57:24,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:24,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 03:57:24,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 03:57:24,041 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 5 states. [2019-11-24 03:57:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:24,177 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2019-11-24 03:57:24,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:57:24,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-24 03:57:24,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:24,179 INFO L225 Difference]: With dead ends: 61 [2019-11-24 03:57:24,179 INFO L226 Difference]: Without dead ends: 32 [2019-11-24 03:57:24,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 03:57:24,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-24 03:57:24,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-24 03:57:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-24 03:57:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-11-24 03:57:24,185 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 13 [2019-11-24 03:57:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:24,186 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-24 03:57:24,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 03:57:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-11-24 03:57:24,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 03:57:24,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:24,187 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:57:24,187 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:24,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:24,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2069532135, now seen corresponding path program 1 times [2019-11-24 03:57:24,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:24,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313351342] [2019-11-24 03:57:24,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:57:24,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313351342] [2019-11-24 03:57:24,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116563287] [2019-11-24 03:57:24,399 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-11-24 03:57:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:24,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-24 03:57:24,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 03:57:24,686 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-24 03:57:24,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 03:57:24,802 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-24 03:57:24,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 03:57:24,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:24,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:24,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:25,033 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-11-24 03:57:25,033 INFO L343 Elim1Store]: treesize reduction 66, result has 78.7 percent of original size [2019-11-24 03:57:25,034 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 538 treesize of output 530 [2019-11-24 03:57:25,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 03:57:25,205 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-11-24 03:57:25,206 INFO L567 ElimStorePlain]: treesize reduction 287, result has 56.0 percent of original size [2019-11-24 03:57:25,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:25,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:25,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:25,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:25,236 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-24 03:57:25,255 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 03:57:25,256 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 83 [2019-11-24 03:57:25,257 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 03:57:25,360 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-11-24 03:57:25,362 INFO L567 ElimStorePlain]: treesize reduction 22, result has 83.8 percent of original size [2019-11-24 03:57:25,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 03:57:25,364 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:661, output treesize:129 [2019-11-24 03:57:25,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:25,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:25,487 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 03:57:25,487 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 125 [2019-11-24 03:57:25,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 03:57:25,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 03:57:25,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 03:57:25,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 03:57:25,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 03:57:25,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 03:57:25,502 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 03:57:25,546 INFO L567 ElimStorePlain]: treesize reduction 40, result has 62.3 percent of original size [2019-11-24 03:57:25,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:25,565 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 03:57:25,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 50 [2019-11-24 03:57:25,567 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 03:57:25,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 03:57:25,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 03:57:25,579 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:145, output treesize:15 [2019-11-24 03:57:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:57:25,599 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 03:57:25,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 03:57:25,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 03:57:25,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 03:57:25,685 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 938 treesize of output 936 [2019-11-24 03:57:25,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 03:57:25,963 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-11-24 03:57:25,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 03:57:26,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 938 treesize of output 936 [2019-11-24 03:57:26,015 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 03:57:26,282 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-24 03:57:26,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 03:57:26,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2019-11-24 03:57:26,285 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:1915, output treesize:1903 [2019-11-24 03:57:34,986 WARN L192 SmtUtils]: Spent 8.58 s on a formula simplification that was a NOOP. DAG size: 118 [2019-11-24 03:57:37,398 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-24 03:57:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:57:45,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [407245694] [2019-11-24 03:57:45,823 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-11-24 03:57:45,823 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 03:57:45,829 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 03:57:45,836 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 03:57:45,837 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 03:57:45,925 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 03:57:46,108 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 03:57:46,759 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 222 [2019-11-24 03:57:47,180 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 03:57:47,727 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 107 [2019-11-24 03:57:48,215 WARN L192 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 108 [2019-11-24 03:57:48,712 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 110 [2019-11-24 03:57:49,378 WARN L192 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 123 [2019-11-24 03:57:50,023 WARN L192 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 124 [2019-11-24 03:57:50,218 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-24 03:57:50,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-24 03:57:50,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2019-11-24 03:57:50,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964646684] [2019-11-24 03:57:50,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-24 03:57:50,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:50,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-24 03:57:50,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=346, Unknown=5, NotChecked=0, Total=462 [2019-11-24 03:57:50,221 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 14 states. [2019-11-24 03:57:51,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:51,447 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2019-11-24 03:57:51,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 03:57:51,449 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-11-24 03:57:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:51,449 INFO L225 Difference]: With dead ends: 60 [2019-11-24 03:57:51,449 INFO L226 Difference]: Without dead ends: 37 [2019-11-24 03:57:51,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=156, Invalid=439, Unknown=5, NotChecked=0, Total=600 [2019-11-24 03:57:51,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-24 03:57:51,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-11-24 03:57:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-24 03:57:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-24 03:57:51,454 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 14 [2019-11-24 03:57:51,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:51,455 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-24 03:57:51,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-24 03:57:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-11-24 03:57:51,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 03:57:51,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:51,456 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:57:51,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 03:57:51,658 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:51,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:51,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1529706005, now seen corresponding path program 1 times [2019-11-24 03:57:51,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:51,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321289538] [2019-11-24 03:57:51,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:51,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 03:57:51,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321289538] [2019-11-24 03:57:51,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:57:51,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 03:57:51,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014190128] [2019-11-24 03:57:51,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 03:57:51,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:51,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 03:57:51,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-24 03:57:51,810 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 8 states. [2019-11-24 03:57:52,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:52,287 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2019-11-24 03:57:52,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 03:57:52,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-24 03:57:52,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:52,291 INFO L225 Difference]: With dead ends: 93 [2019-11-24 03:57:52,292 INFO L226 Difference]: Without dead ends: 84 [2019-11-24 03:57:52,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-24 03:57:52,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-24 03:57:52,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 30. [2019-11-24 03:57:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-24 03:57:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-11-24 03:57:52,300 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2019-11-24 03:57:52,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:52,301 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-11-24 03:57:52,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 03:57:52,301 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-11-24 03:57:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 03:57:52,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:52,302 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:57:52,302 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:52,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:52,302 INFO L82 PathProgramCache]: Analyzing trace with hash 93751867, now seen corresponding path program 1 times [2019-11-24 03:57:52,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:52,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352209166] [2019-11-24 03:57:52,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 03:57:52,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352209166] [2019-11-24 03:57:52,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:57:52,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:57:52,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641560162] [2019-11-24 03:57:52,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:57:52,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:52,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:57:52,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:57:52,354 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 4 states. [2019-11-24 03:57:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:52,464 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-11-24 03:57:52,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:57:52,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-24 03:57:52,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:52,465 INFO L225 Difference]: With dead ends: 40 [2019-11-24 03:57:52,465 INFO L226 Difference]: Without dead ends: 38 [2019-11-24 03:57:52,466 INFO L630 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-11-24 03:57:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-24 03:57:52,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-11-24 03:57:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-24 03:57:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-11-24 03:57:52,471 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 20 [2019-11-24 03:57:52,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:52,472 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-24 03:57:52,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:57:52,472 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-11-24 03:57:52,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 03:57:52,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:52,473 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:57:52,473 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:52,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:52,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1879988529, now seen corresponding path program 1 times [2019-11-24 03:57:52,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:52,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163870378] [2019-11-24 03:57:52,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 03:57:52,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163870378] [2019-11-24 03:57:52,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:57:52,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 03:57:52,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379417388] [2019-11-24 03:57:52,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 03:57:52,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:52,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 03:57:52,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-24 03:57:52,789 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 10 states. [2019-11-24 03:57:53,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:53,279 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2019-11-24 03:57:53,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 03:57:53,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-24 03:57:53,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:53,282 INFO L225 Difference]: With dead ends: 74 [2019-11-24 03:57:53,282 INFO L226 Difference]: Without dead ends: 59 [2019-11-24 03:57:53,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-24 03:57:53,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-24 03:57:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2019-11-24 03:57:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 03:57:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-24 03:57:53,291 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2019-11-24 03:57:53,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:53,291 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-24 03:57:53,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 03:57:53,291 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-24 03:57:53,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 03:57:53,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:53,292 INFO L410 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] [2019-11-24 03:57:53,292 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:53,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:53,292 INFO L82 PathProgramCache]: Analyzing trace with hash 287687285, now seen corresponding path program 1 times [2019-11-24 03:57:53,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:53,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216446647] [2019-11-24 03:57:53,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 03:57:53,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216446647] [2019-11-24 03:57:53,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:57:53,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 03:57:53,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575883718] [2019-11-24 03:57:53,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 03:57:53,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:53,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 03:57:53,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 03:57:53,608 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 8 states. [2019-11-24 03:57:53,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:53,977 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-11-24 03:57:53,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 03:57:53,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-24 03:57:53,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:53,979 INFO L225 Difference]: With dead ends: 47 [2019-11-24 03:57:53,979 INFO L226 Difference]: Without dead ends: 32 [2019-11-24 03:57:53,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-24 03:57:53,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-24 03:57:53,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-24 03:57:53,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-24 03:57:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-11-24 03:57:54,000 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2019-11-24 03:57:54,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:54,002 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-24 03:57:54,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 03:57:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-11-24 03:57:54,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 03:57:54,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:54,004 INFO L410 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] [2019-11-24 03:57:54,004 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:54,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:54,007 INFO L82 PathProgramCache]: Analyzing trace with hash -404197109, now seen corresponding path program 1 times [2019-11-24 03:57:54,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:54,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27546487] [2019-11-24 03:57:54,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 03:57:54,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27546487] [2019-11-24 03:57:54,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455570119] [2019-11-24 03:57:54,528 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-11-24 03:57:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:54,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-24 03:57:54,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 03:57:54,660 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 03:57:56,176 WARN L192 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2019-11-24 03:57:56,753 WARN L192 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-11-24 03:57:57,048 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-11-24 03:57:57,773 WARN L192 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 121 [2019-11-24 03:57:57,981 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-11-24 03:57:58,466 WARN L192 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 121 [2019-11-24 03:57:58,691 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-24 03:57:58,955 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-11-24 03:57:59,254 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-24 03:57:59,559 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-11-24 03:57:59,667 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-24 03:57:59,778 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-24 03:58:00,290 WARN L192 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-24 03:58:00,808 WARN L192 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-24 03:58:02,273 WARN L192 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 115 DAG size of output: 109 [2019-11-24 03:58:02,862 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-11-24 03:58:03,741 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 82 [2019-11-24 03:58:03,908 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 54 [2019-11-24 03:58:04,629 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-24 03:58:04,798 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 30 [2019-11-24 03:58:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 03:58:04,863 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 03:58:07,943 WARN L192 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-11-24 03:58:08,636 WARN L192 SmtUtils]: Spent 629.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2019-11-24 03:58:09,057 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 94 [2019-11-24 03:58:09,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 03:58:09,592 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-24 03:58:09,598 INFO L168 Benchmark]: Toolchain (without parser) took 49678.80 ms. Allocated memory was 146.3 MB in the beginning and 414.7 MB in the end (delta: 268.4 MB). Free memory was 101.6 MB in the beginning and 86.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 283.2 MB. Max. memory is 7.1 GB. [2019-11-24 03:58:09,599 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-24 03:58:09,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 680.97 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 164.5 MB in the end (delta: -63.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-11-24 03:58:09,600 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.79 ms. Allocated memory is still 203.4 MB. Free memory was 164.5 MB in the beginning and 161.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-11-24 03:58:09,600 INFO L168 Benchmark]: Boogie Preprocessor took 60.44 ms. Allocated memory is still 203.4 MB. Free memory was 161.3 MB in the beginning and 158.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-11-24 03:58:09,603 INFO L168 Benchmark]: RCFGBuilder took 1404.55 ms. Allocated memory was 203.4 MB in the beginning and 237.0 MB in the end (delta: 33.6 MB). Free memory was 158.0 MB in the beginning and 162.3 MB in the end (delta: -4.3 MB). Peak memory consumption was 74.2 MB. Max. memory is 7.1 GB. [2019-11-24 03:58:09,604 INFO L168 Benchmark]: TraceAbstraction took 47451.02 ms. Allocated memory was 237.0 MB in the beginning and 414.7 MB in the end (delta: 177.7 MB). Free memory was 160.9 MB in the beginning and 86.9 MB in the end (delta: 74.0 MB). Peak memory consumption was 251.7 MB. Max. memory is 7.1 GB. [2019-11-24 03:58:09,607 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.27 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 680.97 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 164.5 MB in the end (delta: -63.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.79 ms. Allocated memory is still 203.4 MB. Free memory was 164.5 MB in the beginning and 161.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.44 ms. Allocated memory is still 203.4 MB. Free memory was 161.3 MB in the beginning and 158.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1404.55 ms. Allocated memory was 203.4 MB in the beginning and 237.0 MB in the end (delta: 33.6 MB). Free memory was 158.0 MB in the beginning and 162.3 MB in the end (delta: -4.3 MB). Peak memory consumption was 74.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47451.02 ms. Allocated memory was 237.0 MB in the beginning and 414.7 MB in the end (delta: 177.7 MB). Free memory was 160.9 MB in the beginning and 86.9 MB in the end (delta: 74.0 MB). Peak memory consumption was 251.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...