/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps X --traceabstraction.defines.what.statements.are.considered.a.step.in.por LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 19:36:53,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 19:36:53,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 19:36:53,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 19:36:53,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 19:36:53,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 19:36:53,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 19:36:53,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 19:36:53,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 19:36:53,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 19:36:53,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 19:36:53,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 19:36:53,536 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 19:36:53,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 19:36:53,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 19:36:53,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 19:36:53,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 19:36:53,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 19:36:53,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 19:36:53,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 19:36:53,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 19:36:53,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 19:36:53,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 19:36:53,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 19:36:53,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 19:36:53,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 19:36:53,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 19:36:53,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 19:36:53,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 19:36:53,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 19:36:53,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 19:36:53,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 19:36:53,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 19:36:53,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 19:36:53,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 19:36:53,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 19:36:53,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 19:36:53,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 19:36:53,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 19:36:53,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 19:36:53,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 19:36:53,569 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 19:36:53,591 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 19:36:53,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 19:36:53,591 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 19:36:53,591 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 19:36:53,592 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 19:36:53,592 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 19:36:53,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 19:36:53,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 19:36:53,592 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 19:36:53,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 19:36:53,593 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 19:36:53,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 19:36:53,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 19:36:53,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 19:36:53,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 19:36:53,593 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 19:36:53,593 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 19:36:53,594 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 19:36:53,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 19:36:53,594 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 19:36:53,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 19:36:53,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 19:36:53,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 19:36:53,594 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 19:36:53,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 19:36:53,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 19:36:53,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 19:36:53,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 19:36:53,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 19:36:53,595 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 19:36:53,595 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 19:36:53,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 19:36:53,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 19:36:53,595 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 19:36:53,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 19:36:53,595 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 19:36:53,595 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-04 19:36:53,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 19:36:53,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 19:36:53,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 19:36:53,756 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 19:36:53,757 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 19:36:53,758 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-2.i [2023-05-04 19:36:53,826 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af09847c5/9c7bc1a75a49410d97b011aacfe98121/FLAG050cf111c [2023-05-04 19:36:54,250 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 19:36:54,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-2.i [2023-05-04 19:36:54,258 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af09847c5/9c7bc1a75a49410d97b011aacfe98121/FLAG050cf111c [2023-05-04 19:36:54,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af09847c5/9c7bc1a75a49410d97b011aacfe98121 [2023-05-04 19:36:54,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 19:36:54,269 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 19:36:54,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 19:36:54,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 19:36:54,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 19:36:54,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 07:36:54" (1/1) ... [2023-05-04 19:36:54,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d723871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:36:54, skipping insertion in model container [2023-05-04 19:36:54,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 07:36:54" (1/1) ... [2023-05-04 19:36:54,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 19:36:54,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 19:36:54,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-2.i[31164,31177] [2023-05-04 19:36:54,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 19:36:54,623 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 19:36:54,660 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-2.i[31164,31177] [2023-05-04 19:36:54,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 19:36:54,698 INFO L208 MainTranslator]: Completed translation [2023-05-04 19:36:54,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:36:54 WrapperNode [2023-05-04 19:36:54,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 19:36:54,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 19:36:54,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 19:36:54,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 19:36:54,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:36:54" (1/1) ... [2023-05-04 19:36:54,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:36:54" (1/1) ... [2023-05-04 19:36:54,752 INFO L138 Inliner]: procedures = 177, calls = 47, calls flagged for inlining = 16, calls inlined = 19, statements flattened = 187 [2023-05-04 19:36:54,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 19:36:54,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 19:36:54,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 19:36:54,753 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 19:36:54,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:36:54" (1/1) ... [2023-05-04 19:36:54,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:36:54" (1/1) ... [2023-05-04 19:36:54,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:36:54" (1/1) ... [2023-05-04 19:36:54,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:36:54" (1/1) ... [2023-05-04 19:36:54,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:36:54" (1/1) ... [2023-05-04 19:36:54,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:36:54" (1/1) ... [2023-05-04 19:36:54,785 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:36:54" (1/1) ... [2023-05-04 19:36:54,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:36:54" (1/1) ... [2023-05-04 19:36:54,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 19:36:54,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 19:36:54,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 19:36:54,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 19:36:54,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:36:54" (1/1) ... [2023-05-04 19:36:54,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 19:36:54,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:36:54,833 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) [2023-05-04 19:36:54,839 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 [2023-05-04 19:36:54,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 19:36:54,861 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-05-04 19:36:54,861 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-05-04 19:36:54,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 19:36:54,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 19:36:54,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 19:36:54,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 19:36:54,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 19:36:54,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 19:36:54,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 19:36:54,863 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 19:36:54,952 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 19:36:54,953 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 19:36:55,199 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 19:36:55,326 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 19:36:55,327 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-05-04 19:36:55,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 07:36:55 BoogieIcfgContainer [2023-05-04 19:36:55,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 19:36:55,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 19:36:55,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 19:36:55,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 19:36:55,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 07:36:54" (1/3) ... [2023-05-04 19:36:55,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4021a5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 07:36:55, skipping insertion in model container [2023-05-04 19:36:55,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:36:54" (2/3) ... [2023-05-04 19:36:55,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4021a5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 07:36:55, skipping insertion in model container [2023-05-04 19:36:55,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 07:36:55" (3/3) ... [2023-05-04 19:36:55,334 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longest-2.i [2023-05-04 19:36:55,339 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 19:36:55,345 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 19:36:55,346 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-04 19:36:55,346 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 19:36:55,403 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-05-04 19:36:55,439 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:36:55,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 19:36:55,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:36:55,441 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 19:36:55,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 19:36:55,494 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 19:36:55,523 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-05-04 19:36:55,527 INFO L357 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=PARTIAL_ORDER_FA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@66ac8bb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:36:55,528 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 19:36:55,850 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:36:55,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:36:55,856 INFO L85 PathProgramCache]: Analyzing trace with hash 449071885, now seen corresponding path program 1 times [2023-05-04 19:36:55,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:36:55,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129095326] [2023-05-04 19:36:55,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:36:55,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:36:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:36:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:36:56,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:36:56,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129095326] [2023-05-04 19:36:56,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129095326] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:36:56,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:36:56,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 19:36:56,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352696459] [2023-05-04 19:36:56,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:36:56,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 19:36:56,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:36:56,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 19:36:56,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 19:36:56,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:36:56,288 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:36:56,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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) [2023-05-04 19:36:56,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:36:56,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:36:56,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 19:36:56,328 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:36:56,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:36:56,329 INFO L85 PathProgramCache]: Analyzing trace with hash 700970053, now seen corresponding path program 1 times [2023-05-04 19:36:56,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:36:56,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384273105] [2023-05-04 19:36:56,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:36:56,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:36:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:36:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:36:56,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:36:56,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384273105] [2023-05-04 19:36:56,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384273105] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:36:56,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:36:56,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-04 19:36:56,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054990642] [2023-05-04 19:36:56,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:36:56,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 19:36:56,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:36:56,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 19:36:56,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-05-04 19:36:56,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:36:56,574 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:36:56,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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) [2023-05-04 19:36:56,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:36:56,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:36:56,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:36:56,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:36:56,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 19:36:56,791 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:36:56,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:36:56,791 INFO L85 PathProgramCache]: Analyzing trace with hash -903111879, now seen corresponding path program 1 times [2023-05-04 19:36:56,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:36:56,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898121772] [2023-05-04 19:36:56,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:36:56,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:36:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:36:57,908 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:36:57,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:36:57,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898121772] [2023-05-04 19:36:57,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898121772] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:36:57,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338393559] [2023-05-04 19:36:57,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:36:57,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:36:57,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:36:57,911 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 19:36:57,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-04 19:36:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:36:58,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 60 conjunts are in the unsatisfiable core [2023-05-04 19:36:58,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:36:58,834 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-05-04 19:36:58,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2023-05-04 19:36:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:36:59,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 19:36:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:36:59,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338393559] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 19:36:59,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 19:36:59,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 10] total 39 [2023-05-04 19:36:59,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022938971] [2023-05-04 19:36:59,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 19:36:59,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-05-04 19:36:59,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:36:59,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-05-04 19:36:59,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1368, Unknown=6, NotChecked=0, Total=1560 [2023-05-04 19:36:59,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:36:59,643 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:36:59,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 10.58974358974359) internal successors, (413), 40 states have internal predecessors, (413), 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) [2023-05-04 19:36:59,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:36:59,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:36:59,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:37:02,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:02,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:37:02,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2023-05-04 19:37:02,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-05-04 19:37:02,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-05-04 19:37:02,310 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:37:02,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:37:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1697729337, now seen corresponding path program 1 times [2023-05-04 19:37:02,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:37:02,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127149319] [2023-05-04 19:37:02,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:37:02,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:37:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:37:02,512 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2023-05-04 19:37:02,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:37:02,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127149319] [2023-05-04 19:37:02,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127149319] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:37:02,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:37:02,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-04 19:37:02,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705204005] [2023-05-04 19:37:02,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:37:02,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-04 19:37:02,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:37:02,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-04 19:37:02,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-05-04 19:37:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:37:02,515 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:37:02,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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) [2023-05-04 19:37:02,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:02,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:37:02,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2023-05-04 19:37:02,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:37:02,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:02,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:37:02,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-05-04 19:37:02,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:02,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 19:37:02,651 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:37:02,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:37:02,651 INFO L85 PathProgramCache]: Analyzing trace with hash 920795102, now seen corresponding path program 2 times [2023-05-04 19:37:02,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:37:02,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719304023] [2023-05-04 19:37:02,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:37:02,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:37:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:37:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2023-05-04 19:37:02,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:37:02,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719304023] [2023-05-04 19:37:02,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719304023] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:37:02,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:37:02,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 19:37:02,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731243848] [2023-05-04 19:37:02,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:37:02,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 19:37:02,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:37:02,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 19:37:02,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 19:37:02,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:37:02,773 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:37:02,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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) [2023-05-04 19:37:02,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:02,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:37:02,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2023-05-04 19:37:02,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:02,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:37:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:37:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-05-04 19:37:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:02,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 19:37:02,799 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:37:02,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:37:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1475448435, now seen corresponding path program 1 times [2023-05-04 19:37:02,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:37:02,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442882948] [2023-05-04 19:37:02,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:37:02,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:37:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:37:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2023-05-04 19:37:03,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:37:03,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442882948] [2023-05-04 19:37:03,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442882948] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:37:03,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:37:03,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 19:37:03,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353927845] [2023-05-04 19:37:03,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:37:03,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-05-04 19:37:03,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:37:03,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-05-04 19:37:03,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-05-04 19:37:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:37:03,074 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:37:03,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.75) internal successors, (111), 5 states have internal predecessors, (111), 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) [2023-05-04 19:37:03,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:03,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:37:03,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2023-05-04 19:37:03,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:03,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:03,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:37:03,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:03,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:37:03,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-05-04 19:37:03,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:03,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:03,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:37:03,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 19:37:03,137 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:37:03,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:37:03,137 INFO L85 PathProgramCache]: Analyzing trace with hash -262376735, now seen corresponding path program 1 times [2023-05-04 19:37:03,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:37:03,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157188516] [2023-05-04 19:37:03,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:37:03,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:37:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:37:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 336 proven. 85 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-05-04 19:37:03,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:37:03,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157188516] [2023-05-04 19:37:03,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157188516] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:37:03,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782710164] [2023-05-04 19:37:03,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:37:03,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:37:03,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:37:03,454 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 19:37:03,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 19:37:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:37:03,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 9 conjunts are in the unsatisfiable core [2023-05-04 19:37:03,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:37:03,960 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 394 proven. 27 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-05-04 19:37:03,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 19:37:04,237 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 394 proven. 27 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-05-04 19:37:04,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782710164] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 19:37:04,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 19:37:04,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2023-05-04 19:37:04,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977951354] [2023-05-04 19:37:04,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 19:37:04,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-04 19:37:04,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:37:04,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-04 19:37:04,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2023-05-04 19:37:04,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:37:04,240 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:37:04,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 27.88888888888889) internal successors, (502), 18 states have internal predecessors, (502), 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) [2023-05-04 19:37:04,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:04,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:37:04,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2023-05-04 19:37:04,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:04,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:04,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:37:04,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:37:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:37:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-05-04 19:37:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:37:04,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-04 19:37:04,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-04 19:37:04,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:37:04,877 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:37:04,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:37:04,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1448626678, now seen corresponding path program 1 times [2023-05-04 19:37:04,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:37:04,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104941614] [2023-05-04 19:37:04,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:37:04,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:37:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:37:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2023-05-04 19:37:05,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:37:05,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104941614] [2023-05-04 19:37:05,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104941614] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:37:05,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:37:05,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-04 19:37:05,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735885316] [2023-05-04 19:37:05,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:37:05,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-04 19:37:05,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:37:05,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-04 19:37:05,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-05-04 19:37:05,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:37:05,342 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:37:05,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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) [2023-05-04 19:37:05,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:05,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:37:05,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2023-05-04 19:37:05,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:05,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:05,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:37:05,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-05-04 19:37:05,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:37:05,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:05,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:37:05,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2023-05-04 19:37:05,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:05,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:05,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:37:05,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-04 19:37:05,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:05,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 19:37:05,756 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:37:05,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:37:05,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1087589, now seen corresponding path program 1 times [2023-05-04 19:37:05,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:37:05,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288739335] [2023-05-04 19:37:05,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:37:05,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:37:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:37:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:37:06,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:37:06,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288739335] [2023-05-04 19:37:06,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288739335] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:37:06,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772892225] [2023-05-04 19:37:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:37:06,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:37:06,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:37:06,313 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 19:37:06,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 19:37:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:37:06,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 61 conjunts are in the unsatisfiable core [2023-05-04 19:37:06,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:37:06,961 INFO L390 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 11 treesize of output 7 [2023-05-04 19:37:06,981 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-05-04 19:37:06,981 INFO L390 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 1 case distinctions, treesize of input 27 treesize of output 15 [2023-05-04 19:37:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:37:07,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 19:37:07,252 INFO L356 Elim1Store]: treesize reduction 58, result has 30.1 percent of original size [2023-05-04 19:37:07,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 62 [2023-05-04 19:37:07,270 INFO L390 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 66 treesize of output 62 [2023-05-04 19:37:07,283 INFO L390 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 45 treesize of output 41 [2023-05-04 19:37:07,292 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:37:07,292 INFO L390 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 25 treesize of output 27 [2023-05-04 19:37:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:37:07,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772892225] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 19:37:07,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 19:37:07,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 9] total 33 [2023-05-04 19:37:07,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945995315] [2023-05-04 19:37:07,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 19:37:07,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-05-04 19:37:07,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:37:07,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-05-04 19:37:07,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2023-05-04 19:37:07,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:37:07,454 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:37:07,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 8.363636363636363) internal successors, (276), 34 states have internal predecessors, (276), 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) [2023-05-04 19:37:07,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:07,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:37:07,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2023-05-04 19:37:07,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:07,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:07,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:37:07,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-05-04 19:37:07,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:07,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:37:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:37:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2023-05-04 19:37:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:08,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:37:08,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-04 19:37:08,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:08,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-05-04 19:37:08,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 19:37:08,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:37:08,681 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:37:08,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:37:08,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1665894555, now seen corresponding path program 2 times [2023-05-04 19:37:08,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:37:08,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836881962] [2023-05-04 19:37:08,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:37:08,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:37:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:37:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:37:09,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:37:09,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836881962] [2023-05-04 19:37:09,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836881962] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:37:09,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041524733] [2023-05-04 19:37:09,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 19:37:09,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:37:09,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:37:09,461 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 19:37:09,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-04 19:37:09,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 19:37:09,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 19:37:09,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 61 conjunts are in the unsatisfiable core [2023-05-04 19:37:09,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:37:09,651 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 19:37:09,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 19:37:10,064 INFO L390 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 [2023-05-04 19:37:10,073 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-05-04 19:37:10,074 INFO L390 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 [2023-05-04 19:37:10,079 INFO L390 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 [2023-05-04 19:37:10,112 INFO L390 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 18 treesize of output 20 [2023-05-04 19:37:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:37:10,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 19:37:10,489 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((v_ArrVal_834 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_836 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~newTop~0#1|)) |thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_836))) (or (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset|) 1)))))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_836 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_836))) (or (not (= 1 (select (select .cse3 |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset|))) (not (= 0 (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|)))))) .cse0)))) is different from false [2023-05-04 19:37:10,533 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= (select .cse2 |c_~#top~0.offset|) |c_thr1Thread1of1ForFork0_push_#t~mem8#1|))) (and (or (not .cse0) (forall ((v_ArrVal_834 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_836 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~newTop~0#1|)) |thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_836))) (or (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset|) 1)))))) (or .cse0 (forall ((v_ArrVal_832 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_836 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_836))) (or (not (= 1 (select (select .cse3 |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset|))) (not (= 0 (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|)))))))))) is different from false [2023-05-04 19:37:10,541 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:37:10,541 INFO L390 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 45 treesize of output 37 [2023-05-04 19:37:10,543 INFO L390 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 153 treesize of output 141 [2023-05-04 19:37:10,549 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:37:10,550 INFO L390 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 137 treesize of output 139 [2023-05-04 19:37:10,556 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:37:10,556 INFO L390 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 131 treesize of output 129 [2023-05-04 19:37:11,121 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:37:11,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 42 [2023-05-04 19:37:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:37:11,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041524733] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 19:37:11,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 19:37:11,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 16] total 48 [2023-05-04 19:37:11,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133523116] [2023-05-04 19:37:11,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 19:37:11,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-05-04 19:37:11,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:37:11,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-05-04 19:37:11,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1951, Unknown=7, NotChecked=182, Total=2352 [2023-05-04 19:37:11,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:37:11,136 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:37:11,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 4.791666666666667) internal successors, (230), 49 states have internal predecessors, (230), 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) [2023-05-04 19:37:11,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:11,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:37:11,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2023-05-04 19:37:11,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:11,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:11,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:37:11,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-05-04 19:37:11,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:11,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2023-05-04 19:37:11,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:37:12,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:12,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:37:12,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2023-05-04 19:37:12,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:12,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:12,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:37:12,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-04 19:37:12,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:12,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-05-04 19:37:12,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-05-04 19:37:12,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 19:37:12,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-05-04 19:37:12,590 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:37:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:37:12,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1994320246, now seen corresponding path program 2 times [2023-05-04 19:37:12,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:37:12,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773052228] [2023-05-04 19:37:12,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:37:12,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:37:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:37:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 19:37:13,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:37:13,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773052228] [2023-05-04 19:37:13,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773052228] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:37:13,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380678372] [2023-05-04 19:37:13,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 19:37:13,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:37:13,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:37:13,233 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 19:37:13,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-04 19:37:13,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 19:37:13,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 19:37:13,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 63 conjunts are in the unsatisfiable core [2023-05-04 19:37:13,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:37:14,124 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2023-05-04 19:37:14,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2023-05-04 19:37:14,143 INFO L356 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2023-05-04 19:37:14,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 71 [2023-05-04 19:37:14,150 INFO L390 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 [2023-05-04 19:37:14,161 INFO L390 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 [2023-05-04 19:37:14,184 INFO L390 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 [2023-05-04 19:37:14,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 16 [2023-05-04 19:37:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 19:37:14,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 19:37:24,288 WARN L233 SmtUtils]: Spent 7.55s on a formula simplification. DAG size of input: 35 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:37:26,305 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (and (= (select .cse0 |c_~#top~0.offset|) |c_thr1Thread1of1ForFork0_push_#t~mem8#1|) (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_949 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~newTop~0#1|)) |thr1Thread1of1ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_949) |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset| 1)) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) is different from false [2023-05-04 19:37:26,328 INFO L356 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2023-05-04 19:37:26,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 67 [2023-05-04 19:37:26,333 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:37:26,333 INFO L390 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 38 treesize of output 42 [2023-05-04 19:37:26,340 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:37:26,341 INFO L390 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 82 treesize of output 82 [2023-05-04 19:37:26,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:37:26,349 INFO L390 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 60 treesize of output 64 [2023-05-04 19:37:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 59 refuted. 3 times theorem prover too weak. 2 trivial. 2 not checked. [2023-05-04 19:37:28,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380678372] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 19:37:28,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 19:37:28,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 12] total 40 [2023-05-04 19:37:28,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842831625] [2023-05-04 19:37:28,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 19:37:28,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-05-04 19:37:28,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:37:28,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-05-04 19:37:28,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1369, Unknown=10, NotChecked=76, Total=1640 [2023-05-04 19:37:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:37:28,773 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:37:28,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 10.775) internal successors, (431), 41 states have internal predecessors, (431), 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) [2023-05-04 19:37:28,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:28,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:37:28,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2023-05-04 19:37:28,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:28,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:37:28,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:37:28,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-05-04 19:37:28,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:37:28,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-05-04 19:37:28,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-05-04 19:37:28,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:38:39,322 WARN L233 SmtUtils]: Spent 1.17m on a formula simplification. DAG size of input: 46 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:38:55,185 WARN L233 SmtUtils]: Spent 11.33s on a formula simplification. DAG size of input: 42 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:39:28,368 WARN L233 SmtUtils]: Spent 18.16s on a formula simplification. DAG size of input: 37 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:39:41,710 WARN L233 SmtUtils]: Spent 11.21s on a formula simplification. DAG size of input: 34 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:39:41,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:39:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:39:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2023-05-04 19:39:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:39:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:39:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:39:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-04 19:39:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:39:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-05-04 19:39:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-05-04 19:39:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-05-04 19:39:41,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-04 19:39:41,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:39:41,958 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:39:41,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:39:41,959 INFO L85 PathProgramCache]: Analyzing trace with hash -852268487, now seen corresponding path program 2 times [2023-05-04 19:39:41,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:39:41,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528956682] [2023-05-04 19:39:41,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:39:41,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:39:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:39:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:39:42,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:39:42,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528956682] [2023-05-04 19:39:42,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528956682] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:39:42,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677251704] [2023-05-04 19:39:42,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 19:39:42,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:39:42,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:39:42,753 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 19:39:42,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 19:39:42,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 19:39:42,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 19:39:42,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 68 conjunts are in the unsatisfiable core [2023-05-04 19:39:42,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:39:43,028 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 19:39:43,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 19:39:43,729 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2023-05-04 19:39:43,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2023-05-04 19:39:43,748 INFO L356 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2023-05-04 19:39:43,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 71 [2023-05-04 19:39:43,753 INFO L390 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 [2023-05-04 19:39:43,762 INFO L390 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 [2023-05-04 19:39:43,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 51 [2023-05-04 19:39:43,801 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 19:39:43,803 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 19:39:43,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-05-04 19:39:43,823 INFO L390 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 0 case distinctions, treesize of input 59 treesize of output 37 [2023-05-04 19:39:43,827 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 19:39:43,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-05-04 19:39:43,902 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-05-04 19:39:43,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2023-05-04 19:39:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:39:44,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 19:39:44,142 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1053) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2023-05-04 19:39:46,169 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1053 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_ArrVal_1049) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1053) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0) (or (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1052 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~newTop~0#1|)) |thr1Thread1of1ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_1052) |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1053) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse0))))) is different from false [2023-05-04 19:39:46,205 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= (select .cse1 |c_~#top~0.offset|) |c_thr1Thread1of1ForFork0_push_#t~mem8#1|))) (and (or .cse0 (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1053 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_ArrVal_1049) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1053) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1052 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~newTop~0#1|)) |thr1Thread1of1ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_1052) |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1053) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse0))))) is different from false [2023-05-04 19:39:46,227 INFO L356 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2023-05-04 19:39:46,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 73 [2023-05-04 19:39:46,233 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:39:46,233 INFO L390 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 44 treesize of output 48 [2023-05-04 19:39:46,241 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:39:46,241 INFO L390 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 146 treesize of output 146 [2023-05-04 19:39:46,246 INFO L390 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 117 treesize of output 109 [2023-05-04 19:39:46,253 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:39:46,253 INFO L390 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 116 treesize of output 120 [2023-05-04 19:39:46,267 INFO L390 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 51 treesize of output 49 [2023-05-04 19:39:46,932 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:39:46,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 42 [2023-05-04 19:39:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-05-04 19:39:46,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677251704] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 19:39:46,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 19:39:46,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 15] total 47 [2023-05-04 19:39:46,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538300966] [2023-05-04 19:39:46,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 19:39:46,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-05-04 19:39:46,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:39:46,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-05-04 19:39:46,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1779, Unknown=3, NotChecked=264, Total=2256 [2023-05-04 19:39:46,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:39:46,945 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:39:46,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 7.595744680851064) internal successors, (357), 48 states have internal predecessors, (357), 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) [2023-05-04 19:39:46,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:39:46,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:39:46,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2023-05-04 19:39:46,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:39:46,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:39:46,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:39:46,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-05-04 19:39:46,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:39:46,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-05-04 19:39:46,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-05-04 19:39:46,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2023-05-04 19:39:46,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:40:25,938 WARN L233 SmtUtils]: Spent 38.38s on a formula simplification. DAG size of input: 83 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:41:00,395 WARN L233 SmtUtils]: Spent 32.43s on a formula simplification. DAG size of input: 81 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:41:02,401 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1053 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_ArrVal_1049) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1053) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0) (= c_~next_alloc_idx~0 3) (= |c_~#top~0.offset| 0) (or (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1052 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~newTop~0#1|)) |thr1Thread1of1ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_1052) |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1053) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse0)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= |c_thr1Thread1of1ForFork0_push_~newTop~0#1| 0)) (or (not (= |c_~#top~0.base| |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base|)) (= |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset| |c_~#top~0.offset|)) (= 3 |c_~#top~0.base|) .cse0))) is different from false [2023-05-04 19:41:27,331 WARN L233 SmtUtils]: Spent 20.06s on a formula simplification. DAG size of input: 60 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:41:37,505 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 51 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:42:12,587 WARN L233 SmtUtils]: Spent 32.29s on a formula simplification. DAG size of input: 60 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:42:49,865 WARN L233 SmtUtils]: Spent 29.21s on a formula simplification. DAG size of input: 58 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:43:52,484 WARN L233 SmtUtils]: Spent 38.77s on a formula simplification. DAG size of input: 50 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:44:14,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:44:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:44:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2023-05-04 19:44:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:44:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:44:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:44:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-04 19:44:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:44:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-05-04 19:44:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-05-04 19:44:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-05-04 19:44:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2023-05-04 19:44:15,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 19:44:15,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:44:15,205 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:44:15,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:44:15,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1987892487, now seen corresponding path program 3 times [2023-05-04 19:44:15,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:44:15,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464376420] [2023-05-04 19:44:15,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:44:15,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:44:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:44:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:44:16,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:44:16,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464376420] [2023-05-04 19:44:16,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464376420] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:44:16,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002621465] [2023-05-04 19:44:16,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 19:44:16,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:44:16,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:44:16,157 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 19:44:16,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-04 19:44:16,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-05-04 19:44:16,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 19:44:16,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 68 conjunts are in the unsatisfiable core [2023-05-04 19:44:16,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:44:16,421 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 19:44:16,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 19:44:17,340 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2023-05-04 19:44:17,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2023-05-04 19:44:17,363 INFO L356 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2023-05-04 19:44:17,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 71 [2023-05-04 19:44:17,375 INFO L390 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 [2023-05-04 19:44:17,392 INFO L390 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 [2023-05-04 19:44:17,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 83 [2023-05-04 19:44:17,484 INFO L390 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 0 case distinctions, treesize of input 35 treesize of output 19 [2023-05-04 19:44:17,567 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 19:44:17,570 INFO L390 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 [2023-05-04 19:44:17,700 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-05-04 19:44:17,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 121 [2023-05-04 19:44:17,707 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 19:44:17,709 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 89 [2023-05-04 19:44:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:44:18,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 19:44:18,045 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1153) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2023-05-04 19:44:20,079 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_1153 (Array Int Int)) (v_ArrVal_1152 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~newTop~0#1|)) |thr1Thread1of1ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_1152) |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1153) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_ArrVal_1149) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1153) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0)))) is different from false [2023-05-04 19:44:20,125 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= (select .cse0 |c_~#top~0.offset|) |c_thr1Thread1of1ForFork0_push_#t~mem8#1|))) (and (or (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_1153 (Array Int Int)) (v_ArrVal_1152 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~newTop~0#1|)) |thr1Thread1of1ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_1152) |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1153) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse1)) (or (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1153 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_ArrVal_1149) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1153) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse1)))) is different from false [2023-05-04 19:44:20,152 INFO L356 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2023-05-04 19:44:20,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 73 [2023-05-04 19:44:20,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:44:20,160 INFO L390 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 44 treesize of output 48 [2023-05-04 19:44:20,171 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:44:20,172 INFO L390 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 212 treesize of output 210 [2023-05-04 19:44:20,179 INFO L390 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 179 treesize of output 167 [2023-05-04 19:44:20,192 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:44:20,192 INFO L390 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 174 treesize of output 176 [2023-05-04 19:44:20,225 INFO L390 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 51 treesize of output 49 [2023-05-04 19:44:21,130 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:44:21,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 42 [2023-05-04 19:44:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-05-04 19:44:21,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002621465] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 19:44:21,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 19:44:21,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 15] total 50 [2023-05-04 19:44:21,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67178088] [2023-05-04 19:44:21,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 19:44:21,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-05-04 19:44:21,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:44:21,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-05-04 19:44:21,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2058, Unknown=3, NotChecked=282, Total=2550 [2023-05-04 19:44:21,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:21,154 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:44:21,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 7.96) internal successors, (398), 51 states have internal predecessors, (398), 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) [2023-05-04 19:44:21,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:44:21,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:44:21,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2023-05-04 19:44:21,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:44:21,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:44:21,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:44:21,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-05-04 19:44:21,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:44:21,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-05-04 19:44:21,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-05-04 19:44:21,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2023-05-04 19:44:21,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2023-05-04 19:44:21,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:45:01,688 WARN L233 SmtUtils]: Spent 39.83s on a formula simplification. DAG size of input: 68 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:45:25,627 WARN L233 SmtUtils]: Spent 23.90s on a formula simplification. DAG size of input: 55 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:45:44,433 WARN L233 SmtUtils]: Spent 16.76s on a formula simplification. DAG size of input: 56 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:45:44,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-05-04 19:45:44,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-05-04 19:45:44,769 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at most one deprecated predicate at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:219) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:203) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:219) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:203) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:203) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:154) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.automata.partialorder.PersistentSetReduction.applyNewStateReduction(PersistentSetReduction.java:73) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:267) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-05-04 19:45:44,773 INFO L158 Benchmark]: Toolchain (without parser) took 530503.94ms. Allocated memory was 213.9MB in the beginning and 702.5MB in the end (delta: 488.6MB). Free memory was 148.2MB in the beginning and 553.6MB in the end (delta: -405.3MB). Peak memory consumption was 84.3MB. Max. memory is 8.0GB. [2023-05-04 19:45:44,773 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 213.9MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 19:45:44,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.12ms. Allocated memory was 213.9MB in the beginning and 340.8MB in the end (delta: 126.9MB). Free memory was 148.1MB in the beginning and 298.4MB in the end (delta: -150.3MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2023-05-04 19:45:44,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.80ms. Allocated memory is still 340.8MB. Free memory was 298.4MB in the beginning and 295.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 19:45:44,774 INFO L158 Benchmark]: Boogie Preprocessor took 34.30ms. Allocated memory is still 340.8MB. Free memory was 295.8MB in the beginning and 293.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 19:45:44,774 INFO L158 Benchmark]: RCFGBuilder took 540.43ms. Allocated memory is still 340.8MB. Free memory was 293.7MB in the beginning and 256.4MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2023-05-04 19:45:44,774 INFO L158 Benchmark]: TraceAbstraction took 529442.65ms. Allocated memory was 340.8MB in the beginning and 702.5MB in the end (delta: 361.8MB). Free memory was 255.4MB in the beginning and 553.6MB in the end (delta: -298.2MB). Peak memory consumption was 65.3MB. Max. memory is 8.0GB. [2023-05-04 19:45:44,775 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 213.9MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 425.12ms. Allocated memory was 213.9MB in the beginning and 340.8MB in the end (delta: 126.9MB). Free memory was 148.1MB in the beginning and 298.4MB in the end (delta: -150.3MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.80ms. Allocated memory is still 340.8MB. Free memory was 298.4MB in the beginning and 295.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.30ms. Allocated memory is still 340.8MB. Free memory was 295.8MB in the beginning and 293.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 540.43ms. Allocated memory is still 340.8MB. Free memory was 293.7MB in the beginning and 256.4MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 529442.65ms. Allocated memory was 340.8MB in the beginning and 702.5MB in the end (delta: 361.8MB). Free memory was 255.4MB in the beginning and 553.6MB in the end (delta: -298.2MB). Peak memory consumption was 65.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: at most one deprecated predicate de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at most one deprecated predicate: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-05-04 19:45:44,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-05-04 19:45:45,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...