./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d2ba6107 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d05018e114128995041419dca600f2451b0df342be45761a900c0d0704b1b40b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 19:59:11,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 19:59:11,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-11-21 19:59:11,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 19:59:11,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 19:59:11,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 19:59:11,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 19:59:11,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 19:59:11,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 19:59:11,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 19:59:11,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 19:59:11,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 19:59:11,718 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 19:59:11,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 19:59:11,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 19:59:11,720 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 19:59:11,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 19:59:11,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 19:59:11,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 19:59:11,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 19:59:11,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 19:59:11,721 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 19:59:11,721 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 19:59:11,722 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 19:59:11,722 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 19:59:11,722 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 19:59:11,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 19:59:11,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 19:59:11,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 19:59:11,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:59:11,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 19:59:11,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 19:59:11,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 19:59:11,725 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 19:59:11,725 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-11-21 19:59:11,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 19:59:11,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 19:59:11,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 19:59:11,725 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 19:59:11,726 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 19:59:11,726 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 19:59:11,726 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/UGemCutter-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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d05018e114128995041419dca600f2451b0df342be45761a900c0d0704b1b40b [2023-11-21 19:59:11,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 19:59:12,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 19:59:12,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 19:59:12,003 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 19:59:12,004 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 19:59:12,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2023-11-21 19:59:13,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 19:59:13,280 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 19:59:13,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2023-11-21 19:59:13,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8794f4210/f358191653344103ae48ddc78251ae07/FLAG7a85a6f6b [2023-11-21 19:59:13,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8794f4210/f358191653344103ae48ddc78251ae07 [2023-11-21 19:59:13,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 19:59:13,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 19:59:13,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 19:59:13,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 19:59:13,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 19:59:13,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:59:13" (1/1) ... [2023-11-21 19:59:13,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cff3caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:59:13, skipping insertion in model container [2023-11-21 19:59:13,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:59:13" (1/1) ... [2023-11-21 19:59:13,354 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 19:59:13,592 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i[30907,30920] [2023-11-21 19:59:13,598 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:59:13,607 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 19:59:13,639 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i[30907,30920] [2023-11-21 19:59:13,652 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:59:13,674 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:59:13,674 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:59:13,680 INFO L206 MainTranslator]: Completed translation [2023-11-21 19:59:13,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:59:13 WrapperNode [2023-11-21 19:59:13,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 19:59:13,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 19:59:13,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 19:59:13,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 19:59:13,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:59:13" (1/1) ... [2023-11-21 19:59:13,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:59:13" (1/1) ... [2023-11-21 19:59:13,714 INFO L138 Inliner]: procedures = 173, calls = 30, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 86 [2023-11-21 19:59:13,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 19:59:13,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 19:59:13,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 19:59:13,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 19:59:13,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:59:13" (1/1) ... [2023-11-21 19:59:13,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:59:13" (1/1) ... [2023-11-21 19:59:13,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:59:13" (1/1) ... [2023-11-21 19:59:13,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:59:13" (1/1) ... [2023-11-21 19:59:13,737 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:59:13" (1/1) ... [2023-11-21 19:59:13,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:59:13" (1/1) ... [2023-11-21 19:59:13,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:59:13" (1/1) ... [2023-11-21 19:59:13,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:59:13" (1/1) ... [2023-11-21 19:59:13,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 19:59:13,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 19:59:13,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 19:59:13,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 19:59:13,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:59:13" (1/1) ... [2023-11-21 19:59:13,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:59:13,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:59:13,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 19:59:13,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 19:59:13,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 19:59:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-21 19:59:13,817 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-21 19:59:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 19:59:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 19:59:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 19:59:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 19:59:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 19:59:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 19:59:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 19:59:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 19:59:13,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 19:59:13,820 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 19:59:13,902 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 19:59:13,903 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 19:59:14,014 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 19:59:14,110 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 19:59:14,110 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 19:59:14,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:59:14 BoogieIcfgContainer [2023-11-21 19:59:14,112 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 19:59:14,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 19:59:14,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 19:59:14,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 19:59:14,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 07:59:13" (1/3) ... [2023-11-21 19:59:14,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f71c8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:59:14, skipping insertion in model container [2023-11-21 19:59:14,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:59:13" (2/3) ... [2023-11-21 19:59:14,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f71c8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:59:14, skipping insertion in model container [2023-11-21 19:59:14,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:59:14" (3/3) ... [2023-11-21 19:59:14,118 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2023-11-21 19:59:14,124 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 19:59:14,130 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 19:59:14,131 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-21 19:59:14,131 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 19:59:14,159 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 19:59:14,188 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:59:14,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:59:14,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:59:14,190 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 19:59:14,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-21 19:59:14,223 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:59:14,233 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-11-21 19:59:14,238 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=LoopHeads, 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;@2bb81886, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:59:14,238 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 19:59:14,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 19:59:14,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:59:14,386 INFO L85 PathProgramCache]: Analyzing trace with hash 421169331, now seen corresponding path program 1 times [2023-11-21 19:59:14,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:59:14,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809060416] [2023-11-21 19:59:14,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:59:14,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:59:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:59:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:59:14,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:59:14,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809060416] [2023-11-21 19:59:14,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809060416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:59:14,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:59:14,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 19:59:14,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793833588] [2023-11-21 19:59:14,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:59:14,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 19:59:14,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:59:14,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 19:59:14,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 19:59:14,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:14,674 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:59:14,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:59:14,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:14,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 19:59:14,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 19:59:14,923 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 19:59:14,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:59:14,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1479875300, now seen corresponding path program 1 times [2023-11-21 19:59:14,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:59:14,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747629906] [2023-11-21 19:59:14,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:59:14,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:59:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:59:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:59:15,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:59:15,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747629906] [2023-11-21 19:59:15,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747629906] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:59:15,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526310491] [2023-11-21 19:59:15,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:59:15,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:59:15,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:59:15,505 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:59:15,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 19:59:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:59:15,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-21 19:59:15,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:59:15,671 INFO L378 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-11-21 19:59:15,727 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 19:59:15,728 INFO L378 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 19 treesize of output 16 [2023-11-21 19:59:15,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-21 19:59:15,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-21 19:59:15,820 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 19:59:15,821 INFO L378 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-11-21 19:59:15,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-21 19:59:15,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 19:59:15,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-21 19:59:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:59:15,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:59:15,922 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_70 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) is different from false [2023-11-21 19:59:16,031 WARN L854 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_69 Int) (v_ArrVal_70 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_69)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_69 c_~next_alloc_idx~0)))) (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_70 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) is different from false [2023-11-21 19:59:16,143 WARN L854 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_69 Int) (v_ArrVal_66 Int) (v_ArrVal_70 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_66) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_69)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_69 c_~next_alloc_idx~0)))) (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_66 Int) (v_ArrVal_70 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_66) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0)))))) is different from false [2023-11-21 19:59:16,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:59:16,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2023-11-21 19:59:16,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:59:16,328 INFO L378 Elim1Store]: Elim1 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 18 treesize of output 19 [2023-11-21 19:59:16,332 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 23 [2023-11-21 19:59:16,336 INFO L378 Elim1Store]: Elim1 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-11-21 19:59:16,352 INFO L378 Elim1Store]: Elim1 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-11-21 19:59:16,355 INFO L378 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-11-21 19:59:16,367 INFO L378 Elim1Store]: Elim1 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-11-21 19:59:16,370 INFO L378 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-11-21 19:59:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 9 not checked. [2023-11-21 19:59:16,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526310491] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:59:16,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:59:16,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2023-11-21 19:59:16,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831137699] [2023-11-21 19:59:16,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:59:16,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-21 19:59:16,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:59:16,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-21 19:59:16,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=495, Unknown=7, NotChecked=144, Total=756 [2023-11-21 19:59:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:16,711 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:59:16,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 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-11-21 19:59:16,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 19:59:16,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:16,948 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< c_~next_alloc_idx~0 65))) (and (forall ((v_ArrVal_70 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (or .cse0 (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_69 Int) (v_ArrVal_66 Int) (v_ArrVal_70 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_66) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_69)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_69 c_~next_alloc_idx~0)))) (or .cse1 (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_66 Int) (v_ArrVal_70 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_66) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0))))) (<= 3 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (< 0 c_~top~0) (or .cse0 (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_69 Int) (v_ArrVal_70 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_69)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_69 c_~next_alloc_idx~0)))) (or .cse0 (and (or (< c_~next_alloc_idx~0 63) (forall ((v_prenex_11 Int) (v_prenex_10 Int)) (not (= 0 (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_11) v_prenex_10))))) (or (< 62 c_~next_alloc_idx~0) (and (or (< 0 (+ c_~next_alloc_idx~0 2)) (forall ((v_prenex_16 Int) (v_prenex_15 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_16) v_prenex_15) 0)))) (forall ((v_prenex_16 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_16) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))))))) (or .cse1 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_66 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_66) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0)))) (or .cse1 (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_70 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))))) is different from false [2023-11-21 19:59:16,953 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (and (forall ((v_ArrVal_70 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (or (< 64 c_~next_alloc_idx~0) (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_69 Int) (v_ArrVal_66 Int) (v_ArrVal_70 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_66) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_69)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_69 c_~next_alloc_idx~0)))) (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| Int) (v_ArrVal_66 Int) (v_ArrVal_70 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_70) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_66) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_18|) 0))))) (<= 3 .cse0) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= .cse0 |c_thr1Thread1of1ForFork0_push_#t~mem3#1|))) is different from false [2023-11-21 19:59:17,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 19:59:17,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:59:17,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-21 19:59:17,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-21 19:59:17,646 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 19:59:17,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:59:17,647 INFO L85 PathProgramCache]: Analyzing trace with hash -403938860, now seen corresponding path program 2 times [2023-11-21 19:59:17,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:59:17,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393875455] [2023-11-21 19:59:17,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:59:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:59:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:59:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 19:59:17,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:59:17,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393875455] [2023-11-21 19:59:17,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393875455] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:59:17,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759654759] [2023-11-21 19:59:17,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:59:17,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:59:17,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:59:17,808 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:59:17,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 19:59:17,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:59:17,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:59:17,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-21 19:59:17,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:59:17,912 INFO L378 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-11-21 19:59:17,939 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 19:59:17,942 INFO L378 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 19 treesize of output 16 [2023-11-21 19:59:17,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-21 19:59:17,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-21 19:59:18,012 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 19:59:18,012 INFO L378 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-11-21 19:59:18,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-21 19:59:18,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 19:59:18,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-21 19:59:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:59:18,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:59:18,090 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_127 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) is different from false [2023-11-21 19:59:21,062 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_127 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0)))) (< c_~next_alloc_idx~0 65)) (forall ((v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (forall ((v_ArrVal_124 Int)) (or (< v_ArrVal_124 c_~next_alloc_idx~0) (forall ((v_ArrVal_127 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_124)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0))))) is different from false [2023-11-21 19:59:21,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:59:21,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2023-11-21 19:59:21,290 INFO L378 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-11-21 19:59:21,293 INFO L378 Elim1Store]: Elim1 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-11-21 19:59:21,302 INFO L378 Elim1Store]: Elim1 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 46 treesize of output 42 [2023-11-21 19:59:21,331 INFO L378 Elim1Store]: Elim1 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-11-21 19:59:21,335 INFO L378 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-11-21 19:59:21,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:59:21,343 INFO L378 Elim1Store]: Elim1 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 18 treesize of output 19 [2023-11-21 19:59:21,347 INFO L378 Elim1Store]: Elim1 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 29 treesize of output 21 [2023-11-21 19:59:21,350 INFO L378 Elim1Store]: Elim1 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-11-21 19:59:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-21 19:59:23,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759654759] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:59:23,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:59:23,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2023-11-21 19:59:23,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228706262] [2023-11-21 19:59:23,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:59:23,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-21 19:59:23,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:59:23,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-21 19:59:23,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=416, Unknown=4, NotChecked=86, Total=600 [2023-11-21 19:59:23,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:23,623 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:59:23,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 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-11-21 19:59:23,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 19:59:23,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:59:23,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:23,821 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< c_~next_alloc_idx~0 65))) (and (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_ArrVal_123 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (or (< 0 (+ c_~next_alloc_idx~0 2)) (forall ((v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0)))) (or (< c_~next_alloc_idx~0 63) (forall ((v_prenex_29 Int) (v_prenex_28 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_28) v_prenex_29) 0)))))) (forall ((v_ArrVal_124 Int)) (or (< v_ArrVal_124 c_~next_alloc_idx~0) (forall ((v_ArrVal_127 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_124)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (or (forall ((v_ArrVal_127 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0)))) .cse1) (or .cse1 (forall ((v_ArrVal_127 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0))))) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (forall ((v_ArrVal_124 Int)) (or (< v_ArrVal_124 c_~next_alloc_idx~0) (forall ((v_ArrVal_127 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_124)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0)))) (<= 3 (select .cse0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_127 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (or (forall ((v_ArrVal_127 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) .cse1) (or .cse1 (and (forall ((v_prenex_38 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_38) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (forall ((v_prenex_33 Int) (v_prenex_32 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_32) v_prenex_33) 0))))) (< 0 c_~top~0) (forall ((v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (forall ((v_ArrVal_124 Int)) (or (< v_ArrVal_124 c_~next_alloc_idx~0) (forall ((v_ArrVal_127 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_124)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0)))))) is different from false [2023-11-21 19:59:24,778 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (and (or (forall ((v_ArrVal_127 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0)))) (< c_~next_alloc_idx~0 65)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (<= 3 .cse0) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_127 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (= .cse0 |c_thr1Thread1of1ForFork0_push_#t~mem3#1|) (forall ((v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (forall ((v_ArrVal_124 Int)) (or (< v_ArrVal_124 c_~next_alloc_idx~0) (forall ((v_ArrVal_127 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_124)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0)))))) is different from false [2023-11-21 19:59:25,735 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_127 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0)))) (< c_~next_alloc_idx~0 65)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (<= 3 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_127 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_ArrVal_123 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| Int)) (or (forall ((v_ArrVal_124 Int)) (or (< v_ArrVal_124 c_~next_alloc_idx~0) (forall ((v_ArrVal_127 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_124)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_127) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_123) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_22|) 0))))) is different from false [2023-11-21 19:59:42,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:59:44,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:59:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 19:59:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:59:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-21 19:59:52,781 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-21 19:59:52,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 19:59:52,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:59:52,996 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1] [2023-11-21 19:59:52,997 INFO L307 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2023-11-21 19:59:53,003 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:59:53,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:59:53,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:59:53,021 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 19:59:53,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2023-11-21 19:59:53,040 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:59:53,042 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-21 19:59:53,042 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=LoopHeads, 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;@2bb81886, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:59:53,042 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 19:59:53,121 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-21 19:59:53,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:59:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1016809227, now seen corresponding path program 1 times [2023-11-21 19:59:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:59:53,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018329040] [2023-11-21 19:59:53,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:59:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:59:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:59:53,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:59:53,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:59:53,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018329040] [2023-11-21 19:59:53,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018329040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:59:53,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:59:53,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:59:53,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619564144] [2023-11-21 19:59:53,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:59:53,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 19:59:53,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:59:53,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 19:59:53,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 19:59:53,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:53,173 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:59:53,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-11-21 19:59:53,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:53,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:59:53,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 19:59:53,224 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-21 19:59:53,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:59:53,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1016810188, now seen corresponding path program 1 times [2023-11-21 19:59:53,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:59:53,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295629198] [2023-11-21 19:59:53,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:59:53,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:59:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:59:53,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 19:59:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:59:53,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 19:59:53,259 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 19:59:53,259 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-21 19:59:53,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 19:59:53,261 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-21 19:59:53,261 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2023-11-21 19:59:53,262 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 19:59:53,262 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-21 19:59:53,273 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 19:59:53,275 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:59:53,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:59:53,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:59:53,288 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 19:59:53,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2023-11-21 19:59:53,291 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:59:53,299 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-21 19:59:53,299 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=LoopHeads, 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;@2bb81886, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:59:53,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 19:59:53,411 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-21 19:59:53,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:59:53,412 INFO L85 PathProgramCache]: Analyzing trace with hash 463343620, now seen corresponding path program 1 times [2023-11-21 19:59:53,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:59:53,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740288617] [2023-11-21 19:59:53,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:59:53,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:59:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:59:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 19:59:53,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:59:53,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740288617] [2023-11-21 19:59:53,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740288617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:59:53,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:59:53,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:59:53,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684986638] [2023-11-21 19:59:53,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:59:53,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 19:59:53,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:59:53,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 19:59:53,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 19:59:53,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:53,455 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:59:53,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-11-21 19:59:53,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:53,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 19:59:53,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 19:59:53,588 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-21 19:59:53,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:59:53,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1100195758, now seen corresponding path program 1 times [2023-11-21 19:59:53,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:59:53,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747290906] [2023-11-21 19:59:53,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:59:53,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:59:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:59:53,632 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-21 19:59:53,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:59:53,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747290906] [2023-11-21 19:59:53,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747290906] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:59:53,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:59:53,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:59:53,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101929258] [2023-11-21 19:59:53,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:59:53,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 19:59:53,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:59:53,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 19:59:53,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 19:59:53,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:53,634 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:59:53,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:59:53,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 19:59:53,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 19:59:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:59:53,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 19:59:53,766 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-21 19:59:53,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:59:53,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1100196719, now seen corresponding path program 1 times [2023-11-21 19:59:53,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:59:53,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908358251] [2023-11-21 19:59:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:59:53,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:59:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:59:53,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 19:59:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:59:53,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 19:59:53,799 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 19:59:53,799 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-21 19:59:53,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 19:59:53,800 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-21 19:59:53,800 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2023-11-21 19:59:53,800 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 19:59:53,800 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-21 19:59:53,813 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 19:59:53,815 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:59:53,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:59:53,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:59:53,816 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 19:59:53,821 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:59:53,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2023-11-21 19:59:53,821 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=LoopHeads, 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;@2bb81886, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:59:53,821 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 19:59:53,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2023-11-21 19:59:53,976 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 19:59:53,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:59:53,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2009929927, now seen corresponding path program 1 times [2023-11-21 19:59:53,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:59:53,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925295185] [2023-11-21 19:59:53,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:59:53,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:59:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:59:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 19:59:54,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:59:54,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925295185] [2023-11-21 19:59:54,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925295185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:59:54,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:59:54,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:59:54,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900764612] [2023-11-21 19:59:54,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:59:54,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 19:59:54,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:59:54,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 19:59:54,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 19:59:54,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:54,019 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:59:54,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-11-21 19:59:54,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:54,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 19:59:54,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 19:59:54,196 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 19:59:54,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:59:54,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1504953050, now seen corresponding path program 1 times [2023-11-21 19:59:54,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:59:54,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197886234] [2023-11-21 19:59:54,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:59:54,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:59:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:59:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-21 19:59:54,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:59:54,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197886234] [2023-11-21 19:59:54,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197886234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:59:54,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:59:54,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:59:54,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714074186] [2023-11-21 19:59:54,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:59:54,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 19:59:54,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:59:54,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 19:59:54,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 19:59:54,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:54,253 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:59:54,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-11-21 19:59:54,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 19:59:54,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 19:59:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:59:54,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 19:59:54,409 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 19:59:54,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:59:54,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2056780604, now seen corresponding path program 1 times [2023-11-21 19:59:54,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:59:54,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747916925] [2023-11-21 19:59:54,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:59:54,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:59:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:59:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-21 19:59:54,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:59:54,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747916925] [2023-11-21 19:59:54,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747916925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:59:54,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:59:54,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 19:59:54,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105079138] [2023-11-21 19:59:54,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:59:54,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 19:59:54,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:59:54,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 19:59:54,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 19:59:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:54,546 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:59:54,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:59:54,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 19:59:54,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:59:54,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:54,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 19:59:54,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 19:59:54,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:59:54,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 19:59:54,708 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 19:59:54,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:59:54,709 INFO L85 PathProgramCache]: Analyzing trace with hash -314407849, now seen corresponding path program 1 times [2023-11-21 19:59:54,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:59:54,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418454215] [2023-11-21 19:59:54,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:59:54,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:59:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:59:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:59:55,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:59:55,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418454215] [2023-11-21 19:59:55,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418454215] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:59:55,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746913917] [2023-11-21 19:59:55,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:59:55,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:59:55,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:59:55,929 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:59:55,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-21 19:59:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:59:56,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-21 19:59:56,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:59:56,151 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 19:59:56,190 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 19:59:56,210 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 19:59:56,258 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 19:59:56,282 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 19:59:56,309 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 19:59:56,335 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 19:59:56,361 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 19:59:56,388 INFO L378 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-11-21 19:59:56,410 INFO L378 Elim1Store]: Elim1 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-11-21 19:59:56,475 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 19:59:56,475 INFO L378 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-11-21 19:59:56,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 19:59:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:59:56,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:59:56,581 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_5) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) is different from false [2023-11-21 19:59:56,727 INFO L378 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-11-21 19:59:56,735 INFO L378 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-11-21 19:59:59,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:59:59,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2023-11-21 19:59:59,404 INFO L378 Elim1Store]: Elim1 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 7871 treesize of output 7861 [2023-11-21 19:59:59,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:59:59,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2023-11-21 19:59:59,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:59:59,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2023-11-21 19:59:59,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:59:59,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2023-11-21 20:00:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-21 20:00:00,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746913917] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:00:00,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:00:00,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 54 [2023-11-21 20:00:00,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275218847] [2023-11-21 20:00:00,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:00:00,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-11-21 20:00:00,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:00:00,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-11-21 20:00:00,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=2493, Unknown=8, NotChecked=106, Total=3080 [2023-11-21 20:00:00,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:00:00,015 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 20:00:00,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 7.2) internal successors, (396), 55 states have internal predecessors, (396), 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-11-21 20:00:00,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 20:00:00,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 20:00:00,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:00:00,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:00:28,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 20:00:28,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 20:00:28,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:00:28,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2023-11-21 20:00:29,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-21 20:00:29,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-21 20:00:29,201 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:00:29,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:00:29,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1438633232, now seen corresponding path program 2 times [2023-11-21 20:00:29,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:00:29,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984934753] [2023-11-21 20:00:29,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:00:29,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:00:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:00:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 66 proven. 1625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:00:34,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:00:34,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984934753] [2023-11-21 20:00:34,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984934753] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:00:34,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137542055] [2023-11-21 20:00:34,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 20:00:34,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:00:34,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 20:00:34,032 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:00:34,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-21 20:00:34,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-21 20:00:34,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 20:00:34,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-21 20:00:34,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:00:34,290 INFO L378 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-11-21 20:00:34,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-21 20:00:34,348 INFO L378 Elim1Store]: Elim1 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-11-21 20:00:34,507 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 20:00:34,507 INFO L378 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-11-21 20:00:34,556 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 63 treesize of output 73 [2023-11-21 20:00:34,574 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 16 [2023-11-21 20:00:34,610 INFO L378 Elim1Store]: Elim1 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 40 treesize of output 20 [2023-11-21 20:00:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 1589 trivial. 0 not checked. [2023-11-21 20:00:34,638 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 20:00:34,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137542055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:00:34,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 20:00:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [36] total 44 [2023-11-21 20:00:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184853133] [2023-11-21 20:00:34,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:00:34,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 20:00:34,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:00:34,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 20:00:34,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1800, Unknown=0, NotChecked=0, Total=1892 [2023-11-21 20:00:34,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:00:34,643 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 20:00:34,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 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-11-21 20:00:34,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 20:00:34,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-21 20:00:34,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:00:34,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 155 states. [2023-11-21 20:00:34,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:00:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 20:00:35,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 20:00:35,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 20:00:35,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2023-11-21 20:00:35,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 20:00:35,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-21 20:00:35,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:00:35,399 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:00:35,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:00:35,400 INFO L85 PathProgramCache]: Analyzing trace with hash -284377939, now seen corresponding path program 1 times [2023-11-21 20:00:35,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:00:35,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941966592] [2023-11-21 20:00:35,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:00:35,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:00:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:00:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1599 backedges. 0 proven. 1599 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:00:39,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:00:39,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941966592] [2023-11-21 20:00:39,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941966592] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:00:39,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275073565] [2023-11-21 20:00:39,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:00:39,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:00:39,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 20:00:39,730 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:00:39,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-21 20:00:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:00:40,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 1737 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-21 20:00:40,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:00:40,168 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,198 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,235 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,254 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,263 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,272 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,297 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,306 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,314 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,324 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,335 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,344 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,353 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,363 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,377 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,387 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,395 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,405 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,414 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,425 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,435 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,443 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,454 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,464 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,472 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-21 20:00:40,481 INFO L378 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-11-21 20:00:40,511 INFO L378 Elim1Store]: Elim1 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-11-21 20:00:40,564 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 20:00:40,564 INFO L378 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-11-21 20:00:40,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 20:00:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1599 backedges. 278 proven. 1311 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 20:00:40,656 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:00:40,932 INFO L378 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-11-21 20:00:40,938 INFO L378 Elim1Store]: Elim1 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 10 treesize of output 8 Killed by 15