/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/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:57:42,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:57:42,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:57:42,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:57:42,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:57:42,781 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:57:42,783 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:57:42,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:57:42,796 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:57:42,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:57:42,799 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:57:42,801 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:57:42,801 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:57:42,802 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:57:42,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:57:42,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:57:42,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:57:42,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:57:42,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:57:42,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:57:42,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:57:42,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:57:42,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:57:42,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:57:42,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:57:42,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:57:42,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:57:42,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:57:42,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:57:42,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:57:42,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:57:42,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:57:42,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:57:42,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:57:42,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:57:42,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:57:42,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:57:42,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:57:42,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:57:42,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:57:42,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:57:42,847 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-11-23 21:57:42,868 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:57:42,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:57:42,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:57:42,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:57:42,871 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:57:42,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:57:42,871 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:57:42,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:57:42,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:57:42,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:57:42,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:57:42,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:57:42,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:57:42,874 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:57:42,874 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:57:42,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:57:42,874 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:57:42,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:57:42,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:57:42,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:57:42,875 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:57:42,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:57:42,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:57:42,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:57:42,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:57:42,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:57:42,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:57:42,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:57:42,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:57:42,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:57:43,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:57:43,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:57:43,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:57:43,167 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:57:43,167 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:57:43,169 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i [2019-11-23 21:57:43,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34a02b9ba/2d7e0e0b589a47b89c1bad7d4d0af7f5/FLAGd7b3e71ac [2019-11-23 21:57:43,803 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:57:43,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i [2019-11-23 21:57:43,815 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34a02b9ba/2d7e0e0b589a47b89c1bad7d4d0af7f5/FLAGd7b3e71ac [2019-11-23 21:57:44,103 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34a02b9ba/2d7e0e0b589a47b89c1bad7d4d0af7f5 [2019-11-23 21:57:44,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:57:44,113 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:57:44,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:57:44,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:57:44,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:57:44,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4027b29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44, skipping insertion in model container [2019-11-23 21:57:44,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:57:44,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:57:44,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:57:44,695 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:57:44,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:57:44,823 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:57:44,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44 WrapperNode [2019-11-23 21:57:44,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:57:44,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:57:44,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:57:44,825 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:57:44,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:57:44,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:57:44,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:57:44,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:57:44,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:57:44,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:57:44,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:57:44,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:57:44,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (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-23 21:57:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:57:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:57:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 21:57:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 21:57:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 21:57:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 21:57:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:57:44,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:57:45,392 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:57:45,392 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-23 21:57:45,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:57:45 BoogieIcfgContainer [2019-11-23 21:57:45,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:57:45,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:57:45,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:57:45,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:57:45,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:57:44" (1/3) ... [2019-11-23 21:57:45,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf3a1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:57:45, skipping insertion in model container [2019-11-23 21:57:45,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (2/3) ... [2019-11-23 21:57:45,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf3a1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:57:45, skipping insertion in model container [2019-11-23 21:57:45,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:57:45" (3/3) ... [2019-11-23 21:57:45,401 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2019-11-23 21:57:45,409 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:57:45,416 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:57:45,426 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:57:45,446 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:57:45,446 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:57:45,447 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:57:45,447 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:57:45,447 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:57:45,447 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:57:45,447 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:57:45,448 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:57:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-23 21:57:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-23 21:57:45,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:45,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:45,469 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:45,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:45,475 INFO L82 PathProgramCache]: Analyzing trace with hash 742134712, now seen corresponding path program 1 times [2019-11-23 21:57:45,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:45,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167573116] [2019-11-23 21:57:45,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:45,699 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-23 21:57:45,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167573116] [2019-11-23 21:57:45,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:45,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:57:45,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175506596] [2019-11-23 21:57:45,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:57:45,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:45,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:57:45,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:57:45,718 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-11-23 21:57:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:45,756 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2019-11-23 21:57:45,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:57:45,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-23 21:57:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:45,774 INFO L225 Difference]: With dead ends: 43 [2019-11-23 21:57:45,774 INFO L226 Difference]: Without dead ends: 21 [2019-11-23 21:57:45,778 INFO L630 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-11-23 21:57:45,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-23 21:57:45,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-23 21:57:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-23 21:57:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-23 21:57:45,813 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2019-11-23 21:57:45,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:45,813 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-23 21:57:45,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:57:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-11-23 21:57:45,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 21:57:45,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:45,815 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:45,815 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:45,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:45,816 INFO L82 PathProgramCache]: Analyzing trace with hash -60440637, now seen corresponding path program 1 times [2019-11-23 21:57:45,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:45,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445939611] [2019-11-23 21:57:45,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:45,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445939611] [2019-11-23 21:57:45,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889921931] [2019-11-23 21:57:45,947 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-23 21:57:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:46,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 21:57:46,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:46,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:46,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-23 21:57:46,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446014362] [2019-11-23 21:57:46,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:57:46,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:46,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:57:46,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:57:46,111 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 5 states. [2019-11-23 21:57:46,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:46,162 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-11-23 21:57:46,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:57:46,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-23 21:57:46,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:46,164 INFO L225 Difference]: With dead ends: 35 [2019-11-23 21:57:46,164 INFO L226 Difference]: Without dead ends: 24 [2019-11-23 21:57:46,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:57:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-23 21:57:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-11-23 21:57:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-23 21:57:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-23 21:57:46,178 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 13 [2019-11-23 21:57:46,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:46,178 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-23 21:57:46,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:57:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-11-23 21:57:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 21:57:46,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:46,181 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:46,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:46,386 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:46,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:46,386 INFO L82 PathProgramCache]: Analyzing trace with hash 500274136, now seen corresponding path program 2 times [2019-11-23 21:57:46,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:46,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303714475] [2019-11-23 21:57:46,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:46,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303714475] [2019-11-23 21:57:46,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036407420] [2019-11-23 21:57:46,525 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-23 21:57:46,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:57:46,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:46,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-23 21:57:46,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:46,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:46,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-23 21:57:46,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471315513] [2019-11-23 21:57:46,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:57:46,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:46,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:57:46,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:57:46,636 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-11-23 21:57:46,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:46,678 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-11-23 21:57:46,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:57:46,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-23 21:57:46,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:46,680 INFO L225 Difference]: With dead ends: 38 [2019-11-23 21:57:46,680 INFO L226 Difference]: Without dead ends: 27 [2019-11-23 21:57:46,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:57:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-23 21:57:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-23 21:57:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-23 21:57:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-23 21:57:46,686 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2019-11-23 21:57:46,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:46,686 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-23 21:57:46,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:57:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-11-23 21:57:46,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 21:57:46,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:46,687 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:46,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:46,891 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:46,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:46,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1626262435, now seen corresponding path program 3 times [2019-11-23 21:57:46,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:46,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638774360] [2019-11-23 21:57:46,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:47,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638774360] [2019-11-23 21:57:47,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055696140] [2019-11-23 21:57:47,040 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:47,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 21:57:47,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:47,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-23 21:57:47,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:47,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:47,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-23 21:57:47,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593303293] [2019-11-23 21:57:47,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:57:47,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:47,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:57:47,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:57:47,315 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 7 states. [2019-11-23 21:57:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:47,362 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2019-11-23 21:57:47,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:57:47,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-23 21:57:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:47,363 INFO L225 Difference]: With dead ends: 39 [2019-11-23 21:57:47,364 INFO L226 Difference]: Without dead ends: 28 [2019-11-23 21:57:47,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:57:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-23 21:57:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-23 21:57:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-23 21:57:47,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-11-23 21:57:47,369 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 19 [2019-11-23 21:57:47,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:47,369 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-23 21:57:47,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:57:47,370 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-11-23 21:57:47,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 21:57:47,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:47,371 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:47,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:47,583 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:47,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:47,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2045871112, now seen corresponding path program 4 times [2019-11-23 21:57:47,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:47,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690413186] [2019-11-23 21:57:47,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 21:57:47,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690413186] [2019-11-23 21:57:47,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663334537] [2019-11-23 21:57:47,950 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:57,130 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 21:57:57,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:57,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-23 21:57:57,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:57,231 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:57:57,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:57,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:57,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:57,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:57:57,334 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:57,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:57:57,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:57,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:57,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:57,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-23 21:57:57,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-11-23 21:57:57,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:57,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:57,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:57,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:17 [2019-11-23 21:57:57,482 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-23 21:57:57,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:57,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2019-11-23 21:57:57,506 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:57,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:57,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:57,515 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:14 [2019-11-23 21:57:57,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:57:57,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:57,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:57,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:57,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-23 21:57:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 21:57:57,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:57,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-23 21:57:57,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541250635] [2019-11-23 21:57:57,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 21:57:57,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:57,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 21:57:57,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-11-23 21:57:57,606 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 18 states. [2019-11-23 21:57:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:58,051 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-11-23 21:57:58,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 21:57:58,052 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-11-23 21:57:58,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:58,053 INFO L225 Difference]: With dead ends: 36 [2019-11-23 21:57:58,054 INFO L226 Difference]: Without dead ends: 34 [2019-11-23 21:57:58,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-11-23 21:57:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-23 21:57:58,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-11-23 21:57:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-23 21:57:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-23 21:57:58,061 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2019-11-23 21:57:58,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:58,062 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-23 21:57:58,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 21:57:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-23 21:57:58,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 21:57:58,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:58,063 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:58,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:58,269 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:58,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:58,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1335739081, now seen corresponding path program 1 times [2019-11-23 21:57:58,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:58,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147927951] [2019-11-23 21:57:58,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:58,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147927951] [2019-11-23 21:57:58,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005266342] [2019-11-23 21:57:58,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:58,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 81 conjunts are in the unsatisfiable core [2019-11-23 21:57:58,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:59,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:57:59,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:59,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:59,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:59,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:57:59,091 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:59,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:57:59,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:59,114 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-23 21:57:59,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:59,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2019-11-23 21:57:59,198 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:59,199 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-23 21:57:59,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:59,257 INFO L567 ElimStorePlain]: treesize reduction 28, result has 54.8 percent of original size [2019-11-23 21:57:59,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:59,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:34 [2019-11-23 21:57:59,419 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:59,420 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 99 [2019-11-23 21:57:59,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:59,515 INFO L567 ElimStorePlain]: treesize reduction 42, result has 56.3 percent of original size [2019-11-23 21:57:59,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:59,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:54 [2019-11-23 21:57:59,597 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-11-23 21:57:59,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:59,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:59,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:59,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:89, output treesize:61 [2019-11-23 21:57:59,711 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:59,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 48 [2019-11-23 21:57:59,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:59,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:59,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:59,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:32 [2019-11-23 21:57:59,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2019-11-23 21:57:59,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:59,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:59,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:57:59,901 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:59,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:59,953 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:59,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:59,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2019-11-23 21:57:59,999 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2019-11-23 21:58:00,049 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:00,088 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,118 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:130, output treesize:74 [2019-11-23 21:58:00,189 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_27|], 5=[|v_#memory_int_29|, |v_#memory_$Pointer$.base_20|, |v_#memory_$Pointer$.offset_20|]} [2019-11-23 21:58:00,192 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-23 21:58:00,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2019-11-23 21:58:00,270 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,370 INFO L343 Elim1Store]: treesize reduction 3, result has 94.4 percent of original size [2019-11-23 21:58:00,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 102 [2019-11-23 21:58:00,372 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,498 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-11-23 21:58:00,500 INFO L567 ElimStorePlain]: treesize reduction 75, result has 61.9 percent of original size [2019-11-23 21:58:00,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:00,509 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2019-11-23 21:58:00,511 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,579 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:170, output treesize:108 [2019-11-23 21:58:00,726 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 3=[|v_#memory_int_30|], 9=[|v_#memory_$Pointer$.offset_21|, |v_#memory_$Pointer$.base_21|]} [2019-11-23 21:58:00,734 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-23 21:58:00,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,783 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:00,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:00,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2019-11-23 21:58:00,829 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:00,869 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 43 [2019-11-23 21:58:00,876 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_30], 1=[v_arrayElimCell_31]} [2019-11-23 21:58:00,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-23 21:58:00,882 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,896 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2019-11-23 21:58:00,897 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:00,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,903 INFO L496 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:00,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,938 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 78 [2019-11-23 21:58:00,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:00,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:00,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:00,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:00,953 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_38, v_arrayElimCell_36], 1=[v_arrayElimCell_37]} [2019-11-23 21:58:01,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:01,159 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.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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) 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-23 21:58:01,170 INFO L168 Benchmark]: Toolchain (without parser) took 17053.17 ms. Allocated memory was 146.8 MB in the beginning and 276.8 MB in the end (delta: 130.0 MB). Free memory was 101.9 MB in the beginning and 183.8 MB in the end (delta: -81.9 MB). Peak memory consumption was 48.2 MB. Max. memory is 7.1 GB. [2019-11-23 21:58:01,173 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 21:58:01,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 710.37 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 170.3 MB in the end (delta: -68.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-11-23 21:58:01,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.39 ms. Allocated memory is still 204.5 MB. Free memory was 170.3 MB in the beginning and 168.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-11-23 21:58:01,178 INFO L168 Benchmark]: Boogie Preprocessor took 49.87 ms. Allocated memory is still 204.5 MB. Free memory was 168.4 MB in the beginning and 166.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-11-23 21:58:01,180 INFO L168 Benchmark]: RCFGBuilder took 469.24 ms. Allocated memory is still 204.5 MB. Free memory was 166.5 MB in the beginning and 146.0 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-11-23 21:58:01,180 INFO L168 Benchmark]: TraceAbstraction took 15769.47 ms. Allocated memory was 204.5 MB in the beginning and 276.8 MB in the end (delta: 72.4 MB). Free memory was 145.3 MB in the beginning and 183.8 MB in the end (delta: -38.5 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. [2019-11-23 21:58:01,188 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.50 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 710.37 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 170.3 MB in the end (delta: -68.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.39 ms. Allocated memory is still 204.5 MB. Free memory was 170.3 MB in the beginning and 168.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.87 ms. Allocated memory is still 204.5 MB. Free memory was 168.4 MB in the beginning and 166.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 469.24 ms. Allocated memory is still 204.5 MB. Free memory was 166.5 MB in the beginning and 146.0 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15769.47 ms. Allocated memory was 204.5 MB in the beginning and 276.8 MB in the end (delta: 72.4 MB). Free memory was 145.3 MB in the beginning and 183.8 MB in the end (delta: -38.5 MB). Peak memory consumption was 33.9 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...