/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 17:58:27,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 17:58:27,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 17:58:27,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 17:58:27,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 17:58:27,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 17:58:27,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 17:58:27,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 17:58:27,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 17:58:27,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 17:58:27,854 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 17:58:27,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 17:58:27,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 17:58:27,856 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 17:58:27,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 17:58:27,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 17:58:27,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 17:58:27,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 17:58:27,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 17:58:27,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 17:58:27,858 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 17:58:27,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 17:58:27,859 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 17:58:27,859 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 17:58:27,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 17:58:27,860 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 17:58:27,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 17:58:27,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 17:58:27,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 17:58:27,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 17:58:27,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 17:58:27,862 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 17:58:27,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 17:58:27,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 17:58:27,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 17:58:27,863 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 17:58:28,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 17:58:28,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 17:58:28,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 17:58:28,222 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 17:58:28,222 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 17:58:28,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2023-08-26 17:58:29,363 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 17:58:29,554 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 17:58:29,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2023-08-26 17:58:29,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f4e46b80/9798433c9b784f6e9e97ff59f506a723/FLAG71b40002c [2023-08-26 17:58:29,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f4e46b80/9798433c9b784f6e9e97ff59f506a723 [2023-08-26 17:58:29,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 17:58:29,590 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 17:58:29,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 17:58:29,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 17:58:29,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 17:58:29,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 05:58:29" (1/1) ... [2023-08-26 17:58:29,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53502b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:29, skipping insertion in model container [2023-08-26 17:58:29,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 05:58:29" (1/1) ... [2023-08-26 17:58:29,625 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 17:58:29,925 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 17:58:29,937 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 17:58:29,965 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [253] [2023-08-26 17:58:29,969 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [253] [2023-08-26 17:58:29,989 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 17:58:30,031 INFO L206 MainTranslator]: Completed translation [2023-08-26 17:58:30,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:30 WrapperNode [2023-08-26 17:58:30,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 17:58:30,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 17:58:30,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 17:58:30,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 17:58:30,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:30" (1/1) ... [2023-08-26 17:58:30,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:30" (1/1) ... [2023-08-26 17:58:30,092 INFO L138 Inliner]: procedures = 171, calls = 27, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 88 [2023-08-26 17:58:30,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 17:58:30,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 17:58:30,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 17:58:30,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 17:58:30,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:30" (1/1) ... [2023-08-26 17:58:30,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:30" (1/1) ... [2023-08-26 17:58:30,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:30" (1/1) ... [2023-08-26 17:58:30,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:30" (1/1) ... [2023-08-26 17:58:30,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:30" (1/1) ... [2023-08-26 17:58:30,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:30" (1/1) ... [2023-08-26 17:58:30,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:30" (1/1) ... [2023-08-26 17:58:30,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:30" (1/1) ... [2023-08-26 17:58:30,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 17:58:30,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 17:58:30,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 17:58:30,139 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 17:58:30,140 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:30" (1/1) ... [2023-08-26 17:58:30,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 17:58:30,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:58:30,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 17:58:30,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 17:58:30,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 17:58:30,199 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-26 17:58:30,199 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-26 17:58:30,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 17:58:30,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 17:58:30,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 17:58:30,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 17:58:30,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 17:58:30,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 17:58:30,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 17:58:30,201 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 17:58:30,347 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 17:58:30,357 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 17:58:30,609 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 17:58:30,664 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 17:58:30,664 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-26 17:58:30,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:58:30 BoogieIcfgContainer [2023-08-26 17:58:30,666 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 17:58:30,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 17:58:30,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 17:58:30,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 17:58:30,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 05:58:29" (1/3) ... [2023-08-26 17:58:30,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144c877f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 05:58:30, skipping insertion in model container [2023-08-26 17:58:30,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:30" (2/3) ... [2023-08-26 17:58:30,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144c877f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 05:58:30, skipping insertion in model container [2023-08-26 17:58:30,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:58:30" (3/3) ... [2023-08-26 17:58:30,675 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2023-08-26 17:58:30,693 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 17:58:30,694 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2023-08-26 17:58:30,694 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 17:58:30,779 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 17:58:30,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 95 transitions, 195 flow [2023-08-26 17:58:30,879 INFO L124 PetriNetUnfolderBase]: 8/107 cut-off events. [2023-08-26 17:58:30,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:58:30,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 107 events. 8/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 79. Up to 4 conditions per place. [2023-08-26 17:58:30,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 95 transitions, 195 flow [2023-08-26 17:58:30,889 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 95 transitions, 195 flow [2023-08-26 17:58:30,893 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 17:58:30,907 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 95 transitions, 195 flow [2023-08-26 17:58:30,911 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 95 transitions, 195 flow [2023-08-26 17:58:30,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 95 transitions, 195 flow [2023-08-26 17:58:30,942 INFO L124 PetriNetUnfolderBase]: 8/107 cut-off events. [2023-08-26 17:58:30,942 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:58:30,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 107 events. 8/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 79. Up to 4 conditions per place. [2023-08-26 17:58:30,946 INFO L119 LiptonReduction]: Number of co-enabled transitions 1950 [2023-08-26 17:58:33,144 INFO L134 LiptonReduction]: Checked pairs total: 3638 [2023-08-26 17:58:33,144 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-08-26 17:58:33,155 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 17:58:33,160 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@14dd7205, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 17:58:33,161 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2023-08-26 17:58:33,165 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 17:58:33,165 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 17:58:33,165 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:58:33,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:58:33,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 17:58:33,167 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 29 more)] === [2023-08-26 17:58:33,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:58:33,171 INFO L85 PathProgramCache]: Analyzing trace with hash 15425, now seen corresponding path program 1 times [2023-08-26 17:58:33,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:58:33,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898073869] [2023-08-26 17:58:33,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:58:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:33,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:58:33,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898073869] [2023-08-26 17:58:33,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898073869] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:58:33,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:58:33,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:58:33,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008743195] [2023-08-26 17:58:33,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:58:33,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:58:33,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:58:33,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:58:33,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:58:33,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 194 [2023-08-26 17:58:33,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-08-26 17:58:33,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:58:33,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 194 [2023-08-26 17:58:33,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:58:33,475 INFO L124 PetriNetUnfolderBase]: 64/154 cut-off events. [2023-08-26 17:58:33,475 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:58:33,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 154 events. 64/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 605 event pairs, 56 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 283. Up to 142 conditions per place. [2023-08-26 17:58:33,477 INFO L140 encePairwiseOnDemand]: 186/194 looper letters, 23 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-26 17:58:33,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 111 flow [2023-08-26 17:58:33,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:58:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:58:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2023-08-26 17:58:33,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36769759450171824 [2023-08-26 17:58:33,491 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 214 transitions. [2023-08-26 17:58:33,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 214 transitions. [2023-08-26 17:58:33,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:58:33,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 214 transitions. [2023-08-26 17:58:33,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-08-26 17:58:33,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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-08-26 17:58:33,503 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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-08-26 17:58:33,505 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 77 flow. Second operand 3 states and 214 transitions. [2023-08-26 17:58:33,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 111 flow [2023-08-26 17:58:33,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 111 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 17:58:33,509 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 65 flow [2023-08-26 17:58:33,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2023-08-26 17:58:33,513 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2023-08-26 17:58:33,514 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 65 flow [2023-08-26 17:58:33,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-08-26 17:58:33,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:58:33,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 17:58:33,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 17:58:33,515 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 29 more)] === [2023-08-26 17:58:33,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:58:33,515 INFO L85 PathProgramCache]: Analyzing trace with hash 15426, now seen corresponding path program 1 times [2023-08-26 17:58:33,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:58:33,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472708140] [2023-08-26 17:58:33,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:33,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:58:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:33,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:58:33,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472708140] [2023-08-26 17:58:33,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472708140] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:58:33,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:58:33,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:58:33,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623973485] [2023-08-26 17:58:33,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:58:33,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:58:33,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:58:33,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:58:33,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:58:33,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 194 [2023-08-26 17:58:33,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-08-26 17:58:33,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:58:33,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 194 [2023-08-26 17:58:33,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:58:33,712 INFO L124 PetriNetUnfolderBase]: 104/257 cut-off events. [2023-08-26 17:58:33,713 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:58:33,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 257 events. 104/257 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1011 event pairs, 53 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 508. Up to 131 conditions per place. [2023-08-26 17:58:33,719 INFO L140 encePairwiseOnDemand]: 189/194 looper letters, 45 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-08-26 17:58:33,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 52 transitions, 209 flow [2023-08-26 17:58:33,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:58:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:58:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2023-08-26 17:58:33,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3900343642611684 [2023-08-26 17:58:33,725 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 227 transitions. [2023-08-26 17:58:33,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 227 transitions. [2023-08-26 17:58:33,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:58:33,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 227 transitions. [2023-08-26 17:58:33,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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-08-26 17:58:33,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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-08-26 17:58:33,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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-08-26 17:58:33,734 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 65 flow. Second operand 3 states and 227 transitions. [2023-08-26 17:58:33,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 52 transitions, 209 flow [2023-08-26 17:58:33,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 52 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:58:33,736 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 94 flow [2023-08-26 17:58:33,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2023-08-26 17:58:33,737 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2023-08-26 17:58:33,738 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 94 flow [2023-08-26 17:58:33,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-08-26 17:58:33,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:58:33,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 17:58:33,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 17:58:33,741 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 29 more)] === [2023-08-26 17:58:33,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:58:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1370384209, now seen corresponding path program 1 times [2023-08-26 17:58:33,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:58:33,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483055352] [2023-08-26 17:58:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:58:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:33,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:58:33,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483055352] [2023-08-26 17:58:33,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483055352] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:58:33,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:58:33,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:58:33,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033585131] [2023-08-26 17:58:33,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:58:33,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:58:33,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:58:33,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:58:33,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:58:33,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 194 [2023-08-26 17:58:33,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-08-26 17:58:33,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:58:33,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 194 [2023-08-26 17:58:33,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:58:33,891 INFO L124 PetriNetUnfolderBase]: 95/246 cut-off events. [2023-08-26 17:58:33,891 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-08-26 17:58:33,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 246 events. 95/246 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 997 event pairs, 31 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 564. Up to 200 conditions per place. [2023-08-26 17:58:33,894 INFO L140 encePairwiseOnDemand]: 190/194 looper letters, 30 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-08-26 17:58:33,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 172 flow [2023-08-26 17:58:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:58:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:58:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2023-08-26 17:58:33,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4570446735395189 [2023-08-26 17:58:33,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 266 transitions. [2023-08-26 17:58:33,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 266 transitions. [2023-08-26 17:58:33,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:58:33,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 266 transitions. [2023-08-26 17:58:33,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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-08-26 17:58:33,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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-08-26 17:58:33,902 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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-08-26 17:58:33,902 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 94 flow. Second operand 3 states and 266 transitions. [2023-08-26 17:58:33,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 172 flow [2023-08-26 17:58:33,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 17:58:33,905 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 100 flow [2023-08-26 17:58:33,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2023-08-26 17:58:33,907 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2023-08-26 17:58:33,907 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 100 flow [2023-08-26 17:58:33,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-08-26 17:58:33,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:58:33,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 17:58:33,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 17:58:33,908 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 29 more)] === [2023-08-26 17:58:33,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:58:33,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1370384208, now seen corresponding path program 1 times [2023-08-26 17:58:33,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:58:33,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876766098] [2023-08-26 17:58:33,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:33,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:58:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:34,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:58:34,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876766098] [2023-08-26 17:58:34,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876766098] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:58:34,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:58:34,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:58:34,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906114721] [2023-08-26 17:58:34,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:58:34,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:58:34,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:58:34,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:58:34,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:58:34,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 194 [2023-08-26 17:58:34,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-08-26 17:58:34,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:58:34,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 194 [2023-08-26 17:58:34,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:58:34,079 INFO L124 PetriNetUnfolderBase]: 97/236 cut-off events. [2023-08-26 17:58:34,079 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-08-26 17:58:34,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 236 events. 97/236 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 906 event pairs, 22 based on Foata normal form. 5/162 useless extension candidates. Maximal degree in co-relation 556. Up to 209 conditions per place. [2023-08-26 17:58:34,081 INFO L140 encePairwiseOnDemand]: 189/194 looper letters, 30 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2023-08-26 17:58:34,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 35 transitions, 174 flow [2023-08-26 17:58:34,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:58:34,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:58:34,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2023-08-26 17:58:34,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34536082474226804 [2023-08-26 17:58:34,083 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 201 transitions. [2023-08-26 17:58:34,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 201 transitions. [2023-08-26 17:58:34,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:58:34,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 201 transitions. [2023-08-26 17:58:34,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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-08-26 17:58:34,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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-08-26 17:58:34,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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-08-26 17:58:34,085 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 100 flow. Second operand 3 states and 201 transitions. [2023-08-26 17:58:34,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 35 transitions, 174 flow [2023-08-26 17:58:34,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:58:34,087 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 98 flow [2023-08-26 17:58:34,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2023-08-26 17:58:34,088 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2023-08-26 17:58:34,088 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 98 flow [2023-08-26 17:58:34,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-08-26 17:58:34,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:58:34,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:58:34,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 17:58:34,088 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 29 more)] === [2023-08-26 17:58:34,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:58:34,089 INFO L85 PathProgramCache]: Analyzing trace with hash -467764969, now seen corresponding path program 1 times [2023-08-26 17:58:34,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:58:34,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995751335] [2023-08-26 17:58:34,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:34,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:58:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:34,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:58:34,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995751335] [2023-08-26 17:58:34,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995751335] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:58:34,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:58:34,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:58:34,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230961667] [2023-08-26 17:58:34,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:58:34,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:58:34,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:58:34,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:58:34,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:58:34,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 194 [2023-08-26 17:58:34,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-08-26 17:58:34,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:58:34,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 194 [2023-08-26 17:58:34,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:58:34,173 INFO L124 PetriNetUnfolderBase]: 69/166 cut-off events. [2023-08-26 17:58:34,174 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-08-26 17:58:34,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 166 events. 69/166 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 533 event pairs, 7 based on Foata normal form. 8/134 useless extension candidates. Maximal degree in co-relation 409. Up to 123 conditions per place. [2023-08-26 17:58:34,175 INFO L140 encePairwiseOnDemand]: 185/194 looper letters, 22 selfloop transitions, 5 changer transitions 0/29 dead transitions. [2023-08-26 17:58:34,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 152 flow [2023-08-26 17:58:34,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:58:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:58:34,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2023-08-26 17:58:34,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3316151202749141 [2023-08-26 17:58:34,176 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 193 transitions. [2023-08-26 17:58:34,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 193 transitions. [2023-08-26 17:58:34,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:58:34,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 193 transitions. [2023-08-26 17:58:34,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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-08-26 17:58:34,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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-08-26 17:58:34,179 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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-08-26 17:58:34,179 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 98 flow. Second operand 3 states and 193 transitions. [2023-08-26 17:58:34,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 152 flow [2023-08-26 17:58:34,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 17:58:34,180 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 88 flow [2023-08-26 17:58:34,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2023-08-26 17:58:34,181 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -8 predicate places. [2023-08-26 17:58:34,181 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 88 flow [2023-08-26 17:58:34,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-08-26 17:58:34,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:58:34,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:58:34,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 17:58:34,182 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 29 more)] === [2023-08-26 17:58:34,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:58:34,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1449447420, now seen corresponding path program 1 times [2023-08-26 17:58:34,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:58:34,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920006528] [2023-08-26 17:58:34,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:34,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:58:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:34,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:58:34,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920006528] [2023-08-26 17:58:34,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920006528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:58:34,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:58:34,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:58:34,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089817874] [2023-08-26 17:58:34,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:58:34,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 17:58:34,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:58:34,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 17:58:34,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 17:58:34,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 194 [2023-08-26 17:58:34,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-08-26 17:58:34,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:58:34,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 194 [2023-08-26 17:58:34,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:58:34,443 INFO L124 PetriNetUnfolderBase]: 68/172 cut-off events. [2023-08-26 17:58:34,443 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-26 17:58:34,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 172 events. 68/172 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 531 event pairs, 4 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 422. Up to 124 conditions per place. [2023-08-26 17:58:34,445 INFO L140 encePairwiseOnDemand]: 186/194 looper letters, 31 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2023-08-26 17:58:34,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 202 flow [2023-08-26 17:58:34,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 17:58:34,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 17:58:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 269 transitions. [2023-08-26 17:58:34,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34664948453608246 [2023-08-26 17:58:34,447 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 269 transitions. [2023-08-26 17:58:34,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 269 transitions. [2023-08-26 17:58:34,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:58:34,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 269 transitions. [2023-08-26 17:58:34,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 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-08-26 17:58:34,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 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-08-26 17:58:34,450 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 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-08-26 17:58:34,450 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 88 flow. Second operand 4 states and 269 transitions. [2023-08-26 17:58:34,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 202 flow [2023-08-26 17:58:34,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 39 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 17:58:34,453 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 121 flow [2023-08-26 17:58:34,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2023-08-26 17:58:34,456 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -6 predicate places. [2023-08-26 17:58:34,456 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 121 flow [2023-08-26 17:58:34,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-08-26 17:58:34,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:58:34,457 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:58:34,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 17:58:34,457 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 29 more)] === [2023-08-26 17:58:34,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:58:34,458 INFO L85 PathProgramCache]: Analyzing trace with hash -318835747, now seen corresponding path program 1 times [2023-08-26 17:58:34,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:58:34,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583947719] [2023-08-26 17:58:34,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:34,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:58:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:34,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:58:34,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583947719] [2023-08-26 17:58:34,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583947719] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 17:58:34,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497512147] [2023-08-26 17:58:34,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:34,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:58:34,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:58:34,657 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 17:58:34,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 17:58:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:34,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-26 17:58:34,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 17:58:34,815 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 17:58:34,859 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 17:58:34,859 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 17:58:34,929 INFO L351 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 11 treesize of output 7 [2023-08-26 17:58:34,940 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-08-26 17:58:34,947 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-26 17:58:34,976 INFO L351 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 14 treesize of output 16 [2023-08-26 17:58:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:34,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 17:58:35,135 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:58:35,135 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 116 [2023-08-26 17:58:35,153 INFO L351 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 91 treesize of output 87 [2023-08-26 17:58:35,168 INFO L351 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 87 treesize of output 83 [2023-08-26 17:58:35,188 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:58:35,188 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-26 17:58:35,314 INFO L322 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-08-26 17:58:35,318 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 58 [2023-08-26 17:58:35,337 INFO L351 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 7 treesize of output 5 [2023-08-26 17:58:35,345 INFO L351 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 7 treesize of output 5 [2023-08-26 17:58:35,355 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 17:58:35,356 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 53 [2023-08-26 17:58:35,359 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-26 17:58:35,376 INFO L351 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 11 treesize of output 9 [2023-08-26 17:58:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:35,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497512147] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 17:58:35,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 17:58:35,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2023-08-26 17:58:35,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548786462] [2023-08-26 17:58:35,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 17:58:35,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 17:58:35,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:58:35,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 17:58:35,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=116, Unknown=1, NotChecked=0, Total=156 [2023-08-26 17:58:35,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 194 [2023-08-26 17:58:35,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 121 flow. Second operand has 13 states, 13 states have (on average 51.0) internal successors, (663), 13 states have internal predecessors, (663), 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-08-26 17:58:35,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:58:35,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 194 [2023-08-26 17:58:35,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:58:35,786 INFO L124 PetriNetUnfolderBase]: 113/304 cut-off events. [2023-08-26 17:58:35,786 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2023-08-26 17:58:35,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 304 events. 113/304 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1105 event pairs, 4 based on Foata normal form. 9/295 useless extension candidates. Maximal degree in co-relation 820. Up to 97 conditions per place. [2023-08-26 17:58:35,788 INFO L140 encePairwiseOnDemand]: 184/194 looper letters, 61 selfloop transitions, 17 changer transitions 0/80 dead transitions. [2023-08-26 17:58:35,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 80 transitions, 445 flow [2023-08-26 17:58:35,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 17:58:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 17:58:35,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 517 transitions. [2023-08-26 17:58:35,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2961053837342497 [2023-08-26 17:58:35,791 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 517 transitions. [2023-08-26 17:58:35,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 517 transitions. [2023-08-26 17:58:35,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:58:35,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 517 transitions. [2023-08-26 17:58:35,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 57.44444444444444) internal successors, (517), 9 states have internal predecessors, (517), 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-08-26 17:58:35,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 194.0) internal successors, (1940), 10 states have internal predecessors, (1940), 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-08-26 17:58:35,795 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 194.0) internal successors, (1940), 10 states have internal predecessors, (1940), 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-08-26 17:58:35,795 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 121 flow. Second operand 9 states and 517 transitions. [2023-08-26 17:58:35,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 80 transitions, 445 flow [2023-08-26 17:58:35,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 80 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 17:58:35,797 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 249 flow [2023-08-26 17:58:35,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=249, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2023-08-26 17:58:35,798 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2023-08-26 17:58:35,798 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 249 flow [2023-08-26 17:58:35,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.0) internal successors, (663), 13 states have internal predecessors, (663), 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-08-26 17:58:35,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:58:35,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:58:35,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-26 17:58:36,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:58:36,005 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err14ASSERT_VIOLATIONASSERT === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 29 more)] === [2023-08-26 17:58:36,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:58:36,005 INFO L85 PathProgramCache]: Analyzing trace with hash -127306543, now seen corresponding path program 1 times [2023-08-26 17:58:36,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:58:36,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989528607] [2023-08-26 17:58:36,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:36,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:58:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:36,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:58:36,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989528607] [2023-08-26 17:58:36,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989528607] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:58:36,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:58:36,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 17:58:36,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138432518] [2023-08-26 17:58:36,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:58:36,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 17:58:36,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:58:36,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 17:58:36,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 17:58:36,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 194 [2023-08-26 17:58:36,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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-08-26 17:58:36,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:58:36,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 194 [2023-08-26 17:58:36,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:58:36,173 INFO L124 PetriNetUnfolderBase]: 106/329 cut-off events. [2023-08-26 17:58:36,173 INFO L125 PetriNetUnfolderBase]: For 430/430 co-relation queries the response was YES. [2023-08-26 17:58:36,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 329 events. 106/329 cut-off events. For 430/430 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1340 event pairs, 22 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 1086. Up to 127 conditions per place. [2023-08-26 17:58:36,176 INFO L140 encePairwiseOnDemand]: 185/194 looper letters, 48 selfloop transitions, 25 changer transitions 0/75 dead transitions. [2023-08-26 17:58:36,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 75 transitions, 563 flow [2023-08-26 17:58:36,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 17:58:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 17:58:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 319 transitions. [2023-08-26 17:58:36,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3288659793814433 [2023-08-26 17:58:36,178 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 319 transitions. [2023-08-26 17:58:36,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 319 transitions. [2023-08-26 17:58:36,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:58:36,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 319 transitions. [2023-08-26 17:58:36,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 63.8) internal successors, (319), 5 states have internal predecessors, (319), 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-08-26 17:58:36,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 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-08-26 17:58:36,180 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 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-08-26 17:58:36,180 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 249 flow. Second operand 5 states and 319 transitions. [2023-08-26 17:58:36,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 75 transitions, 563 flow [2023-08-26 17:58:36,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 75 transitions, 556 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 17:58:36,185 INFO L231 Difference]: Finished difference. Result has 49 places, 61 transitions, 508 flow [2023-08-26 17:58:36,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=508, PETRI_PLACES=49, PETRI_TRANSITIONS=61} [2023-08-26 17:58:36,185 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2023-08-26 17:58:36,185 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 61 transitions, 508 flow [2023-08-26 17:58:36,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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-08-26 17:58:36,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:58:36,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:58:36,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 17:58:36,186 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 29 more)] === [2023-08-26 17:58:36,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:58:36,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2046653977, now seen corresponding path program 1 times [2023-08-26 17:58:36,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:58:36,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499607092] [2023-08-26 17:58:36,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:36,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:58:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:36,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:58:36,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499607092] [2023-08-26 17:58:36,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499607092] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 17:58:36,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747254534] [2023-08-26 17:58:36,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:36,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:58:36,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:58:36,371 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 17:58:36,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 17:58:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:36,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-26 17:58:36,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 17:58:36,466 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 17:58:36,484 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 17:58:36,484 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 17:58:36,516 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-26 17:58:36,549 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-26 17:58:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 17:58:36,553 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 17:58:36,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747254534] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:58:36,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 17:58:36,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-08-26 17:58:36,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66945046] [2023-08-26 17:58:36,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:58:36,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 17:58:36,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:58:36,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 17:58:36,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-26 17:58:36,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 194 [2023-08-26 17:58:36,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 61 transitions, 508 flow. Second operand has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 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-08-26 17:58:36,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:58:36,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 194 [2023-08-26 17:58:36,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:58:36,616 INFO L124 PetriNetUnfolderBase]: 78/272 cut-off events. [2023-08-26 17:58:36,616 INFO L125 PetriNetUnfolderBase]: For 676/676 co-relation queries the response was YES. [2023-08-26 17:58:36,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 272 events. 78/272 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1054 event pairs, 8 based on Foata normal form. 26/297 useless extension candidates. Maximal degree in co-relation 1117. Up to 171 conditions per place. [2023-08-26 17:58:36,618 INFO L140 encePairwiseOnDemand]: 187/194 looper letters, 44 selfloop transitions, 22 changer transitions 0/68 dead transitions. [2023-08-26 17:58:36,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 712 flow [2023-08-26 17:58:36,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 17:58:36,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 17:58:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 285 transitions. [2023-08-26 17:58:36,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29381443298969073 [2023-08-26 17:58:36,620 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 285 transitions. [2023-08-26 17:58:36,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 285 transitions. [2023-08-26 17:58:36,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:58:36,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 285 transitions. [2023-08-26 17:58:36,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 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-08-26 17:58:36,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 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-08-26 17:58:36,623 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 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-08-26 17:58:36,623 INFO L175 Difference]: Start difference. First operand has 49 places, 61 transitions, 508 flow. Second operand 5 states and 285 transitions. [2023-08-26 17:58:36,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 712 flow [2023-08-26 17:58:36,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 706 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-26 17:58:36,628 INFO L231 Difference]: Finished difference. Result has 52 places, 60 transitions, 542 flow [2023-08-26 17:58:36,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=542, PETRI_PLACES=52, PETRI_TRANSITIONS=60} [2023-08-26 17:58:36,629 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2023-08-26 17:58:36,629 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 60 transitions, 542 flow [2023-08-26 17:58:36,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 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-08-26 17:58:36,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:58:36,629 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:58:36,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 17:58:36,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-08-26 17:58:36,837 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err14ASSERT_VIOLATIONASSERT === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 29 more)] === [2023-08-26 17:58:36,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:58:36,838 INFO L85 PathProgramCache]: Analyzing trace with hash -845443846, now seen corresponding path program 1 times [2023-08-26 17:58:36,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:58:36,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111525831] [2023-08-26 17:58:36,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:36,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:58:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:37,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:58:37,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111525831] [2023-08-26 17:58:37,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111525831] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 17:58:37,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29458295] [2023-08-26 17:58:37,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:37,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:58:37,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:58:37,037 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 17:58:37,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 17:58:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:37,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-26 17:58:37,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 17:58:37,122 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 17:58:37,145 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 17:58:37,146 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 17:58:37,170 INFO L351 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 11 treesize of output 7 [2023-08-26 17:58:37,175 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-08-26 17:58:37,178 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-26 17:58:37,214 INFO L351 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 14 treesize of output 16 [2023-08-26 17:58:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:37,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 17:58:37,256 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_140) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2023-08-26 17:58:37,320 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:58:37,320 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 116 [2023-08-26 17:58:37,331 INFO L351 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 91 treesize of output 87 [2023-08-26 17:58:37,339 INFO L351 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 87 treesize of output 83 [2023-08-26 17:58:37,353 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:58:37,354 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-26 17:58:37,467 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:58:37,468 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2023-08-26 17:58:37,471 INFO L351 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 6 treesize of output 4 [2023-08-26 17:58:37,482 INFO L351 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 9 treesize of output 1 [2023-08-26 17:58:37,487 INFO L351 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 45 treesize of output 37 [2023-08-26 17:58:37,490 INFO L351 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 20 treesize of output 18 [2023-08-26 17:58:37,502 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-26 17:58:37,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-26 17:58:37,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29458295] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 17:58:37,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 17:58:37,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2023-08-26 17:58:37,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266504280] [2023-08-26 17:58:37,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 17:58:37,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-26 17:58:37,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:58:37,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-26 17:58:37,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=144, Unknown=1, NotChecked=24, Total=210 [2023-08-26 17:58:37,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 194 [2023-08-26 17:58:37,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 60 transitions, 542 flow. Second operand has 15 states, 15 states have (on average 46.266666666666666) internal successors, (694), 15 states have internal predecessors, (694), 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-08-26 17:58:37,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:58:37,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 194 [2023-08-26 17:58:37,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:58:38,035 INFO L124 PetriNetUnfolderBase]: 74/270 cut-off events. [2023-08-26 17:58:38,035 INFO L125 PetriNetUnfolderBase]: For 735/735 co-relation queries the response was YES. [2023-08-26 17:58:38,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 270 events. 74/270 cut-off events. For 735/735 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 971 event pairs, 2 based on Foata normal form. 8/277 useless extension candidates. Maximal degree in co-relation 1171. Up to 85 conditions per place. [2023-08-26 17:58:38,037 INFO L140 encePairwiseOnDemand]: 180/194 looper letters, 60 selfloop transitions, 40 changer transitions 0/102 dead transitions. [2023-08-26 17:58:38,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 102 transitions, 981 flow [2023-08-26 17:58:38,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-26 17:58:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-26 17:58:38,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 787 transitions. [2023-08-26 17:58:38,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2535438144329897 [2023-08-26 17:58:38,041 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 787 transitions. [2023-08-26 17:58:38,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 787 transitions. [2023-08-26 17:58:38,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:58:38,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 787 transitions. [2023-08-26 17:58:38,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 49.1875) internal successors, (787), 16 states have internal predecessors, (787), 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-08-26 17:58:38,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 194.0) internal successors, (3298), 17 states have internal predecessors, (3298), 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-08-26 17:58:38,050 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 194.0) internal successors, (3298), 17 states have internal predecessors, (3298), 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-08-26 17:58:38,050 INFO L175 Difference]: Start difference. First operand has 52 places, 60 transitions, 542 flow. Second operand 16 states and 787 transitions. [2023-08-26 17:58:38,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 102 transitions, 981 flow [2023-08-26 17:58:38,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 102 transitions, 923 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 17:58:38,056 INFO L231 Difference]: Finished difference. Result has 67 places, 72 transitions, 734 flow [2023-08-26 17:58:38,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=734, PETRI_PLACES=67, PETRI_TRANSITIONS=72} [2023-08-26 17:58:38,057 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 30 predicate places. [2023-08-26 17:58:38,057 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 72 transitions, 734 flow [2023-08-26 17:58:38,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 46.266666666666666) internal successors, (694), 15 states have internal predecessors, (694), 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-08-26 17:58:38,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:58:38,058 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:58:38,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 17:58:38,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:58:38,263 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err11ASSERT_VIOLATIONARRAY_INDEX === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 29 more)] === [2023-08-26 17:58:38,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:58:38,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1226586797, now seen corresponding path program 1 times [2023-08-26 17:58:38,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:58:38,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714946461] [2023-08-26 17:58:38,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:38,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:58:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:38,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:58:38,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714946461] [2023-08-26 17:58:38,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714946461] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 17:58:38,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436189742] [2023-08-26 17:58:38,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:38,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:58:38,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:58:38,454 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 17:58:38,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 17:58:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:38,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-26 17:58:38,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 17:58:38,562 INFO L351 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 6 treesize of output 5 [2023-08-26 17:58:38,603 INFO L351 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 7 treesize of output 5 [2023-08-26 17:58:38,605 INFO L351 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 5 treesize of output 3 [2023-08-26 17:58:38,607 INFO L351 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-08-26 17:58:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:38,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 17:58:38,691 INFO L351 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 102 treesize of output 98 [2023-08-26 17:58:38,698 INFO L351 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 98 treesize of output 94 [2023-08-26 17:58:38,833 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:58:38,834 INFO L351 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 97 treesize of output 113 [2023-08-26 17:58:38,841 INFO L351 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 91 treesize of output 87 [2023-08-26 17:58:38,846 INFO L351 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 87 treesize of output 83 [2023-08-26 17:58:38,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:38,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436189742] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 17:58:38,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 17:58:38,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-08-26 17:58:38,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149792279] [2023-08-26 17:58:38,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 17:58:38,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 17:58:38,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:58:38,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 17:58:38,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-26 17:58:38,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 194 [2023-08-26 17:58:38,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 72 transitions, 734 flow. Second operand has 9 states, 9 states have (on average 62.77777777777778) internal successors, (565), 9 states have internal predecessors, (565), 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-08-26 17:58:38,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:58:38,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 194 [2023-08-26 17:58:38,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:58:39,189 INFO L124 PetriNetUnfolderBase]: 127/442 cut-off events. [2023-08-26 17:58:39,190 INFO L125 PetriNetUnfolderBase]: For 1995/1995 co-relation queries the response was YES. [2023-08-26 17:58:39,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2256 conditions, 442 events. 127/442 cut-off events. For 1995/1995 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1767 event pairs, 5 based on Foata normal form. 13/454 useless extension candidates. Maximal degree in co-relation 2229. Up to 139 conditions per place. [2023-08-26 17:58:39,193 INFO L140 encePairwiseOnDemand]: 187/194 looper letters, 113 selfloop transitions, 42 changer transitions 0/157 dead transitions. [2023-08-26 17:58:39,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 157 transitions, 1754 flow [2023-08-26 17:58:39,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 17:58:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 17:58:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 808 transitions. [2023-08-26 17:58:39,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3470790378006873 [2023-08-26 17:58:39,196 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 808 transitions. [2023-08-26 17:58:39,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 808 transitions. [2023-08-26 17:58:39,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:58:39,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 808 transitions. [2023-08-26 17:58:39,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 67.33333333333333) internal successors, (808), 12 states have internal predecessors, (808), 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-08-26 17:58:39,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 194.0) internal successors, (2522), 13 states have internal predecessors, (2522), 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-08-26 17:58:39,202 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 194.0) internal successors, (2522), 13 states have internal predecessors, (2522), 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-08-26 17:58:39,202 INFO L175 Difference]: Start difference. First operand has 67 places, 72 transitions, 734 flow. Second operand 12 states and 808 transitions. [2023-08-26 17:58:39,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 157 transitions, 1754 flow [2023-08-26 17:58:39,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 157 transitions, 1681 flow, removed 27 selfloop flow, removed 5 redundant places. [2023-08-26 17:58:39,212 INFO L231 Difference]: Finished difference. Result has 78 places, 90 transitions, 1074 flow [2023-08-26 17:58:39,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1074, PETRI_PLACES=78, PETRI_TRANSITIONS=90} [2023-08-26 17:58:39,213 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 41 predicate places. [2023-08-26 17:58:39,213 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 90 transitions, 1074 flow [2023-08-26 17:58:39,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 62.77777777777778) internal successors, (565), 9 states have internal predecessors, (565), 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-08-26 17:58:39,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:58:39,213 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:58:39,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 17:58:39,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:58:39,419 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err11ASSERT_VIOLATIONARRAY_INDEX === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 29 more)] === [2023-08-26 17:58:39,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:58:39,419 INFO L85 PathProgramCache]: Analyzing trace with hash 923581187, now seen corresponding path program 2 times [2023-08-26 17:58:39,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:58:39,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382126728] [2023-08-26 17:58:39,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:39,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:58:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:39,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:58:39,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382126728] [2023-08-26 17:58:39,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382126728] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 17:58:39,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659733295] [2023-08-26 17:58:39,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 17:58:39,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:58:39,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:58:39,817 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 17:58:39,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 17:58:39,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 17:58:39,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 17:58:39,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-26 17:58:39,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 17:58:39,924 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 17:58:39,946 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 17:58:39,947 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 17:58:39,970 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-26 17:58:39,974 INFO L351 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 6 treesize of output 5 [2023-08-26 17:58:40,019 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-26 17:58:40,046 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 17:58:40,046 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 17:58:40,072 INFO L351 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 13 treesize of output 9 [2023-08-26 17:58:40,080 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-08-26 17:58:40,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-26 17:58:40,103 INFO L351 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 21 treesize of output 21 [2023-08-26 17:58:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:40,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 17:58:40,154 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int))) (< (mod (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_238) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65)) is different from false [2023-08-26 17:58:40,228 INFO L351 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 102 treesize of output 98 [2023-08-26 17:58:40,235 INFO L351 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 98 treesize of output 94 [2023-08-26 17:58:40,279 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int)) (or (< (mod (+ (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_238) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (<= c_~next_alloc_idx~0 64)) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_238 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int)) (or (< (mod (+ (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| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_238) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))))) is different from false [2023-08-26 17:58:40,448 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (v_ArrVal_234 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int)) (or (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_237) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_238) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_234) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (<= c_~next_alloc_idx~0 64)) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_234 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int)) (or (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_238) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_234) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))))) is different from false [2023-08-26 17:58:40,607 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:58:40,607 INFO L351 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 97 treesize of output 113 [2023-08-26 17:58:40,615 INFO L351 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 91 treesize of output 87 [2023-08-26 17:58:40,648 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:58:40,648 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-08-26 17:58:40,661 INFO L351 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 9 treesize of output 1 [2023-08-26 17:58:40,674 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:58:40,676 INFO L351 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 22 treesize of output 23 [2023-08-26 17:58:40,682 INFO L351 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 38 treesize of output 30 [2023-08-26 17:58:40,688 INFO L351 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 13 treesize of output 11 [2023-08-26 17:58:40,720 INFO L351 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 13 treesize of output 11 [2023-08-26 17:58:40,725 INFO L351 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 14 treesize of output 12 [2023-08-26 17:58:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 6 not checked. [2023-08-26 17:58:40,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659733295] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 17:58:40,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 17:58:40,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 20 [2023-08-26 17:58:40,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488077807] [2023-08-26 17:58:40,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 17:58:40,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-26 17:58:40,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:58:40,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-26 17:58:40,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=275, Unknown=4, NotChecked=108, Total=462 [2023-08-26 17:58:40,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 194 [2023-08-26 17:58:40,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 90 transitions, 1074 flow. Second operand has 22 states, 22 states have (on average 51.5) internal successors, (1133), 22 states have internal predecessors, (1133), 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-08-26 17:58:40,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:58:40,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 194 [2023-08-26 17:58:40,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:58:42,627 INFO L124 PetriNetUnfolderBase]: 140/496 cut-off events. [2023-08-26 17:58:42,627 INFO L125 PetriNetUnfolderBase]: For 3033/3033 co-relation queries the response was YES. [2023-08-26 17:58:42,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2729 conditions, 496 events. 140/496 cut-off events. For 3033/3033 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2143 event pairs, 6 based on Foata normal form. 4/499 useless extension candidates. Maximal degree in co-relation 2696. Up to 218 conditions per place. [2023-08-26 17:58:42,632 INFO L140 encePairwiseOnDemand]: 181/194 looper letters, 85 selfloop transitions, 75 changer transitions 0/162 dead transitions. [2023-08-26 17:58:42,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 162 transitions, 2080 flow [2023-08-26 17:58:42,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-26 17:58:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-26 17:58:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1179 transitions. [2023-08-26 17:58:42,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27624179943767574 [2023-08-26 17:58:42,640 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1179 transitions. [2023-08-26 17:58:42,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1179 transitions. [2023-08-26 17:58:42,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:58:42,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1179 transitions. [2023-08-26 17:58:42,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 53.59090909090909) internal successors, (1179), 22 states have internal predecessors, (1179), 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-08-26 17:58:42,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 194.0) internal successors, (4462), 23 states have internal predecessors, (4462), 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-08-26 17:58:42,650 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 194.0) internal successors, (4462), 23 states have internal predecessors, (4462), 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-08-26 17:58:42,650 INFO L175 Difference]: Start difference. First operand has 78 places, 90 transitions, 1074 flow. Second operand 22 states and 1179 transitions. [2023-08-26 17:58:42,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 162 transitions, 2080 flow [2023-08-26 17:58:42,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 162 transitions, 1985 flow, removed 23 selfloop flow, removed 4 redundant places. [2023-08-26 17:58:42,665 INFO L231 Difference]: Finished difference. Result has 104 places, 124 transitions, 1635 flow [2023-08-26 17:58:42,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1635, PETRI_PLACES=104, PETRI_TRANSITIONS=124} [2023-08-26 17:58:42,666 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 67 predicate places. [2023-08-26 17:58:42,666 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 124 transitions, 1635 flow [2023-08-26 17:58:42,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 51.5) internal successors, (1133), 22 states have internal predecessors, (1133), 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-08-26 17:58:42,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:58:42,667 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-08-26 17:58:42,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-26 17:58:42,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-26 17:58:42,873 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 29 more)] === [2023-08-26 17:58:42,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:58:42,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1299393860, now seen corresponding path program 1 times [2023-08-26 17:58:42,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:58:42,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232118708] [2023-08-26 17:58:42,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:42,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:58:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:43,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:58:43,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232118708] [2023-08-26 17:58:43,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232118708] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 17:58:43,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003312089] [2023-08-26 17:58:43,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:43,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:58:43,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:58:43,269 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 17:58:43,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 17:58:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:43,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-26 17:58:43,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 17:58:43,384 INFO L351 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 6 treesize of output 5 [2023-08-26 17:58:43,414 INFO L351 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 6 treesize of output 5 [2023-08-26 17:58:43,440 INFO L351 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 7 treesize of output 5 [2023-08-26 17:58:43,443 INFO L351 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-08-26 17:58:43,447 INFO L351 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 5 treesize of output 3 [2023-08-26 17:58:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:43,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 17:58:43,503 INFO L351 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 102 treesize of output 98 [2023-08-26 17:58:43,507 INFO L351 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 98 treesize of output 94 [2023-08-26 17:58:43,595 INFO L351 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 97 treesize of output 93 [2023-08-26 17:58:43,600 INFO L351 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 93 treesize of output 89 [2023-08-26 17:58:43,690 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:58:43,690 INFO L351 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 97 treesize of output 113 [2023-08-26 17:58:43,697 INFO L351 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 91 treesize of output 87 [2023-08-26 17:58:43,701 INFO L351 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 87 treesize of output 83 [2023-08-26 17:58:43,788 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:43,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003312089] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 17:58:43,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 17:58:43,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2023-08-26 17:58:43,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132238003] [2023-08-26 17:58:43,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 17:58:43,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 17:58:43,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:58:43,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 17:58:43,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-26 17:58:43,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 194 [2023-08-26 17:58:43,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 124 transitions, 1635 flow. Second operand has 11 states, 11 states have (on average 63.0) internal successors, (693), 11 states have internal predecessors, (693), 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-08-26 17:58:43,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:58:43,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 194 [2023-08-26 17:58:43,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:58:44,345 INFO L124 PetriNetUnfolderBase]: 177/661 cut-off events. [2023-08-26 17:58:44,345 INFO L125 PetriNetUnfolderBase]: For 5196/5196 co-relation queries the response was YES. [2023-08-26 17:58:44,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4179 conditions, 661 events. 177/661 cut-off events. For 5196/5196 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2886 event pairs, 7 based on Foata normal form. 23/683 useless extension candidates. Maximal degree in co-relation 4138. Up to 159 conditions per place. [2023-08-26 17:58:44,353 INFO L140 encePairwiseOnDemand]: 186/194 looper letters, 183 selfloop transitions, 80 changer transitions 0/265 dead transitions. [2023-08-26 17:58:44,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 265 transitions, 3717 flow [2023-08-26 17:58:44,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 17:58:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 17:58:44,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1034 transitions. [2023-08-26 17:58:44,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35532646048109967 [2023-08-26 17:58:44,357 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1034 transitions. [2023-08-26 17:58:44,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1034 transitions. [2023-08-26 17:58:44,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:58:44,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1034 transitions. [2023-08-26 17:58:44,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 68.93333333333334) internal successors, (1034), 15 states have internal predecessors, (1034), 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-08-26 17:58:44,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 194.0) internal successors, (3104), 16 states have internal predecessors, (3104), 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-08-26 17:58:44,365 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 194.0) internal successors, (3104), 16 states have internal predecessors, (3104), 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-08-26 17:58:44,365 INFO L175 Difference]: Start difference. First operand has 104 places, 124 transitions, 1635 flow. Second operand 15 states and 1034 transitions. [2023-08-26 17:58:44,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 265 transitions, 3717 flow [2023-08-26 17:58:44,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 265 transitions, 3517 flow, removed 38 selfloop flow, removed 10 redundant places. [2023-08-26 17:58:44,389 INFO L231 Difference]: Finished difference. Result has 120 places, 155 transitions, 2304 flow [2023-08-26 17:58:44,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2304, PETRI_PLACES=120, PETRI_TRANSITIONS=155} [2023-08-26 17:58:44,390 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 83 predicate places. [2023-08-26 17:58:44,390 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 155 transitions, 2304 flow [2023-08-26 17:58:44,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 63.0) internal successors, (693), 11 states have internal predecessors, (693), 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-08-26 17:58:44,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:58:44,391 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-08-26 17:58:44,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 17:58:44,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:58:44,597 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 29 more)] === [2023-08-26 17:58:44,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:58:44,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2061786801, now seen corresponding path program 1 times [2023-08-26 17:58:44,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:58:44,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739292509] [2023-08-26 17:58:44,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:44,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:58:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:45,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:58:45,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739292509] [2023-08-26 17:58:45,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739292509] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 17:58:45,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813291895] [2023-08-26 17:58:45,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:45,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:58:45,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:58:45,318 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 17:58:45,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 17:58:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:45,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-26 17:58:45,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 17:58:45,425 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 17:58:45,447 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 17:58:45,448 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 17:58:45,464 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-26 17:58:45,466 INFO L351 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 6 treesize of output 5 [2023-08-26 17:58:45,511 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-26 17:58:45,540 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 17:58:45,540 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-26 17:58:45,576 INFO L351 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 5 treesize of output 3 [2023-08-26 17:58:45,580 INFO L351 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-08-26 17:58:45,645 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-26 17:58:45,645 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 17:58:45,695 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:58:45,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-08-26 17:58:45,808 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-08-26 17:58:45,808 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2023-08-26 17:58:45,815 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-26 17:58:45,818 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-26 17:58:45,852 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-26 17:58:45,852 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2023-08-26 17:58:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:45,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 17:58:45,897 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_375 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) is different from false [2023-08-26 17:58:45,931 INFO L351 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 102 treesize of output 98 [2023-08-26 17:58:45,938 INFO L351 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 98 treesize of output 94 [2023-08-26 17:58:46,419 INFO L351 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 102 treesize of output 98 [2023-08-26 17:58:46,700 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (+ (select .cse0 0) 1) 0)) (< (mod (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse0 0 (+ c_~next_alloc_idx~0 2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= 0 (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|)))))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_371 Int) (v_ArrVal_373 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (< (mod (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= 0 (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|)))))) (<= c_~next_alloc_idx~0 62)))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_368))) (or (< (mod (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= 0 (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|)))))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-26 17:58:46,812 WARN L839 $PredicateComparison]: unable to prove that (and (or (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (+ (select .cse0 0) 1) 0)) (< (mod (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse0 0 (+ c_~next_alloc_idx~0 2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0))))))) (or (<= c_~next_alloc_idx~0 62) (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (< (mod (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))))) (< 64 c_~next_alloc_idx~0)) (or (forall ((v_ArrVal_366 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_368))) (or (< (mod (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0))))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-26 17:58:47,050 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:58:47,050 INFO L351 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 97 treesize of output 113 [2023-08-26 17:58:47,059 INFO L351 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 91 treesize of output 87 [2023-08-26 17:58:47,099 INFO L351 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 9 treesize of output 1 [2023-08-26 17:58:47,105 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:58:47,106 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-08-26 17:58:47,136 INFO L322 Elim1Store]: treesize reduction 14, result has 63.2 percent of original size [2023-08-26 17:58:47,137 INFO L351 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 58 [2023-08-26 17:58:47,149 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:58:47,150 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 45 [2023-08-26 17:58:47,158 INFO L351 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 11 treesize of output 9 [2023-08-26 17:58:47,232 INFO L322 Elim1Store]: treesize reduction 17, result has 50.0 percent of original size [2023-08-26 17:58:47,232 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 54 [2023-08-26 17:58:47,239 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2023-08-26 17:58:47,245 INFO L351 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 12 treesize of output 10 [2023-08-26 17:58:47,251 INFO L351 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 11 treesize of output 9 [2023-08-26 17:58:47,273 INFO L351 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 52 treesize of output 48 [2023-08-26 17:58:47,279 INFO L351 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 24 treesize of output 22 [2023-08-26 17:58:47,285 INFO L351 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 12 treesize of output 10 [2023-08-26 17:58:47,290 INFO L351 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 11 treesize of output 9 [2023-08-26 17:58:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-08-26 17:58:47,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813291895] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 17:58:47,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 17:58:47,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2023-08-26 17:58:47,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609861271] [2023-08-26 17:58:47,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 17:58:47,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-26 17:58:47,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:58:47,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-26 17:58:47,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=846, Unknown=10, NotChecked=186, Total=1190 [2023-08-26 17:58:47,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 194 [2023-08-26 17:58:47,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 155 transitions, 2304 flow. Second operand has 35 states, 35 states have (on average 51.31428571428572) internal successors, (1796), 35 states have internal predecessors, (1796), 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-08-26 17:58:47,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:58:47,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 194 [2023-08-26 17:58:47,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:58:49,096 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (let ((.cse0 (< 62 c_~next_alloc_idx~0)) (.cse3 (+ c_~next_alloc_idx~0 2)) (.cse9 (not (= (+ c_~next_alloc_idx~0 3) 0))) (.cse10 (< (mod (+ c_~next_alloc_idx~0 4) 4294967296) 65)) (.cse7 (<= c_~next_alloc_idx~0 64)) (.cse17 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_158| Int)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_158|) 0)))) (.cse14 (< |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)) (.cse12 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse8 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (.cse6 (< 64 c_~next_alloc_idx~0)) (.cse4 (<= c_~next_alloc_idx~0 62)) (.cse11 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1)))) (and (forall ((v_ArrVal_375 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (or (and (or .cse0 (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (let ((.cse1 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (+ (select .cse1 0) 1) 0)) (< (mod (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse1 0 .cse3)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0))))))) (or .cse4 (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (< (mod (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))))) .cse6) (or (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65))) .cse7) (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (= 5 (select .cse8 0)) (or (and .cse9 .cse10 (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int)) (or (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| |c_ULTIMATE.start_main_~#t~0#1.base|)))) .cse11) (or (and (or (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= 0 (+ (select (select .cse12 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1))) (< (mod (select (select (store (store .cse12 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65))) .cse4) (or .cse0 (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse13 (select .cse12 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (< (mod (select (select (store (store .cse12 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse13 0 .cse3)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= 0 (+ (select .cse13 0) 1)))))))) .cse14 .cse6 .cse11) (or (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (< (mod (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) .cse14 .cse7) (or (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse15 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= (+ (select .cse15 0) 1) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse15 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))) .cse6) (or (forall ((v_ArrVal_366 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_368))) (or (< (mod (select (select (store (store .cse16 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= (+ (select (select .cse16 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0))))) .cse7) (or .cse7 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))) (or .cse9 .cse17) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse10 .cse17) (or .cse14 .cse11 (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_368))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= (+ (select (select .cse18 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (< (mod (select (select (store (store .cse18 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))) .cse7) (or .cse4 .cse17) (or .cse14 .cse6 (forall ((v_ArrVal_375 (Array Int Int))) (< (mod (select (select (store .cse12 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65))) (or .cse6 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse19 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (+ (select .cse19 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse19 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65))))) (or .cse4 .cse11) (exists ((v_prenex_7 Int)) (= (select (select |c_#memory_int| v_prenex_7) 0) 3)) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_158| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_158|) 0)) (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int)) (or (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_158| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| |c_ULTIMATE.start_main_~#t~0#1.base|)))))))) is different from false [2023-08-26 17:58:49,131 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (< 64 c_~next_alloc_idx~0)) (.cse4 (<= c_~next_alloc_idx~0 64))) (and (or (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (+ (select .cse0 0) 1) 0)) (< (mod (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse0 0 (+ c_~next_alloc_idx~0 2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0))))))) (or (<= c_~next_alloc_idx~0 62) (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (< (mod (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))))) .cse3) (or (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65))) .cse4) (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (= 5 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 0)) (or (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= (+ (select .cse5 0) 1) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse5 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))) .cse3) (or (forall ((v_ArrVal_366 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_368))) (or (< (mod (select (select (store (store .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= (+ (select (select .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0))))) .cse4))) is different from false [2023-08-26 17:58:49,240 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (let ((.cse0 (< 62 c_~next_alloc_idx~0)) (.cse3 (+ c_~next_alloc_idx~0 2)) (.cse8 (not (= (+ c_~next_alloc_idx~0 3) 0))) (.cse9 (< (mod (+ c_~next_alloc_idx~0 4) 4294967296) 65)) (.cse7 (<= c_~next_alloc_idx~0 64)) (.cse17 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_158| Int)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_158|) 0)))) (.cse13 (< |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)) (.cse11 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse20 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (.cse6 (< 64 c_~next_alloc_idx~0)) (.cse4 (<= c_~next_alloc_idx~0 62)) (.cse10 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1))) (.cse14 (select .cse20 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (and (forall ((v_ArrVal_375 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (or (and (or .cse0 (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (let ((.cse1 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (+ (select .cse1 0) 1) 0)) (< (mod (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse1 0 .cse3)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0))))))) (or .cse4 (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (< (mod (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))))) .cse6) (or (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65))) .cse7) (or (and .cse8 .cse9 (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int)) (or (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| |c_ULTIMATE.start_main_~#t~0#1.base|)))) .cse10) (or (and (or (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= 0 (+ (select (select .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1))) (< (mod (select (select (store (store .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65))) .cse4) (or .cse0 (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse12 (select .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (< (mod (select (select (store (store .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse12 0 .cse3)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= 0 (+ (select .cse12 0) 1)))))))) .cse13 .cse6 .cse10) (<= 5 .cse14) (or (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (< (mod (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) .cse13 .cse7) (or (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse15 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= (+ (select .cse15 0) 1) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse15 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))) .cse6) (or (forall ((v_ArrVal_366 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_368))) (or (< (mod (select (select (store (store .cse16 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= (+ (select (select .cse16 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0))))) .cse7) (or .cse7 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))) (or .cse8 .cse17) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse9 .cse17) (or .cse13 .cse10 (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_368))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= (+ (select (select .cse18 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (< (mod (select (select (store (store .cse18 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))) .cse7) (or .cse4 .cse17) (or .cse13 .cse6 (forall ((v_ArrVal_375 (Array Int Int))) (< (mod (select (select (store .cse11 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65))) (or .cse6 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse19 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (+ (select .cse19 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse19 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65))))) (or .cse4 .cse10) (<= .cse14 5) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_158| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_158|) 0)) (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int)) (or (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_158| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| |c_ULTIMATE.start_main_~#t~0#1.base|)))))))) is different from false [2023-08-26 17:58:49,280 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (< 64 c_~next_alloc_idx~0)) (.cse4 (<= c_~next_alloc_idx~0 64))) (and (or (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (+ (select .cse0 0) 1) 0)) (< (mod (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse0 0 (+ c_~next_alloc_idx~0 2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0))))))) (or (<= c_~next_alloc_idx~0 62) (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (< (mod (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))))) .cse3) (or (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65))) .cse4) (or (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= (+ (select .cse5 0) 1) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse5 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))) .cse3) (or (forall ((v_ArrVal_366 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_368))) (or (< (mod (select (select (store (store .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= (+ (select (select .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0))))) .cse4))) is different from false [2023-08-26 17:58:49,313 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (< 64 c_~next_alloc_idx~0)) (.cse4 (<= c_~next_alloc_idx~0 64)) (.cse5 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (and (or (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (+ (select .cse0 0) 1) 0)) (< (mod (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse0 0 (+ c_~next_alloc_idx~0 2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0))))))) (or (<= c_~next_alloc_idx~0 62) (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (< (mod (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))))) .cse3) (or (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65))) .cse4) (<= 5 .cse5) (or (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= (+ (select .cse6 0) 1) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse6 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))) .cse3) (or (forall ((v_ArrVal_366 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_368))) (or (< (mod (select (select (store (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= (+ (select (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0))))) .cse4) (<= .cse5 5))) is different from false [2023-08-26 17:58:49,331 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65))) (<= c_~next_alloc_idx~0 64)) (< (mod (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65) (or (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= (+ (select .cse0 0) 1) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse0 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-08-26 17:58:49,397 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (< 64 c_~next_alloc_idx~0)) (.cse4 (<= c_~next_alloc_idx~0 64))) (and (or (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (+ (select .cse0 0) 1) 0)) (< (mod (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse0 0 (+ c_~next_alloc_idx~0 2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0))))))) (or (<= c_~next_alloc_idx~0 62) (forall ((v_ArrVal_366 Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (< (mod (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))))) .cse3) (or (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65))) .cse4) (< (mod (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65) (or (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= (+ (select .cse5 0) 1) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse5 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))) .cse3) (or (forall ((v_ArrVal_366 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_368))) (or (< (mod (select (select (store (store .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= (+ (select (select .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_366) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0))))) .cse4))) is different from false [2023-08-26 17:58:49,632 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse4 (<= c_~next_alloc_idx~0 64))) (and (or .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (let ((.cse1 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (+ (select .cse1 0) 1) 0)) (< (mod (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse1 0 (+ c_~next_alloc_idx~0 2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= 0 (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|)))))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_371 Int) (v_ArrVal_373 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (< (mod (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= 0 (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|)))))) (<= c_~next_alloc_idx~0 62)))) (or .cse4 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))) (or .cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (+ (select .cse5 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse5 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_368))) (or (< (mod (select (select (store (store .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= (+ (select (select .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (not (= 0 (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_156| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|)))))) .cse4))) is different from false [2023-08-26 17:58:50,352 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (let ((.cse4 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1))) (.cse6 (<= c_~next_alloc_idx~0 64)) (.cse2 (< |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)) (.cse3 (< 64 c_~next_alloc_idx~0)) (.cse0 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse7 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (and (or (and (or (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= 0 (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1))) (< (mod (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65))) (<= c_~next_alloc_idx~0 62)) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse1 (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (< (mod (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| (store .cse1 0 (+ c_~next_alloc_idx~0 2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65) (not (= 0 (+ (select .cse1 0) 1)))))))) .cse2 .cse3 .cse4) (or .cse2 .cse4 (forall ((v_ArrVal_371 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_368))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_371) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0)) (not (= (+ (select (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 1) 0)) (< (mod (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_154|) 0) 4294967296) 65)))) .cse6) (or (and (or (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (< (mod (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) .cse2 .cse6) (or .cse2 .cse3 (forall ((v_ArrVal_375 (Array Int Int))) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_375) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)))) (not (= (+ (select .cse7 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 0)))))) is different from false [2023-08-26 17:58:51,100 INFO L124 PetriNetUnfolderBase]: 221/773 cut-off events. [2023-08-26 17:58:51,101 INFO L125 PetriNetUnfolderBase]: For 9013/9013 co-relation queries the response was YES. [2023-08-26 17:58:51,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5437 conditions, 773 events. 221/773 cut-off events. For 9013/9013 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3578 event pairs, 4 based on Foata normal form. 7/779 useless extension candidates. Maximal degree in co-relation 5384. Up to 238 conditions per place. [2023-08-26 17:58:51,110 INFO L140 encePairwiseOnDemand]: 178/194 looper letters, 116 selfloop transitions, 164 changer transitions 0/282 dead transitions. [2023-08-26 17:58:51,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 282 transitions, 4681 flow [2023-08-26 17:58:51,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-26 17:58:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-26 17:58:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2011 transitions. [2023-08-26 17:58:51,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27278893109061314 [2023-08-26 17:58:51,115 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 2011 transitions. [2023-08-26 17:58:51,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 2011 transitions. [2023-08-26 17:58:51,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:58:51,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2011 transitions. [2023-08-26 17:58:51,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 52.921052631578945) internal successors, (2011), 38 states have internal predecessors, (2011), 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-08-26 17:58:51,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 194.0) internal successors, (7566), 39 states have internal predecessors, (7566), 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-08-26 17:58:51,131 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 194.0) internal successors, (7566), 39 states have internal predecessors, (7566), 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-08-26 17:58:51,131 INFO L175 Difference]: Start difference. First operand has 120 places, 155 transitions, 2304 flow. Second operand 38 states and 2011 transitions. [2023-08-26 17:58:51,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 282 transitions, 4681 flow [2023-08-26 17:58:51,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 282 transitions, 4658 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-08-26 17:58:51,167 INFO L231 Difference]: Finished difference. Result has 174 places, 247 transitions, 4388 flow [2023-08-26 17:58:51,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=2267, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=4388, PETRI_PLACES=174, PETRI_TRANSITIONS=247} [2023-08-26 17:58:51,168 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 137 predicate places. [2023-08-26 17:58:51,168 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 247 transitions, 4388 flow [2023-08-26 17:58:51,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 51.31428571428572) internal successors, (1796), 35 states have internal predecessors, (1796), 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-08-26 17:58:51,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:58:51,169 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-08-26 17:58:51,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 17:58:51,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:58:51,375 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 29 more)] === [2023-08-26 17:58:51,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:58:51,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1117898359, now seen corresponding path program 2 times [2023-08-26 17:58:51,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:58:51,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175120925] [2023-08-26 17:58:51,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:58:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:58:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:52,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:58:52,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175120925] [2023-08-26 17:58:52,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175120925] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 17:58:52,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022463418] [2023-08-26 17:58:52,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 17:58:52,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:58:52,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:58:52,217 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 17:58:52,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-26 17:58:52,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 17:58:52,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 17:58:52,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-26 17:58:52,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 17:58:52,476 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 17:58:52,498 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 17:58:52,498 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 17:58:52,513 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-26 17:58:52,515 INFO L351 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 6 treesize of output 5 [2023-08-26 17:58:52,557 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-26 17:58:52,586 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 17:58:52,587 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 17:58:52,633 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-26 17:58:52,638 INFO L351 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 11 treesize of output 7 [2023-08-26 17:58:52,689 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-26 17:58:52,737 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 17:58:52,737 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 17:58:52,818 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 17:58:52,828 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-08-26 17:58:52,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2023-08-26 17:58:52,837 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-08-26 17:58:52,840 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-26 17:58:52,881 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-26 17:58:52,882 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2023-08-26 17:58:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:58:52,921 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 17:58:53,018 INFO L351 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 102 treesize of output 98 [2023-08-26 17:58:53,024 INFO L351 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 98 treesize of output 94 [2023-08-26 17:58:53,630 INFO L351 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 102 treesize of output 98 [2023-08-26 17:58:54,327 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int) (v_ArrVal_444 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_444)) (.cse1 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_440))) (or (< (mod (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (not (= (select (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (not (= 0 (+ 1 (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|)))) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (not (= (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0))))) (<= c_~next_alloc_idx~0 64)) (or (< 64 c_~next_alloc_idx~0) (and (or (<= c_~next_alloc_idx~0 62) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_445 Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int)) (let ((.cse3 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0 c_~next_alloc_idx~0))) (.cse2 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_440))) (or (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (not (= (select (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (< (mod (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (not (= (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0)))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int)) (let ((.cse6 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0 c_~next_alloc_idx~0)))) (let ((.cse5 (select .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|)) (.cse4 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_440))) (or (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (not (= (select (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (not (= (+ (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (< (mod (select (select (store (store .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| (+ c_~next_alloc_idx~0 2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (not (= (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0)))))))))) is different from false [2023-08-26 17:58:54,739 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:58:54,740 INFO L351 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 97 treesize of output 113 [2023-08-26 17:58:54,749 INFO L351 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 91 treesize of output 87 [2023-08-26 17:58:54,781 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:58:54,781 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-08-26 17:58:54,791 INFO L351 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 9 treesize of output 1 [2023-08-26 17:58:54,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:58:54,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:58:54,819 INFO L322 Elim1Store]: treesize reduction 14, result has 63.2 percent of original size [2023-08-26 17:58:54,820 INFO L351 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 58 [2023-08-26 17:58:54,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:58:54,833 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:58:54,833 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 45 [2023-08-26 17:58:54,849 INFO L351 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 11 treesize of output 9 [2023-08-26 17:58:54,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:58:54,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:58:54,929 INFO L322 Elim1Store]: treesize reduction 17, result has 50.0 percent of original size [2023-08-26 17:58:54,929 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 54 [2023-08-26 17:58:54,937 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2023-08-26 17:58:54,944 INFO L351 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 11 treesize of output 9 [2023-08-26 17:58:54,950 INFO L351 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 12 treesize of output 10 [2023-08-26 17:58:54,973 INFO L351 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 52 treesize of output 48 [2023-08-26 17:58:54,979 INFO L351 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 11 treesize of output 9 [2023-08-26 17:58:54,984 INFO L351 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 24 treesize of output 22 [2023-08-26 17:58:54,989 INFO L351 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 12 treesize of output 10 [2023-08-26 17:58:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 2 times theorem prover too weak. 0 trivial. 7 not checked. [2023-08-26 17:58:55,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022463418] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 17:58:55,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 17:58:55,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 35 [2023-08-26 17:58:55,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875456502] [2023-08-26 17:58:55,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 17:58:55,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-26 17:58:55,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:58:55,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-26 17:58:55,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1056, Unknown=10, NotChecked=68, Total=1332 [2023-08-26 17:58:55,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 194 [2023-08-26 17:58:55,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 247 transitions, 4388 flow. Second operand has 37 states, 37 states have (on average 51.189189189189186) internal successors, (1894), 37 states have internal predecessors, (1894), 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-08-26 17:58:55,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:58:55,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 194 [2023-08-26 17:58:55,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:58:56,200 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (let ((.cse17 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse11 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (.cse15 (< |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)) (.cse16 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1))) (.cse10 (< (mod (+ c_~next_alloc_idx~0 4) 4294967296) 65)) (.cse22 (not (= (+ c_~next_alloc_idx~0 3) 0))) (.cse7 (<= c_~next_alloc_idx~0 64)) (.cse0 (<= c_~next_alloc_idx~0 62)) (.cse2 (< 62 c_~next_alloc_idx~0)) (.cse5 (+ c_~next_alloc_idx~0 2)) (.cse6 (< 64 c_~next_alloc_idx~0))) (and (or (and (or .cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_445 Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int)) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0 c_~next_alloc_idx~0)))) (or (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (< (mod (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65))))) (or .cse2 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int)) (let ((.cse4 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0 c_~next_alloc_idx~0)))) (let ((.cse3 (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|))) (or (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (not (= (+ (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (< (mod (select (select (store (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| .cse5)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65))))))) .cse6) (exists ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_160| Int)) (and (not (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_160| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= 3 (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_160|) 0)))) (or .cse7 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_445 Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int) (v_ArrVal_444 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_444))) (or (< (mod (select (select (store (store .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (not (= 0 (+ 1 (select (select .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|)))) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0))))) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_165| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int)) (let ((.cse9 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_165| v_ArrVal_440))) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_165|) 0)) (not (= (select (store .cse9 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) (not (= (select .cse9 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0))))) .cse10) (= 5 (select .cse11 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int) (v_ArrVal_444 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_444)) (.cse13 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_440))) (or (< (mod (select (select (store (store .cse12 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (not (= (select (store .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (not (= 0 (+ 1 (select (select .cse12 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|)))) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (not (= (select .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0))))) .cse7) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int)) (let ((.cse14 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|))) (or (not (= (+ (select .cse14 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| (store .cse14 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0))))) .cse6) (or .cse15 .cse6 .cse16 (and (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (not (= (+ (select (select .cse17 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (< (mod (select (select (store (store .cse17 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65))) .cse0) (or .cse2 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int)) (let ((.cse18 (select .cse17 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (not (= (+ (select .cse18 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (< (mod (select (select (store (store .cse17 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| (store .cse18 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| .cse5)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65))))))) (or (and (or (forall ((v_ArrVal_449 (Array Int Int))) (< (mod (select (select (store .cse17 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) .cse6) (or .cse7 (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int))) (< (mod (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)))) .cse15) (<= 0 |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_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_165| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_165|) 0)) (forall ((v_ArrVal_445 Int) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int)) (let ((.cse19 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_165| v_ArrVal_440))) (or (not (= (select (store .cse19 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= (select .cse19 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0)) (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| |c_ULTIMATE.start_main_~#t~0#1.base|)))))) (or .cse15 .cse16 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (v_ArrVal_444 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_444))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (not (= (+ (select (select .cse20 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (< (mod (select (select (store (store .cse20 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0)))) .cse7) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65))) .cse7) (or .cse16 (and (or (forall ((v_ArrVal_445 Int) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int)) (let ((.cse21 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_440))) (or (not (= (select (store .cse21 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) (not (= (select .cse21 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0))))) .cse10) .cse0 (or .cse22 (forall ((v_ArrVal_445 Int) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int)) (let ((.cse23 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_440))) (or (not (= (select (store .cse23 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= (select .cse23 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0)))))) (forall ((v_ArrVal_445 Int) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int)) (let ((.cse24 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_440))) (or (not (= (select (store .cse24 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= (select .cse24 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0)) (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| |c_ULTIMATE.start_main_~#t~0#1.base|)))))) (or .cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_165| Int)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_165|) 0)))) (or .cse22 (forall ((v_ArrVal_445 Int) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_165| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int)) (let ((.cse25 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_165| v_ArrVal_440))) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_165|) 0)) (not (= (select (store .cse25 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= (select .cse25 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0)))))) (<= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65))) .cse7) (or .cse6 (and (or .cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_445 Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int)) (let ((.cse27 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0 c_~next_alloc_idx~0))) (.cse26 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_440))) (or (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (not (= (select (store .cse26 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (not (= (+ (select (select .cse27 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (< (mod (select (select (store (store .cse27 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (not (= (select .cse26 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0)))))) (or .cse2 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int)) (let ((.cse30 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0 c_~next_alloc_idx~0)))) (let ((.cse29 (select .cse30 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|)) (.cse28 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_440))) (or (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (not (= (select (store .cse28 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (not (= (+ (select .cse29 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (< (mod (select (select (store (store .cse30 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| (store .cse29 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| .cse5)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (not (= (select .cse28 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0))))))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int)) (let ((.cse31 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|))) (or (not (= (+ (select .cse31 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| (store .cse31 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0)))) .cse6)))) is different from false [2023-08-26 17:58:56,229 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (<= c_~next_alloc_idx~0 64)) (.cse3 (< 64 c_~next_alloc_idx~0))) (and (= 5 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int) (v_ArrVal_444 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_444)) (.cse1 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_440))) (or (< (mod (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (not (= (select (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (not (= 0 (+ 1 (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|)))) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (not (= (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0))))) .cse2) (exists ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_160| Int)) (= 3 (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_160|) 0))) (<= 0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65))) .cse2) (<= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (or .cse3 (and (or (<= c_~next_alloc_idx~0 62) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_445 Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int)) (let ((.cse5 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0 c_~next_alloc_idx~0))) (.cse4 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_440))) (or (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (not (= (select (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (not (= (+ (select (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (< (mod (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (not (= (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0)))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int)) (let ((.cse8 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0 c_~next_alloc_idx~0)))) (let ((.cse7 (select .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|)) (.cse6 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_440))) (or (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (not (= (select (store .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (not (= (+ (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (< (mod (select (select (store (store .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| (+ c_~next_alloc_idx~0 2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (not (= (select .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0))))))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int)) (let ((.cse9 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|))) (or (not (= (+ (select .cse9 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| (store .cse9 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0)))) .cse3))) is different from false [2023-08-26 17:58:56,326 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (<= c_~next_alloc_idx~0 64)) (.cse3 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int) (v_ArrVal_444 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_444)) (.cse1 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_440))) (or (< (mod (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (not (= (select (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (not (= 0 (+ 1 (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|)))) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (not (= (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0))))) .cse2) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65))) .cse2) (or .cse3 (and (or (<= c_~next_alloc_idx~0 62) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_445 Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int)) (let ((.cse5 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0 c_~next_alloc_idx~0))) (.cse4 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_440))) (or (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (not (= (select (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (not (= (+ (select (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (< (mod (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (not (= (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0)))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_440 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| Int)) (let ((.cse8 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0 c_~next_alloc_idx~0)))) (let ((.cse7 (select .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|)) (.cse6 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_440))) (or (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (not (= (select (store .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (not (= (+ (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (< (mod (select (select (store (store .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| (+ c_~next_alloc_idx~0 2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (not (= (select .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_163|) 0))))))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int)) (let ((.cse9 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|))) (or (not (= (+ (select .cse9 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| (store .cse9 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0)))) .cse3))) is different from false [2023-08-26 17:58:58,182 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_449 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)) (< (mod (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65))) (<= c_~next_alloc_idx~0 64)) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int)) (let ((.cse0 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|))) (or (not (= (+ (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0)))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-08-26 17:58:58,223 WARN L839 $PredicateComparison]: unable to prove that (and (< (mod (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| v_ArrVal_447) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65))) (<= c_~next_alloc_idx~0 64)) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| Int) (v_ArrVal_445 Int) (v_ArrVal_449 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| Int)) (let ((.cse0 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|))) (or (not (= (+ (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_445) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161| (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_449) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_161|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_136| 0)))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-08-26 17:58:59,429 INFO L124 PetriNetUnfolderBase]: 278/951 cut-off events. [2023-08-26 17:58:59,429 INFO L125 PetriNetUnfolderBase]: For 18581/18581 co-relation queries the response was YES. [2023-08-26 17:58:59,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8231 conditions, 951 events. 278/951 cut-off events. For 18581/18581 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4855 event pairs, 5 based on Foata normal form. 10/961 useless extension candidates. Maximal degree in co-relation 8159. Up to 287 conditions per place. [2023-08-26 17:58:59,442 INFO L140 encePairwiseOnDemand]: 178/194 looper letters, 153 selfloop transitions, 238 changer transitions 0/393 dead transitions. [2023-08-26 17:58:59,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 393 transitions, 7885 flow [2023-08-26 17:58:59,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-26 17:58:59,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-26 17:58:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2070 transitions. [2023-08-26 17:58:59,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2735923869944489 [2023-08-26 17:58:59,447 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 2070 transitions. [2023-08-26 17:58:59,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 2070 transitions. [2023-08-26 17:58:59,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:58:59,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 2070 transitions. [2023-08-26 17:58:59,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 53.07692307692308) internal successors, (2070), 39 states have internal predecessors, (2070), 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-08-26 17:58:59,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 194.0) internal successors, (7760), 40 states have internal predecessors, (7760), 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-08-26 17:58:59,460 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 194.0) internal successors, (7760), 40 states have internal predecessors, (7760), 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-08-26 17:58:59,460 INFO L175 Difference]: Start difference. First operand has 174 places, 247 transitions, 4388 flow. Second operand 39 states and 2070 transitions. [2023-08-26 17:58:59,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 393 transitions, 7885 flow [2023-08-26 17:58:59,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 393 transitions, 7388 flow, removed 235 selfloop flow, removed 6 redundant places. [2023-08-26 17:58:59,530 INFO L231 Difference]: Finished difference. Result has 219 places, 347 transitions, 6685 flow [2023-08-26 17:58:59,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=3980, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=6685, PETRI_PLACES=219, PETRI_TRANSITIONS=347} [2023-08-26 17:58:59,531 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 182 predicate places. [2023-08-26 17:58:59,531 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 347 transitions, 6685 flow [2023-08-26 17:58:59,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 51.189189189189186) internal successors, (1894), 37 states have internal predecessors, (1894), 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-08-26 17:58:59,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:58:59,532 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-08-26 17:58:59,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-26 17:58:59,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-26 17:58:59,733 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 29 more)] === [2023-08-26 17:58:59,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:58:59,733 INFO L85 PathProgramCache]: Analyzing trace with hash -419754329, now seen corresponding path program 3 times [2023-08-26 17:58:59,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:58:59,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871010382] [2023-08-26 17:58:59,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:58:59,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:58:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:59:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:59:00,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:59:00,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871010382] [2023-08-26 17:59:00,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871010382] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 17:59:00,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356719652] [2023-08-26 17:59:00,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 17:59:00,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:59:00,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:59:00,483 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 17:59:00,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-26 17:59:00,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-26 17:59:00,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 17:59:00,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-26 17:59:00,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 17:59:00,757 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 17:59:00,788 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 17:59:00,788 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 17:59:00,829 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-26 17:59:00,832 INFO L351 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 11 treesize of output 7 [2023-08-26 17:59:00,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-26 17:59:00,950 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 17:59:00,950 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-26 17:59:01,044 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 17:59:01,058 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-08-26 17:59:01,058 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2023-08-26 17:59:01,075 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-08-26 17:59:01,240 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-26 17:59:01,308 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 17:59:01,308 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 17:59:01,370 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-08-26 17:59:01,372 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-26 17:59:01,378 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 17:59:01,405 INFO L322 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2023-08-26 17:59:01,405 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 48 [2023-08-26 17:59:01,695 INFO L322 Elim1Store]: treesize reduction 72, result has 54.1 percent of original size [2023-08-26 17:59:01,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 80 treesize of output 158 [2023-08-26 17:59:43,059 WARN L234 SmtUtils]: Spent 19.41s on a formula simplification. DAG size of input: 428 DAG size of output: 54 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 17:59:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:59:43,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 17:59:43,168 INFO L351 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 102 treesize of output 98 [2023-08-26 17:59:43,175 INFO L351 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 98 treesize of output 94 [2023-08-26 17:59:43,213 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_525 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_522 (Array Int Int))) (or (< (mod (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_522) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_525) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65) (= (select v_ArrVal_522 |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (or (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_525 (Array Int Int))) (or (< (mod (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| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_525) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0))) is different from false [2023-08-26 17:59:43,374 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_521 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_525 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169| Int)) (or (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_525) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_521) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0)) (or (forall ((v_ArrVal_521 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_525 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169| Int) (v_ArrVal_522 (Array Int Int))) (or (= (select v_ArrVal_522 |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169| v_ArrVal_522) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_525) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_521) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-26 17:59:43,481 WARN L839 $PredicateComparison]: unable to prove that (or (< |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (= (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (and (or (forall ((v_ArrVal_521 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_525 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169| Int)) (or (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_525) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_521) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0)) (or (forall ((v_ArrVal_521 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_525 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169| Int) (v_ArrVal_522 (Array Int Int))) (or (= (select v_ArrVal_522 |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169| v_ArrVal_522) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_525) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_521) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_169|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (<= c_~next_alloc_idx~0 64)))) is different from false [2023-08-26 17:59:43,521 INFO L351 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 107 treesize of output 103 [2023-08-26 17:59:44,479 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:59:44,479 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 116 [2023-08-26 17:59:44,496 INFO L351 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 91 treesize of output 87 [2023-08-26 17:59:44,510 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:59:44,510 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-26 17:59:44,555 INFO L351 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 9 treesize of output 1 [2023-08-26 17:59:44,791 INFO L322 Elim1Store]: treesize reduction 148, result has 50.8 percent of original size [2023-08-26 17:59:44,791 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 175 treesize of output 294 [2023-08-26 17:59:44,804 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:59:44,808 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 220 [2023-08-26 17:59:44,906 INFO L322 Elim1Store]: treesize reduction 11, result has 83.6 percent of original size [2023-08-26 17:59:44,906 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2535 treesize of output 2506 [2023-08-26 17:59:44,947 INFO L351 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 137 treesize of output 133 [2023-08-26 17:59:44,964 INFO L351 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 133 treesize of output 131 [2023-08-26 17:59:44,994 INFO L351 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 131 treesize of output 129 [2023-08-26 17:59:50,816 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:59:50,817 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 123 [2023-08-26 17:59:50,963 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:59:50,964 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 178 [2023-08-26 17:59:54,151 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:59:54,152 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2023-08-26 17:59:54,173 INFO L351 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 6 treesize of output 4 [2023-08-26 17:59:54,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:59:54,191 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-26 17:59:54,213 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:59:54,213 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2023-08-26 17:59:54,329 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:59:54,330 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2023-08-26 17:59:54,665 INFO L351 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 8 treesize of output 6 [2023-08-26 17:59:55,405 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 6 [2023-08-26 17:59:55,836 INFO L351 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 6 treesize of output 4 [2023-08-26 17:59:55,860 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-26 17:59:56,206 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:59:56,206 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 147 [2023-08-26 17:59:56,430 INFO L351 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 6 treesize of output 4 [2023-08-26 17:59:56,750 INFO L351 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 1003 treesize of output 991 [2023-08-26 17:59:58,474 INFO L351 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 6 treesize of output 4 [2023-08-26 17:59:58,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:59:58,492 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-26 17:59:58,516 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:59:58,516 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2023-08-26 17:59:58,654 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:59:58,654 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 150 [2023-08-26 17:59:59,068 INFO L351 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 102 treesize of output 100 [2023-08-26 17:59:59,364 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:59:59,365 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 378 treesize of output 449 [2023-08-26 18:00:09,035 INFO L351 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 6 treesize of output 4 [2023-08-26 18:00:09,280 INFO L351 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 105 treesize of output 103 [2023-08-26 18:00:09,386 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 6 [2023-08-26 18:00:09,473 INFO L351 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 6 treesize of output 4 [2023-08-26 18:00:18,607 WARN L234 SmtUtils]: Spent 8.75s on a formula simplification that was a NOOP. DAG size: 1059 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-08-26 18:00:18,607 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 18:00:18,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 23 select indices, 23 select index equivalence classes, 0 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 253 case distinctions, treesize of input 4095 treesize of output 6037 [2023-08-26 18:00:19,461 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-26 18:10:08,679 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-26 18:10:20,595 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-26 18:11:00,005 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-26 18:11:39,430 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. Received shutdown request... [2023-08-26 18:12:14,961 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-26 18:12:14,963 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (31 of 32 remaining) [2023-08-26 18:12:14,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-26 18:12:14,972 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 18:12:14,972 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 18:12:15,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-26 18:12:15,165 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. [2023-08-26 18:12:15,166 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 32 remaining) [2023-08-26 18:12:15,166 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (29 of 32 remaining) [2023-08-26 18:12:15,166 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (28 of 32 remaining) [2023-08-26 18:12:15,166 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err14ASSERT_VIOLATIONASSERT (27 of 32 remaining) [2023-08-26 18:12:15,166 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 32 remaining) [2023-08-26 18:12:15,167 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 32 remaining) [2023-08-26 18:12:15,167 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 32 remaining) [2023-08-26 18:12:15,167 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2023-08-26 18:12:15,167 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 32 remaining) [2023-08-26 18:12:15,167 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2023-08-26 18:12:15,167 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2023-08-26 18:12:15,167 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err14ASSERT_VIOLATIONASSERT (19 of 32 remaining) [2023-08-26 18:12:15,167 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 32 remaining) [2023-08-26 18:12:15,167 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2023-08-26 18:12:15,167 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2023-08-26 18:12:15,168 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 32 remaining) [2023-08-26 18:12:15,168 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2023-08-26 18:12:15,168 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2023-08-26 18:12:15,168 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (12 of 32 remaining) [2023-08-26 18:12:15,168 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2023-08-26 18:12:15,168 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 32 remaining) [2023-08-26 18:12:15,168 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2023-08-26 18:12:15,168 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2023-08-26 18:12:15,168 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2023-08-26 18:12:15,168 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 32 remaining) [2023-08-26 18:12:15,169 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2023-08-26 18:12:15,169 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2023-08-26 18:12:15,169 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 32 remaining) [2023-08-26 18:12:15,169 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 32 remaining) [2023-08-26 18:12:15,169 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 32 remaining) [2023-08-26 18:12:15,169 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 32 remaining) [2023-08-26 18:12:15,169 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:12:15,171 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-26 18:12:15,174 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:12:15,174 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:12:15,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:12:15 BasicIcfg [2023-08-26 18:12:15,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:12:15,177 INFO L158 Benchmark]: Toolchain (without parser) took 825586.63ms. Allocated memory was 352.3MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 310.1MB in the beginning and 1.3GB in the end (delta: -999.9MB). Peak memory consumption was 853.6MB. Max. memory is 16.0GB. [2023-08-26 18:12:15,177 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 352.3MB. Free memory was 330.0MB in the beginning and 329.8MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:12:15,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.91ms. Allocated memory is still 352.3MB. Free memory was 309.7MB in the beginning and 289.7MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-26 18:12:15,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.90ms. Allocated memory is still 352.3MB. Free memory was 289.7MB in the beginning and 287.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:12:15,178 INFO L158 Benchmark]: Boogie Preprocessor took 44.14ms. Allocated memory is still 352.3MB. Free memory was 287.7MB in the beginning and 286.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:12:15,178 INFO L158 Benchmark]: RCFGBuilder took 528.88ms. Allocated memory is still 352.3MB. Free memory was 286.6MB in the beginning and 264.6MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:12:15,178 INFO L158 Benchmark]: TraceAbstraction took 824507.22ms. Allocated memory was 352.3MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 263.6MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 807.5MB. Max. memory is 16.0GB. [2023-08-26 18:12:15,179 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 352.3MB. Free memory was 330.0MB in the beginning and 329.8MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 440.91ms. Allocated memory is still 352.3MB. Free memory was 309.7MB in the beginning and 289.7MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.90ms. Allocated memory is still 352.3MB. Free memory was 289.7MB in the beginning and 287.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 44.14ms. Allocated memory is still 352.3MB. Free memory was 287.7MB in the beginning and 286.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 528.88ms. Allocated memory is still 352.3MB. Free memory was 286.6MB in the beginning and 264.6MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 824507.22ms. Allocated memory was 352.3MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 263.6MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 807.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 253]: Unsoundness Warning unspecified type, defaulting to int C: short [253] - GenericResultAtLocation [Line: 253]: Unsoundness Warning unspecified type, defaulting to int C: short [253] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 91 PlacesBefore, 37 PlacesAfterwards, 95 TransitionsBefore, 36 TransitionsAfterwards, 1950 CoEnabledTransitionPairs, 6 FixpointIterations, 13 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 5 ChoiceCompositions, 99 TotalNumberOfCompositions, 3638 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2476, independent: 2228, independent conditional: 0, independent unconditional: 2228, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1031, independent: 985, independent conditional: 0, independent unconditional: 985, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2476, independent: 1243, independent conditional: 0, independent unconditional: 1243, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 1031, unknown conditional: 0, unknown unconditional: 1031] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 713]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 13ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 149 locations, 33 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 824.4s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 156 mSolverCounterUnknown, 929 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 929 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2569 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 265 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3396 IncrementalHoareTripleChecker+Invalid, 6386 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 265 mSolverCounterUnsat, 8 mSDtfsCounter, 3396 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 492 GetRequests, 239 SyntacticMatches, 18 SemanticMatches, 235 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6685occurred in iteration=15, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 377 NumberOfCodeBlocks, 377 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 499 ConstructedInterpolants, 96 QuantifiedInterpolants, 12426 SizeOfPredicates, 174 NumberOfNonLiveVariables, 1668 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 30 InterpolantComputations, 8 PerfectInterpolantSequences, 1/224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown