/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:05:04,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:05:04,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:05:04,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:05:04,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:05:04,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:05:04,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:05:04,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:05:04,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:05:04,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:05:04,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:05:04,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:05:04,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:05:04,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:05:04,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:05:04,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:05:04,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:05:04,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:05:04,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:05:04,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:05:04,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:05:04,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:05:04,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:05:04,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:05:04,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:05:04,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:05:04,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:05:04,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:05:04,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:05:04,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:05:04,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:05:04,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:05:04,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:05:04,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:05:04,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:05:04,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:05:04,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:05:04,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:05:04,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:05:04,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:05:04,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:05:04,724 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 06:05:04,751 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:05:04,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:05:04,752 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:05:04,752 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:05:04,753 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:05:04,753 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:05:04,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:05:04,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:05:04,753 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:05:04,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:05:04,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:05:04,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:05:04,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:05:04,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:05:04,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:05:04,755 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:05:04,755 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:05:04,755 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:05:04,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:05:04,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:05:04,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:05:04,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:05:04,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:05:04,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:05:04,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:05:04,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:05:04,756 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:05:04,756 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:05:04,757 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:05:04,757 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:05:04,757 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:05:04,757 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:05:04,757 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:05:04,757 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 06:05:04,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:05:04,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:05:04,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:05:04,963 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:05:04,964 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:05:04,965 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i [2022-01-10 06:05:05,013 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2510bc7/7e5d010f0e144f16b1e904abb57a5900/FLAGe4426932f [2022-01-10 06:05:05,485 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:05:05,486 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i [2022-01-10 06:05:05,498 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2510bc7/7e5d010f0e144f16b1e904abb57a5900/FLAGe4426932f [2022-01-10 06:05:05,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2510bc7/7e5d010f0e144f16b1e904abb57a5900 [2022-01-10 06:05:05,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:05:05,517 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:05:05,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:05:05,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:05:05,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:05:05,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:05:05" (1/1) ... [2022-01-10 06:05:05,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dee1a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:05, skipping insertion in model container [2022-01-10 06:05:05,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:05:05" (1/1) ... [2022-01-10 06:05:05,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:05:05,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:05:05,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i[22534,22547] [2022-01-10 06:05:05,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i[22606,22619] [2022-01-10 06:05:05,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i[22746,22759] [2022-01-10 06:05:05,867 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i[22820,22833] [2022-01-10 06:05:05,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:05:05,885 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:05:05,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i[22534,22547] [2022-01-10 06:05:05,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i[22606,22619] [2022-01-10 06:05:05,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i[22746,22759] [2022-01-10 06:05:05,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i[22820,22833] [2022-01-10 06:05:05,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:05:05,964 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:05:05,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:05 WrapperNode [2022-01-10 06:05:05,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:05:05,966 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:05:05,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:05:05,966 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:05:05,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:05" (1/1) ... [2022-01-10 06:05:05,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:05" (1/1) ... [2022-01-10 06:05:06,002 INFO L137 Inliner]: procedures = 122, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2022-01-10 06:05:06,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:05:06,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:05:06,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:05:06,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:05:06,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:05" (1/1) ... [2022-01-10 06:05:06,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:05" (1/1) ... [2022-01-10 06:05:06,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:05" (1/1) ... [2022-01-10 06:05:06,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:05" (1/1) ... [2022-01-10 06:05:06,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:05" (1/1) ... [2022-01-10 06:05:06,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:05" (1/1) ... [2022-01-10 06:05:06,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:05" (1/1) ... [2022-01-10 06:05:06,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:05:06,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:05:06,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:05:06,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:05:06,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:05" (1/1) ... [2022-01-10 06:05:06,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:05:06,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:05:06,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 06:05:06,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 06:05:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 06:05:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 06:05:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:05:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:05:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:05:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 06:05:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 06:05:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:05:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:05:06,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:05:06,207 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:05:06,209 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:05:06,606 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:05:06,610 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:05:06,610 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-01-10 06:05:06,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:05:06 BoogieIcfgContainer [2022-01-10 06:05:06,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:05:06,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:05:06,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:05:06,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:05:06,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:05:05" (1/3) ... [2022-01-10 06:05:06,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2903c4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:05:06, skipping insertion in model container [2022-01-10 06:05:06,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:05" (2/3) ... [2022-01-10 06:05:06,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2903c4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:05:06, skipping insertion in model container [2022-01-10 06:05:06,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:05:06" (3/3) ... [2022-01-10 06:05:06,617 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-1.i [2022-01-10 06:05:06,620 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:05:06,621 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-10 06:05:06,650 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:05:06,655 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 06:05:06,655 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-10 06:05:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-01-10 06:05:06,670 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:06,670 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-01-10 06:05:06,671 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:06,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:06,674 INFO L85 PathProgramCache]: Analyzing trace with hash 889937798, now seen corresponding path program 1 times [2022-01-10 06:05:06,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:06,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904383065] [2022-01-10 06:05:06,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:06,683 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:06,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:06,685 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:06,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 06:05:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:06,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:05:06,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:06,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:05:06,824 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:06,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904383065] [2022-01-10 06:05:06,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904383065] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:05:06,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:05:06,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:05:06,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375096178] [2022-01-10 06:05:06,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:05:06,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:05:06,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:06,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:05:06,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:05:06,853 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:06,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:06,866 INFO L93 Difference]: Finished difference Result 60 states and 97 transitions. [2022-01-10 06:05:06,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:05:06,867 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-01-10 06:05:06,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:06,873 INFO L225 Difference]: With dead ends: 60 [2022-01-10 06:05:06,873 INFO L226 Difference]: Without dead ends: 26 [2022-01-10 06:05:06,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:05:06,881 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:06,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:05:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-10 06:05:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-10 06:05:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-01-10 06:05:06,904 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 6 [2022-01-10 06:05:06,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:06,905 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-01-10 06:05:06,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-01-10 06:05:06,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-01-10 06:05:06,905 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:06,905 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-01-10 06:05:06,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-01-10 06:05:07,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:07,113 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:07,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:07,116 INFO L85 PathProgramCache]: Analyzing trace with hash 889639888, now seen corresponding path program 1 times [2022-01-10 06:05:07,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:07,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894848340] [2022-01-10 06:05:07,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:07,117 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:07,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:07,119 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:07,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 06:05:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:07,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:05:07,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:07,274 INFO L387 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 12 treesize of output 10 [2022-01-10 06:05:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:07,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:05:07,300 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:07,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894848340] [2022-01-10 06:05:07,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894848340] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:05:07,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:05:07,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:05:07,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103479708] [2022-01-10 06:05:07,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:05:07,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:05:07,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:07,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:05:07,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:05:07,305 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:07,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:07,480 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-01-10 06:05:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 06:05:07,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-01-10 06:05:07,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:07,481 INFO L225 Difference]: With dead ends: 31 [2022-01-10 06:05:07,481 INFO L226 Difference]: Without dead ends: 29 [2022-01-10 06:05:07,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:05:07,482 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:07,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 27 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:05:07,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-10 06:05:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-01-10 06:05:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-01-10 06:05:07,486 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 6 [2022-01-10 06:05:07,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:07,486 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-01-10 06:05:07,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-01-10 06:05:07,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 06:05:07,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:07,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:07,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 06:05:07,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:07,696 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:07,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:07,696 INFO L85 PathProgramCache]: Analyzing trace with hash -977335784, now seen corresponding path program 1 times [2022-01-10 06:05:07,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:07,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977503750] [2022-01-10 06:05:07,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:07,697 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:07,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:07,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:07,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 06:05:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:07,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 06:05:07,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:07,829 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-01-10 06:05:07,905 INFO L387 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 19 treesize of output 7 [2022-01-10 06:05:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:07,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:05:07,918 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:07,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977503750] [2022-01-10 06:05:07,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977503750] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:05:07,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:05:07,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:05:07,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135840999] [2022-01-10 06:05:07,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:05:07,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:05:07,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:07,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:05:07,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:05:07,919 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:08,221 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-01-10 06:05:08,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:05:08,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-01-10 06:05:08,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:08,222 INFO L225 Difference]: With dead ends: 48 [2022-01-10 06:05:08,222 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 06:05:08,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:05:08,224 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:08,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 65 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:05:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 06:05:08,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 30. [2022-01-10 06:05:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:08,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-01-10 06:05:08,229 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 9 [2022-01-10 06:05:08,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:08,229 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-01-10 06:05:08,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:08,230 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-01-10 06:05:08,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 06:05:08,230 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:08,230 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:08,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 06:05:08,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:08,444 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:08,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:08,444 INFO L85 PathProgramCache]: Analyzing trace with hash -822388269, now seen corresponding path program 1 times [2022-01-10 06:05:08,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:08,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619788949] [2022-01-10 06:05:08,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:08,445 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:08,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:08,446 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:08,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 06:05:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:08,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-10 06:05:08,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:08,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-01-10 06:05:08,660 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-01-10 06:05:08,660 INFO L387 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-01-10 06:05:08,716 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:05:08,717 INFO L387 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 12 treesize of output 12 [2022-01-10 06:05:08,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:08,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-01-10 06:05:08,739 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 16 treesize of output 18 [2022-01-10 06:05:08,817 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-01-10 06:05:08,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2022-01-10 06:05:08,827 INFO L387 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 8 treesize of output 7 [2022-01-10 06:05:08,939 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-10 06:05:09,017 INFO L387 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 [2022-01-10 06:05:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:09,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:05:09,108 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:09,109 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-01-10 06:05:09,126 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.base_27| (_ BitVec 64)) (v_ArrVal_177 (Array (_ BitVec 64) (_ BitVec 32))) (v_arrayElimArr_2 (Array (_ BitVec 64) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_2 (_ bv8 64)) ~unnamed1~0~BLACK)) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_177) |v_ULTIMATE.start_main_~end~0#1.base_27| v_arrayElimArr_2) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-01-10 06:05:09,279 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.base_27| (_ BitVec 64)) (v_ArrVal_177 (Array (_ BitVec 64) (_ BitVec 32))) (v_arrayElimArr_2 (Array (_ BitVec 64) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_28| (_ BitVec 64)) (v_ArrVal_175 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_28|)))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_175)) |v_ULTIMATE.start_main_~end~0#1.base_28| v_ArrVal_177) |v_ULTIMATE.start_main_~end~0#1.base_27| v_arrayElimArr_2) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (select v_arrayElimArr_2 (_ bv8 64)) ~unnamed1~0~BLACK)))) is different from false [2022-01-10 06:05:09,304 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-10 06:05:09,304 INFO L387 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 1 [2022-01-10 06:05:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-10 06:05:09,308 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:09,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619788949] [2022-01-10 06:05:09,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619788949] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:05:09,308 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:05:09,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-01-10 06:05:09,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634641631] [2022-01-10 06:05:09,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:05:09,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 06:05:09,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:09,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 06:05:09,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=51, Unknown=2, NotChecked=30, Total=110 [2022-01-10 06:05:09,309 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:10,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:10,069 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-01-10 06:05:10,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 06:05:10,069 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-01-10 06:05:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:10,070 INFO L225 Difference]: With dead ends: 66 [2022-01-10 06:05:10,070 INFO L226 Difference]: Without dead ends: 64 [2022-01-10 06:05:10,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=120, Unknown=2, NotChecked=50, Total=240 [2022-01-10 06:05:10,072 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 42 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:10,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 130 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 102 Invalid, 0 Unknown, 73 Unchecked, 0.6s Time] [2022-01-10 06:05:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-10 06:05:10,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 34. [2022-01-10 06:05:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:10,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-01-10 06:05:10,076 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 11 [2022-01-10 06:05:10,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:10,077 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-01-10 06:05:10,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:10,077 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-01-10 06:05:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 06:05:10,077 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:10,077 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:10,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 06:05:10,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:10,278 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:10,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:10,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1674631615, now seen corresponding path program 1 times [2022-01-10 06:05:10,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:10,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214582105] [2022-01-10 06:05:10,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:10,279 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:10,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:10,280 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:10,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 06:05:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:10,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 06:05:10,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:10,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-01-10 06:05:10,475 INFO L387 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 [2022-01-10 06:05:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:10,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:05:10,485 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:10,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214582105] [2022-01-10 06:05:10,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214582105] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:05:10,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:05:10,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:05:10,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137143003] [2022-01-10 06:05:10,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:05:10,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:05:10,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:10,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:05:10,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:05:10,488 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:10,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:10,907 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2022-01-10 06:05:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:05:10,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 06:05:10,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:10,908 INFO L225 Difference]: With dead ends: 72 [2022-01-10 06:05:10,908 INFO L226 Difference]: Without dead ends: 60 [2022-01-10 06:05:10,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:05:10,909 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:10,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 89 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 06:05:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-10 06:05:10,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2022-01-10 06:05:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.3) internal successors, (52), 42 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2022-01-10 06:05:10,914 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 13 [2022-01-10 06:05:10,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:10,915 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2022-01-10 06:05:10,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-01-10 06:05:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 06:05:10,915 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:10,915 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:10,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 06:05:11,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:11,123 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:11,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:11,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2053285582, now seen corresponding path program 2 times [2022-01-10 06:05:11,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:11,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905560960] [2022-01-10 06:05:11,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:05:11,124 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:11,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:11,125 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:11,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 06:05:11,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:05:11,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:05:11,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-10 06:05:11,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:11,444 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-01-10 06:05:11,445 INFO L387 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-01-10 06:05:11,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-01-10 06:05:11,503 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:05:11,503 INFO L387 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 18 treesize of output 25 [2022-01-10 06:05:11,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:11,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-01-10 06:05:11,519 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 16 treesize of output 18 [2022-01-10 06:05:11,580 INFO L353 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-01-10 06:05:11,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2022-01-10 06:05:11,592 INFO L387 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 7 treesize of output 3 [2022-01-10 06:05:11,624 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:05:11,624 INFO L387 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 19 treesize of output 26 [2022-01-10 06:05:11,656 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:05:11,656 INFO L387 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 14 treesize of output 14 [2022-01-10 06:05:11,683 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:05:11,683 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2022-01-10 06:05:11,753 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-01-10 06:05:11,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2022-01-10 06:05:11,760 INFO L387 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 8 treesize of output 7 [2022-01-10 06:05:11,807 INFO L387 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 7 treesize of output 3 [2022-01-10 06:05:11,895 INFO L387 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 [2022-01-10 06:05:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:11,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:05:11,983 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:11,983 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-01-10 06:05:12,001 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.base_35| (_ BitVec 64)) (v_arrayElimArr_5 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 64) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_5 (_ bv8 64)))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_348) |v_ULTIMATE.start_main_~end~0#1.base_35| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-01-10 06:05:12,070 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.base_35| (_ BitVec 64)) (v_ArrVal_344 (Array (_ BitVec 64) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_36| (_ BitVec 64)) (v_arrayElimArr_5 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 64) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_344) |v_ULTIMATE.start_main_~end~0#1.base_36| v_ArrVal_348) |v_ULTIMATE.start_main_~end~0#1.base_35| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_5 (_ bv8 64)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_36|)))))) is different from false [2022-01-10 06:05:12,210 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 (Array (_ BitVec 64) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_35| (_ BitVec 64)) (v_ArrVal_344 (Array (_ BitVec 64) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_36| (_ BitVec 64)) (|v_ULTIMATE.start_main_~end~0#1.base_37| (_ BitVec 64)) (v_ArrVal_341 (_ BitVec 1)) (v_arrayElimArr_5 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 64) (_ BitVec 32)))) (or (not (= (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_37| v_ArrVal_341) |v_ULTIMATE.start_main_~end~0#1.base_36|)) (_ bv0 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_37|) (_ bv0 1))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_5 (_ bv8 64)))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_343) |v_ULTIMATE.start_main_~end~0#1.base_37| v_ArrVal_344) |v_ULTIMATE.start_main_~end~0#1.base_36| v_ArrVal_348) |v_ULTIMATE.start_main_~end~0#1.base_35| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-01-10 06:05:12,658 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 (Array (_ BitVec 64) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_35| (_ BitVec 64)) (v_ArrVal_344 (Array (_ BitVec 64) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_36| (_ BitVec 64)) (|v_ULTIMATE.start_main_~end~0#1.base_37| (_ BitVec 64)) (|v_ULTIMATE.start_main_~end~0#1.base_38| (_ BitVec 64)) (v_ArrVal_338 (_ BitVec 32)) (v_ArrVal_341 (_ BitVec 1)) (v_arrayElimArr_5 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_337 (_ BitVec 1)) (v_ArrVal_348 (Array (_ BitVec 64) (_ BitVec 32)))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_38| v_ArrVal_337))) (or (not (= (bvneg (select (store .cse0 |v_ULTIMATE.start_main_~end~0#1.base_37| v_ArrVal_341) |v_ULTIMATE.start_main_~end~0#1.base_36|)) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~end~0#1.base_37|))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_338)) |v_ULTIMATE.start_main_~end~0#1.base_38| v_ArrVal_343) |v_ULTIMATE.start_main_~end~0#1.base_37| v_ArrVal_344) |v_ULTIMATE.start_main_~end~0#1.base_36| v_ArrVal_348) |v_ULTIMATE.start_main_~end~0#1.base_35| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_38|)) (_ bv0 1))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_5 (_ bv8 64))))))) is different from false [2022-01-10 06:05:12,690 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-10 06:05:12,690 INFO L387 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 1 [2022-01-10 06:05:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-10 06:05:12,692 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:12,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905560960] [2022-01-10 06:05:12,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905560960] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:05:12,692 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:05:12,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2022-01-10 06:05:12,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653237640] [2022-01-10 06:05:12,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:05:12,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 06:05:12,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:12,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 06:05:12,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=66, Unknown=4, NotChecked=76, Total=182 [2022-01-10 06:05:12,694 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:13,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:13,267 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2022-01-10 06:05:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 06:05:13,271 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 06:05:13,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:13,272 INFO L225 Difference]: With dead ends: 50 [2022-01-10 06:05:13,272 INFO L226 Difference]: Without dead ends: 48 [2022-01-10 06:05:13,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=108, Unknown=4, NotChecked=100, Total=272 [2022-01-10 06:05:13,273 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:13,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 58 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 64 Invalid, 0 Unknown, 120 Unchecked, 0.4s Time] [2022-01-10 06:05:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-10 06:05:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2022-01-10 06:05:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-01-10 06:05:13,301 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 13 [2022-01-10 06:05:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:13,302 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-01-10 06:05:13,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-01-10 06:05:13,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 06:05:13,302 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:13,302 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:13,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 06:05:13,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:13,503 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:13,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:13,504 INFO L85 PathProgramCache]: Analyzing trace with hash -761736198, now seen corresponding path program 1 times [2022-01-10 06:05:13,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:13,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500715481] [2022-01-10 06:05:13,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:13,504 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:13,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:13,505 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:13,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 06:05:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:13,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:05:13,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:13,659 INFO L387 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 19 treesize of output 7 [2022-01-10 06:05:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:05:13,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:05:13,685 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:13,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500715481] [2022-01-10 06:05:13,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500715481] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:05:13,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:05:13,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:05:13,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418017991] [2022-01-10 06:05:13,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:05:13,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:05:13,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:13,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:05:13,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:05:13,686 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:13,930 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-01-10 06:05:13,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:05:13,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 06:05:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:13,931 INFO L225 Difference]: With dead ends: 48 [2022-01-10 06:05:13,931 INFO L226 Difference]: Without dead ends: 36 [2022-01-10 06:05:13,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:05:13,932 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:13,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:05:13,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-10 06:05:13,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 24. [2022-01-10 06:05:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-01-10 06:05:13,935 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2022-01-10 06:05:13,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:13,935 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-01-10 06:05:13,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-01-10 06:05:13,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 06:05:13,936 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:13,936 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:13,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 06:05:14,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:14,144 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:14,145 INFO L85 PathProgramCache]: Analyzing trace with hash -270590612, now seen corresponding path program 1 times [2022-01-10 06:05:14,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:14,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983443270] [2022-01-10 06:05:14,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:14,145 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:14,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:14,147 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:14,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 06:05:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:14,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 06:05:14,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:14,301 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-01-10 06:05:14,301 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 61 [2022-01-10 06:05:14,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:14,319 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-01-10 06:05:14,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:14,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 23 [2022-01-10 06:05:14,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:14,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 13 [2022-01-10 06:05:14,451 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 24 [2022-01-10 06:05:14,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:14,455 INFO L387 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 19 treesize of output 13 [2022-01-10 06:05:14,511 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-01-10 06:05:14,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 61 [2022-01-10 06:05:14,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:14,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-01-10 06:05:14,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:14,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 23 [2022-01-10 06:05:14,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:14,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 13 [2022-01-10 06:05:14,726 INFO L387 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 [2022-01-10 06:05:14,729 INFO L387 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 [2022-01-10 06:05:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:14,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:05:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:14,866 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:14,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983443270] [2022-01-10 06:05:14,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983443270] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:05:14,866 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:05:14,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-01-10 06:05:14,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015130591] [2022-01-10 06:05:14,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:05:14,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 06:05:14,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:14,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 06:05:14,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:05:14,867 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:15,155 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-01-10 06:05:15,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:05:15,155 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 06:05:15,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:15,156 INFO L225 Difference]: With dead ends: 47 [2022-01-10 06:05:15,156 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 06:05:15,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-10 06:05:15,157 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:15,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 54 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:05:15,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 06:05:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-10 06:05:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-01-10 06:05:15,159 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-01-10 06:05:15,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:15,160 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-01-10 06:05:15,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-01-10 06:05:15,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 06:05:15,160 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:15,160 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:15,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 06:05:15,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:15,368 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 06:05:15,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:15,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1451772591, now seen corresponding path program 1 times [2022-01-10 06:05:15,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:15,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683464353] [2022-01-10 06:05:15,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:15,368 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:15,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:15,369 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:15,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 06:05:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:15,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-10 06:05:15,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:15,616 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-01-10 06:05:15,616 INFO L387 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 1 case distinctions, treesize of input 9 treesize of output 14 [2022-01-10 06:05:15,657 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 14 treesize of output 14 [2022-01-10 06:05:15,674 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:05:15,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-01-10 06:05:15,679 INFO L387 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 5 treesize of output 3 [2022-01-10 06:05:15,720 INFO L353 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-01-10 06:05:15,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-01-10 06:05:15,744 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-01-10 06:05:15,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 06:05:15,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:15,858 INFO L353 Elim1Store]: treesize reduction 31, result has 31.1 percent of original size [2022-01-10 06:05:15,858 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 56 [2022-01-10 06:05:15,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:15,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:15,868 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-01-10 06:05:15,875 INFO L387 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 12 treesize of output 11 [2022-01-10 06:05:15,906 INFO L353 Elim1Store]: treesize reduction 20, result has 67.2 percent of original size [2022-01-10 06:05:15,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 61 [2022-01-10 06:05:16,318 INFO L387 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 [2022-01-10 06:05:16,453 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 06:05:16,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 27 [2022-01-10 06:05:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:16,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:05:16,704 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:16,704 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 68 [2022-01-10 06:05:16,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_555 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_554 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_552 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_13) .cse0 v_ArrVal_555))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_552) .cse0 v_ArrVal_554) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) (_ bv0 1))) (not (= (select (select .cse1 .cse2) .cse3) |c_ULTIMATE.start_main_~null~0#1.base|)) (and (= .cse2 |c_ULTIMATE.start_main_~null~0#1.base|) (= .cse3 |c_ULTIMATE.start_main_~null~0#1.offset|))))))) is different from false [2022-01-10 06:05:16,847 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:16,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 104 [2022-01-10 06:05:16,856 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:16,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 80 [2022-01-10 06:05:17,027 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:17,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 823 treesize of output 722 [2022-01-10 06:05:17,081 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:17,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1894 treesize of output 1821 [2022-01-10 06:05:17,301 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:17,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1839 treesize of output 1667 [2022-01-10 06:05:17,574 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:17,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1108 treesize of output 1076 [2022-01-10 06:05:17,634 INFO L387 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 908 treesize of output 866 [2022-01-10 06:05:17,679 INFO L387 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 876 treesize of output 806