/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION --traceabstraction.number.of.independence.relations.to.use.for.por 2 --traceabstraction.abstraction.used.for.commutativity.in.por VARIABLES_GLOBAL '--traceabstraction.abstraction.used.for.commutativity.in.por.#2' NONE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-e2ee32c-m [2023-09-07 17:19:49,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-07 17:19:49,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-09-07 17:19:49,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-07 17:19:49,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-07 17:19:49,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-07 17:19:49,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-07 17:19:49,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-07 17:19:49,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-07 17:19:49,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-07 17:19:49,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-07 17:19:49,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-07 17:19:49,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-07 17:19:49,817 INFO L153 SettingsManager]: * Use SBE=true [2023-09-07 17:19:49,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-07 17:19:49,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-07 17:19:49,818 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-07 17:19:49,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-07 17:19:49,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-07 17:19:49,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-07 17:19:49,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-07 17:19:49,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-07 17:19:49,819 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-07 17:19:49,820 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-07 17:19:49,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-07 17:19:49,820 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-07 17:19:49,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-07 17:19:49,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-07 17:19:49,821 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-07 17:19:49,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-07 17:19:49,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 17:19:49,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-07 17:19:49,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-07 17:19:49,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-07 17:19:49,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-07 17:19:49,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-07 17:19:49,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-07 17:19:49,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-07 17:19:49,823 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-07 17:19:49,824 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-09-07 17:19:49,824 INFO L153 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: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Number of independence relations to use for POR -> 2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR -> VARIABLES_GLOBAL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR #2 -> NONE [2023-09-07 17:19:50,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-07 17:19:50,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-07 17:19:50,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-07 17:19:50,074 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-07 17:19:50,074 INFO L274 PluginConnector]: CDTParser initialized [2023-09-07 17:19:50,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2023-09-07 17:19:51,249 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-07 17:19:51,452 INFO L384 CDTParser]: Found 1 translation units. [2023-09-07 17:19:51,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2023-09-07 17:19:51,459 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37043d71c/ec51b4088f42427daf1b4e5186fea9ac/FLAG70ffddd1d [2023-09-07 17:19:51,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37043d71c/ec51b4088f42427daf1b4e5186fea9ac [2023-09-07 17:19:51,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-07 17:19:51,475 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-07 17:19:51,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-07 17:19:51,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-07 17:19:51,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-07 17:19:51,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 05:19:51" (1/1) ... [2023-09-07 17:19:51,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a9a2d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:19:51, skipping insertion in model container [2023-09-07 17:19:51,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 05:19:51" (1/1) ... [2023-09-07 17:19:51,503 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-07 17:19:51,641 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c[2691,2704] [2023-09-07 17:19:51,648 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 17:19:51,656 INFO L202 MainTranslator]: Completed pre-run [2023-09-07 17:19:51,675 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c[2691,2704] [2023-09-07 17:19:51,678 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 17:19:51,684 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-07 17:19:51,685 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-07 17:19:51,690 INFO L206 MainTranslator]: Completed translation [2023-09-07 17:19:51,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:19:51 WrapperNode [2023-09-07 17:19:51,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-07 17:19:51,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-07 17:19:51,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-07 17:19:51,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-07 17:19:51,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:19:51" (1/1) ... [2023-09-07 17:19:51,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:19:51" (1/1) ... [2023-09-07 17:19:51,728 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 157 [2023-09-07 17:19:51,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-07 17:19:51,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-07 17:19:51,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-07 17:19:51,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-07 17:19:51,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:19:51" (1/1) ... [2023-09-07 17:19:51,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:19:51" (1/1) ... [2023-09-07 17:19:51,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:19:51" (1/1) ... [2023-09-07 17:19:51,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:19:51" (1/1) ... [2023-09-07 17:19:51,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:19:51" (1/1) ... [2023-09-07 17:19:51,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:19:51" (1/1) ... [2023-09-07 17:19:51,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:19:51" (1/1) ... [2023-09-07 17:19:51,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:19:51" (1/1) ... [2023-09-07 17:19:51,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-07 17:19:51,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-07 17:19:51,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-07 17:19:51,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-07 17:19:51,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:19:51" (1/1) ... [2023-09-07 17:19:51,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 17:19:51,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:19:51,794 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-09-07 17:19:51,825 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-09-07 17:19:51,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-07 17:19:51,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-07 17:19:51,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-07 17:19:51,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-07 17:19:51,839 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-07 17:19:51,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-07 17:19:51,840 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-07 17:19:51,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-07 17:19:51,840 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-07 17:19:51,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-07 17:19:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-07 17:19:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-07 17:19:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-07 17:19:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-07 17:19:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-07 17:19:51,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-07 17:19:51,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-07 17:19:51,844 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-07 17:19:51,968 INFO L236 CfgBuilder]: Building ICFG [2023-09-07 17:19:51,970 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-07 17:19:52,271 INFO L277 CfgBuilder]: Performing block encoding [2023-09-07 17:19:52,300 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-07 17:19:52,301 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-09-07 17:19:52,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 05:19:52 BoogieIcfgContainer [2023-09-07 17:19:52,303 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-07 17:19:52,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-07 17:19:52,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-07 17:19:52,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-07 17:19:52,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 05:19:51" (1/3) ... [2023-09-07 17:19:52,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77dbb1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 05:19:52, skipping insertion in model container [2023-09-07 17:19:52,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:19:51" (2/3) ... [2023-09-07 17:19:52,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77dbb1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 05:19:52, skipping insertion in model container [2023-09-07 17:19:52,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 05:19:52" (3/3) ... [2023-09-07 17:19:52,310 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2023-09-07 17:19:52,317 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-07 17:19:52,325 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-07 17:19:52,325 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-07 17:19:52,326 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-07 17:19:52,413 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-09-07 17:19:52,463 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 17:19:52,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-07 17:19:52,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:19:52,469 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-09-07 17:19:52,491 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-09-07 17:19:52,516 INFO L103 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 17:19:52,532 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-09-07 17:19:52,532 WARN L169 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-09-07 17:19:52,532 WARN L170 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-09-07 17:19:52,539 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-09-07 17:19:52,546 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;@49d54ced, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 17:19:52,546 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-09-07 17:19:53,470 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 17:19:53,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:19:53,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1514627023, now seen corresponding path program 1 times [2023-09-07 17:19:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:19:53,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100603661] [2023-09-07 17:19:53,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:19:53,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:19:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:19:53,825 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-09-07 17:19:53,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:19:53,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100603661] [2023-09-07 17:19:53,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100603661] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 17:19:53,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 17:19:53,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-07 17:19:53,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017617017] [2023-09-07 17:19:53,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 17:19:53,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-07 17:19:53,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:19:53,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-07 17:19:53,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-07 17:19:53,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:19:53,867 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:19:53,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 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-09-07 17:19:53,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:19:54,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:19:54,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-07 17:19:54,251 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 17:19:54,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:19:54,254 INFO L85 PathProgramCache]: Analyzing trace with hash 91262695, now seen corresponding path program 1 times [2023-09-07 17:19:54,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:19:54,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724015959] [2023-09-07 17:19:54,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:19:54,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:19:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:19:54,829 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-09-07 17:19:54,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:19:54,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724015959] [2023-09-07 17:19:54,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724015959] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 17:19:54,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 17:19:54,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-07 17:19:54,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956573138] [2023-09-07 17:19:54,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 17:19:54,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-07 17:19:54,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:19:54,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-07 17:19:54,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-07 17:19:54,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:19:54,837 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:19:54,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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-09-07 17:19:54,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:19:54,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:19:55,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:19:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:19:55,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-07 17:19:55,615 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 17:19:55,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:19:55,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2106931975, now seen corresponding path program 1 times [2023-09-07 17:19:55,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:19:55,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914083380] [2023-09-07 17:19:55,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:19:55,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:19:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:19:56,034 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-09-07 17:19:56,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:19:56,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914083380] [2023-09-07 17:19:56,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914083380] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:19:56,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915928956] [2023-09-07 17:19:56,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:19:56,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:19:56,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:19:56,075 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-09-07 17:19:56,101 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-09-07 17:19:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:19:56,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 10 conjunts are in the unsatisfiable core [2023-09-07 17:19:56,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:19:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-09-07 17:19:56,626 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 17:19:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-09-07 17:19:56,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915928956] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 17:19:56,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 17:19:56,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-09-07 17:19:56,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572058216] [2023-09-07 17:19:56,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 17:19:56,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-09-07 17:19:56,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:19:56,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-09-07 17:19:56,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-09-07 17:19:56,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:19:56,975 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:19:56,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.75) internal successors, (258), 24 states have internal predecessors, (258), 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-09-07 17:19:56,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:19:56,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:19:56,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:19:58,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:19:58,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:19:58,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-09-07 17:19:58,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-07 17:19:58,257 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-09-07 17:19:58,257 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 17:19:58,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:19:58,259 INFO L85 PathProgramCache]: Analyzing trace with hash -204637785, now seen corresponding path program 2 times [2023-09-07 17:19:58,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:19:58,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069994057] [2023-09-07 17:19:58,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:19:58,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:19:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:19:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 23 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-09-07 17:19:58,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:19:58,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069994057] [2023-09-07 17:19:58,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069994057] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:19:58,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601108904] [2023-09-07 17:19:58,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-07 17:19:58,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:19:58,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:19:58,726 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-09-07 17:19:58,755 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-09-07 17:19:58,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-07 17:19:58,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 17:19:58,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 8 conjunts are in the unsatisfiable core [2023-09-07 17:19:58,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:19:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-09-07 17:19:59,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 17:19:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-09-07 17:19:59,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601108904] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 17:19:59,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 17:19:59,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2023-09-07 17:19:59,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49512438] [2023-09-07 17:19:59,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 17:19:59,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-09-07 17:19:59,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:19:59,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-09-07 17:19:59,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2023-09-07 17:19:59,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:19:59,280 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:19:59,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 21.157894736842106) internal successors, (402), 19 states have internal predecessors, (402), 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-09-07 17:19:59,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:19:59,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:19:59,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-09-07 17:19:59,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:01,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:01,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:20:01,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-09-07 17:20:01,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-09-07 17:20:01,016 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-09-07 17:20:01,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:20:01,212 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 17:20:01,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:20:01,213 INFO L85 PathProgramCache]: Analyzing trace with hash -7198965, now seen corresponding path program 3 times [2023-09-07 17:20:01,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:20:01,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851719161] [2023-09-07 17:20:01,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:20:01,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:20:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:20:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-09-07 17:20:01,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:20:01,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851719161] [2023-09-07 17:20:01,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851719161] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:20:01,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262122199] [2023-09-07 17:20:01,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-07 17:20:01,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:20:01,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:20:01,852 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-09-07 17:20:01,854 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-09-07 17:20:02,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-09-07 17:20:02,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 17:20:02,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-07 17:20:02,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:20:02,494 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-09-07 17:20:02,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 17:20:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-09-07 17:20:02,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262122199] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 17:20:02,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 17:20:02,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2023-09-07 17:20:02,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447691676] [2023-09-07 17:20:02,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 17:20:02,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-09-07 17:20:02,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:20:02,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-09-07 17:20:02,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2023-09-07 17:20:02,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:02,911 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:20:02,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.705882352941176) internal successors, (296), 34 states have internal predecessors, (296), 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-09-07 17:20:02,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:02,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:20:02,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-09-07 17:20:02,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-09-07 17:20:02,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:20:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-09-07 17:20:04,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-09-07 17:20:04,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-09-07 17:20:04,671 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-09-07 17:20:04,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:20:04,869 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 17:20:04,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:20:04,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1413171997, now seen corresponding path program 4 times [2023-09-07 17:20:04,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:20:04,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159876738] [2023-09-07 17:20:04,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:20:04,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:20:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:20:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 35 proven. 32 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-09-07 17:20:05,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:20:05,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159876738] [2023-09-07 17:20:05,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159876738] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:20:05,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59697873] [2023-09-07 17:20:05,372 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-07 17:20:05,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:20:05,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:20:05,374 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-09-07 17:20:05,377 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-09-07 17:20:05,523 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-07 17:20:05,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 17:20:05,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-07 17:20:05,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:20:06,079 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 42 proven. 25 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-09-07 17:20:06,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 17:20:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 24 proven. 43 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-09-07 17:20:06,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59697873] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 17:20:06,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 17:20:06,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2023-09-07 17:20:06,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263808072] [2023-09-07 17:20:06,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 17:20:06,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-09-07 17:20:06,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:20:06,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-09-07 17:20:06,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2023-09-07 17:20:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:06,625 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:20:06,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 10.264705882352942) internal successors, (349), 34 states have internal predecessors, (349), 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-09-07 17:20:06,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:06,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:20:06,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-09-07 17:20:06,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-09-07 17:20:06,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-09-07 17:20:06,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:20:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-07 17:20:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-09-07 17:20:08,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-09-07 17:20:08,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-09-07 17:20:08,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-09-07 17:20:08,225 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-09-07 17:20:08,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:20:08,423 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 17:20:08,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:20:08,424 INFO L85 PathProgramCache]: Analyzing trace with hash -483738439, now seen corresponding path program 5 times [2023-09-07 17:20:08,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:20:08,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064528668] [2023-09-07 17:20:08,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:20:08,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:20:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:20:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-09-07 17:20:20,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:20:20,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064528668] [2023-09-07 17:20:20,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064528668] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:20:20,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129795792] [2023-09-07 17:20:20,753 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-07 17:20:20,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:20:20,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:20:20,757 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-09-07 17:20:20,780 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-09-07 17:20:21,379 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-09-07 17:20:21,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 17:20:21,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 158 conjunts are in the unsatisfiable core [2023-09-07 17:20:21,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:20:21,817 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-09-07 17:20:23,182 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-09-07 17:20:23,182 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-09-07 17:20:24,069 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-07 17:20:24,070 INFO L351 Elim1Store]: Elim1 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-09-07 17:20:26,399 INFO L322 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2023-09-07 17:20:26,399 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2023-09-07 17:20:27,850 INFO L322 Elim1Store]: treesize reduction 78, result has 29.7 percent of original size [2023-09-07 17:20:27,850 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 84 treesize of output 93 [2023-09-07 17:20:30,835 INFO L322 Elim1Store]: treesize reduction 156, result has 24.3 percent of original size [2023-09-07 17:20:30,836 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 159 treesize of output 157 [2023-09-07 17:20:37,150 INFO L322 Elim1Store]: treesize reduction 570, result has 46.7 percent of original size [2023-09-07 17:20:37,151 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 23 select indices, 23 select index equivalence classes, 10 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 253 case distinctions, treesize of input 411 treesize of output 645 [2023-09-07 17:25:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-09-07 17:25:20,339 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 17:25:28,427 WARN L839 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int)) (let ((.cse12 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse14 (store (select |c_#memory_int| c_~C~0.base) (+ .cse12 ~C~0.offset) (+ (select (select |c_#memory_int| c_~A~0.base) (+ .cse12 c_~A~0.offset)) (select (select |c_#memory_int| c_~B~0.base) (+ .cse12 c_~B~0.offset)))))) (let ((.cse15 (store |c_#memory_int| c_~C~0.base .cse14))) (let ((.cse10 (select .cse15 c_~B~0.base))) (let ((.cse9 (store .cse14 (+ .cse12 ~C~0.offset 4) (+ (select (select .cse15 c_~A~0.base) (+ .cse12 c_~A~0.offset 4)) (select .cse10 (+ .cse12 4 c_~B~0.offset)))))) (let ((.cse13 (store |c_#memory_int| c_~C~0.base .cse9))) (let ((.cse11 (select .cse13 c_~B~0.base)) (.cse6 (select .cse13 c_~A~0.base))) (let ((.cse8 (store .cse9 (+ .cse12 ~C~0.offset 8) (+ (select .cse11 (+ .cse12 8 c_~B~0.offset)) (select .cse6 (+ .cse12 c_~A~0.offset 8))))) (.cse7 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (select .cse11 (+ .cse7 4 c_~B~0.offset))) (.cse4 (select .cse10 (+ .cse7 c_~B~0.offset))) (.cse0 (select .cse9 ~C~0.offset)) (.cse1 (select .cse8 (+ ~C~0.offset 4))) (.cse2 (select .cse8 (+ ~C~0.offset 8))) (.cse5 (select .cse6 (+ c_~A~0.offset .cse7 4)))) (= (+ .cse0 .cse1 .cse2 (* (div (+ .cse3 c_~asum~0 .cse4 c_~bsum~0 .cse5) 4294967296) 4294967296) c_~csum~0) (+ .cse3 c_~asum~0 .cse4 c_~bsum~0 (* (div (+ .cse0 .cse1 .cse2 c_~csum~0) 4294967296) 4294967296) .cse5)))))))))))) is different from false [2023-09-07 17:25:56,895 WARN L839 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse4 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset))) (let ((.cse14 (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse1 .cse4)))) (let ((.cse15 (store |c_#memory_int| c_~C~0.base .cse14))) (let ((.cse11 (select .cse15 c_~B~0.base))) (let ((.cse2 (select .cse11 (+ 4 c_~B~0.offset))) (.cse6 (select (select .cse15 c_~A~0.base) (+ c_~A~0.offset 4)))) (let ((.cse13 (store |c_#memory_int| c_~C~0.base (store .cse14 (+ ~C~0.offset 4) (+ .cse2 .cse6))))) (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4)) (.cse9 (select .cse13 c_~A~0.base)) (.cse12 (select .cse13 c_~B~0.base))) (let ((.cse3 (select .cse12 (+ 8 c_~B~0.offset))) (.cse5 (select .cse9 (+ c_~A~0.offset 8))) (.cse0 (select .cse12 (+ .cse10 4 c_~B~0.offset))) (.cse7 (select .cse11 (+ .cse10 c_~B~0.offset))) (.cse8 (select .cse9 (+ c_~A~0.offset .cse10 4)))) (= (+ c_~asum~0 |c_thread1Thread1of1ForFork2_#t~mem2| c_~bsum~0 .cse0 (* (div (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 c_~csum~0) 4294967296) 4294967296) .cse7 .cse8) (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (* (div (+ c_~asum~0 |c_thread1Thread1of1ForFork2_#t~mem2| c_~bsum~0 .cse0 .cse7 .cse8) 4294967296) 4294967296) c_~csum~0))))))))))) is different from false [2023-09-07 17:26:29,568 WARN L839 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int)) (let ((.cse13 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select .cse13 c_~A~0.offset)) (.cse4 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset))) (let ((.cse16 (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse1 .cse4)))) (let ((.cse17 (store |c_#memory_int| c_~C~0.base .cse16))) (let ((.cse11 (select .cse17 c_~B~0.base))) (let ((.cse2 (select .cse11 (+ 4 c_~B~0.offset))) (.cse6 (select (select .cse17 c_~A~0.base) (+ c_~A~0.offset 4)))) (let ((.cse15 (store |c_#memory_int| c_~C~0.base (store .cse16 (+ ~C~0.offset 4) (+ .cse2 .cse6))))) (let ((.cse10 (select .cse15 c_~A~0.base)) (.cse12 (* |c_thread1Thread1of1ForFork2_#t~post1| 4)) (.cse14 (select .cse15 c_~B~0.base))) (let ((.cse3 (select .cse14 (+ 8 c_~B~0.offset))) (.cse0 (select .cse14 (+ 8 .cse12 c_~B~0.offset))) (.cse7 (select .cse13 (+ c_~A~0.offset .cse12 4))) (.cse8 (select .cse10 (+ c_~A~0.offset 8 .cse12))) (.cse9 (select .cse11 (+ .cse12 4 c_~B~0.offset))) (.cse5 (select .cse10 (+ c_~A~0.offset 8)))) (= (+ .cse0 c_~asum~0 c_~bsum~0 (* (div (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 c_~csum~0) 4294967296) 4294967296) .cse7 .cse8 .cse9) (+ .cse1 .cse2 .cse3 (* (div (+ .cse0 c_~asum~0 c_~bsum~0 .cse7 .cse8 .cse9) 4294967296) 4294967296) .cse4 .cse5 .cse6 c_~csum~0)))))))))))) is different from false [2023-09-07 17:27:37,200 WARN L839 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.base Int)) (let ((.cse16 (select |c_#memory_int| ~B~0.base)) (.cse15 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse15 c_~A~0.offset)) (.cse2 (select .cse16 c_~B~0.offset))) (let ((.cse18 (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse0 .cse2)))) (let ((.cse19 (store |c_#memory_int| c_~C~0.base .cse18))) (let ((.cse14 (select .cse19 ~B~0.base))) (let ((.cse1 (select (select .cse19 c_~A~0.base) (+ c_~A~0.offset 4))) (.cse3 (select .cse14 (+ 4 c_~B~0.offset)))) (let ((.cse17 (store |c_#memory_int| c_~C~0.base (store .cse18 (+ ~C~0.offset 4) (+ .cse1 .cse3))))) (let ((.cse11 (select .cse17 c_~A~0.base)) (.cse13 (* c_thread1Thread1of1ForFork2_~i~0 4)) (.cse12 (select .cse17 ~B~0.base))) (let ((.cse4 (select .cse12 (+ 8 c_~B~0.offset))) (.cse6 (select .cse16 (+ .cse13 c_~B~0.offset))) (.cse7 (select .cse15 (+ c_~A~0.offset .cse13 4))) (.cse8 (select .cse11 (+ c_~A~0.offset .cse13 8))) (.cse9 (select .cse14 (+ .cse13 4 c_~B~0.offset))) (.cse10 (select .cse12 (+ .cse13 8 c_~B~0.offset))) (.cse5 (select .cse11 (+ c_~A~0.offset 8)))) (= (+ (* (div (+ .cse0 .cse1 .cse2 .cse3 .cse4 c_~csum~0 .cse5) 4294967296) 4294967296) c_~asum~0 .cse6 c_~bsum~0 .cse7 .cse8 .cse9 .cse10) (+ .cse0 .cse1 .cse2 .cse3 .cse4 (* 4294967296 (div (+ c_~asum~0 .cse6 c_~bsum~0 .cse7 .cse8 .cse9 .cse10) 4294967296)) c_~csum~0 .cse5)))))))))))) is different from false [2023-09-07 17:27:39,231 WARN L839 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.base Int)) (let ((.cse16 (select |c_#memory_int| ~B~0.base)) (.cse15 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse15 c_~A~0.offset)) (.cse2 (select .cse16 c_~B~0.offset))) (let ((.cse18 (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ .cse0 .cse2)))) (let ((.cse19 (store |c_#memory_int| c_~C~0.base .cse18))) (let ((.cse14 (select .cse19 ~B~0.base))) (let ((.cse1 (select (select .cse19 c_~A~0.base) (+ c_~A~0.offset 4))) (.cse3 (select .cse14 (+ 4 c_~B~0.offset)))) (let ((.cse17 (store |c_#memory_int| c_~C~0.base (store .cse18 (+ ~C~0.offset 4) (+ .cse1 .cse3))))) (let ((.cse11 (select .cse17 c_~A~0.base)) (.cse13 (* c_thread1Thread1of1ForFork2_~i~0 4)) (.cse12 (select .cse17 ~B~0.base))) (let ((.cse4 (select .cse12 (+ 8 c_~B~0.offset))) (.cse6 (select .cse16 (+ .cse13 c_~B~0.offset))) (.cse7 (select .cse15 (+ c_~A~0.offset .cse13 4))) (.cse8 (select .cse11 (+ c_~A~0.offset .cse13 8))) (.cse9 (select .cse14 (+ .cse13 4 c_~B~0.offset))) (.cse10 (select .cse12 (+ .cse13 8 c_~B~0.offset))) (.cse5 (select .cse11 (+ c_~A~0.offset 8)))) (= (+ (* (div (+ .cse0 .cse1 .cse2 .cse3 .cse4 c_~csum~0 .cse5) 4294967296) 4294967296) c_~asum~0 .cse6 |c_thread1Thread1of1ForFork2_#t~mem2| c_~bsum~0 .cse7 .cse8 .cse9 .cse10) (+ .cse0 .cse1 .cse2 .cse3 .cse4 (* (div (+ c_~asum~0 .cse6 |c_thread1Thread1of1ForFork2_#t~mem2| c_~bsum~0 .cse7 .cse8 .cse9 .cse10) 4294967296) 4294967296) c_~csum~0 .cse5)))))))))))) is different from false [2023-09-07 17:27:45,650 WARN L234 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 219 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-09-07 17:27:45,651 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:27:45,659 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 1132506 treesize of output 438900 [2023-09-07 17:31:39,588 WARN L234 SmtUtils]: Spent 5.20s on a formula simplification. DAG size of input: 27 DAG size of output: 1 (called from [L 729] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-09-07 17:33:40,500 WARN L234 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 26 DAG size of output: 1 (called from [L 729] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-09-07 17:33:42,961 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-07 17:33:42,986 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-07 17:33:42,986 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-07 17:33:43,995 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-09-07 17:33:44,001 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-09-07 17:33:44,162 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-09-07 17:33:44,178 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 137 [2023-09-07 17:33:44,179 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-09-07 17:33:44,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-07 17:33:44,180 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:282) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:729) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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-09-07 17:33:44,183 INFO L158 Benchmark]: Toolchain (without parser) took 832708.17ms. Allocated memory was 166.7MB in the beginning and 962.6MB in the end (delta: 795.9MB). Free memory was 122.3MB in the beginning and 458.3MB in the end (delta: -336.0MB). Peak memory consumption was 600.5MB. Max. memory is 7.0GB. [2023-09-07 17:33:44,183 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 166.7MB. Free memory was 121.0MB in the beginning and 120.9MB in the end (delta: 149.9kB). There was no memory consumed. Max. memory is 7.0GB. [2023-09-07 17:33:44,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.84ms. Allocated memory is still 166.7MB. Free memory was 122.3MB in the beginning and 110.4MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB. [2023-09-07 17:33:44,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.78ms. Allocated memory is still 166.7MB. Free memory was 110.4MB in the beginning and 108.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-07 17:33:44,184 INFO L158 Benchmark]: Boogie Preprocessor took 27.41ms. Allocated memory is still 166.7MB. Free memory was 108.4MB in the beginning and 106.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-07 17:33:44,184 INFO L158 Benchmark]: RCFGBuilder took 545.53ms. Allocated memory is still 166.7MB. Free memory was 106.6MB in the beginning and 84.9MB in the end (delta: 21.7MB). Peak memory consumption was 22.0MB. Max. memory is 7.0GB. [2023-09-07 17:33:44,185 INFO L158 Benchmark]: TraceAbstraction took 831877.91ms. Allocated memory was 166.7MB in the beginning and 962.6MB in the end (delta: 795.9MB). Free memory was 84.3MB in the beginning and 458.3MB in the end (delta: -374.0MB). Peak memory consumption was 562.8MB. Max. memory is 7.0GB. [2023-09-07 17:33:44,186 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 166.7MB. Free memory was 121.0MB in the beginning and 120.9MB in the end (delta: 149.9kB). There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 214.84ms. Allocated memory is still 166.7MB. Free memory was 122.3MB in the beginning and 110.4MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 37.78ms. Allocated memory is still 166.7MB. Free memory was 110.4MB in the beginning and 108.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 27.41ms. Allocated memory is still 166.7MB. Free memory was 108.4MB in the beginning and 106.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 545.53ms. Allocated memory is still 166.7MB. Free memory was 106.6MB in the beginning and 84.9MB in the end (delta: 21.7MB). Peak memory consumption was 22.0MB. Max. memory is 7.0GB. * TraceAbstraction took 831877.91ms. Allocated memory was 166.7MB in the beginning and 962.6MB in the end (delta: 795.9MB). Free memory was 84.3MB in the beginning and 458.3MB in the end (delta: -374.0MB). Peak memory consumption was 562.8MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown