/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 22:29:28,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 22:29:28,182 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-NoLbe.epf [2023-11-29 22:29:28,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 22:29:28,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 22:29:28,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 22:29:28,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 22:29:28,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 22:29:28,207 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 22:29:28,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 22:29:28,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 22:29:28,208 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 22:29:28,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 22:29:28,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 22:29:28,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 22:29:28,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 22:29:28,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 22:29:28,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 22:29:28,209 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 22:29:28,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 22:29:28,210 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 22:29:28,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 22:29:28,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 22:29:28,212 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 22:29:28,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 22:29:28,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 22:29:28,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 22:29:28,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 22:29:28,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 22:29:28,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 22:29:28,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 22:29:28,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 22:29:28,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 22:29:28,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-11-29 22:29:28,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 22:29:28,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 22:29:28,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 22:29:28,407 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 22:29:28,408 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 22:29:28,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2023-11-29 22:29:29,330 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 22:29:29,502 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 22:29:29,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2023-11-29 22:29:29,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4545a8b0/d99b4412ea524e5bbf1a178ad2e47406/FLAG243137b37 [2023-11-29 22:29:29,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4545a8b0/d99b4412ea524e5bbf1a178ad2e47406 [2023-11-29 22:29:29,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 22:29:29,523 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 22:29:29,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 22:29:29,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 22:29:29,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 22:29:29,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:29:29" (1/1) ... [2023-11-29 22:29:29,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35300db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:29:29, skipping insertion in model container [2023-11-29 22:29:29,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:29:29" (1/1) ... [2023-11-29 22:29:29,549 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 22:29:29,651 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2023-11-29 22:29:29,656 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 22:29:29,663 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 22:29:29,678 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2023-11-29 22:29:29,681 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 22:29:29,686 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 22:29:29,686 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 22:29:29,694 INFO L206 MainTranslator]: Completed translation [2023-11-29 22:29:29,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:29:29 WrapperNode [2023-11-29 22:29:29,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 22:29:29,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 22:29:29,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 22:29:29,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 22:29:29,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:29:29" (1/1) ... [2023-11-29 22:29:29,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:29:29" (1/1) ... [2023-11-29 22:29:29,723 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-11-29 22:29:29,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 22:29:29,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 22:29:29,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 22:29:29,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 22:29:29,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:29:29" (1/1) ... [2023-11-29 22:29:29,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:29:29" (1/1) ... [2023-11-29 22:29:29,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:29:29" (1/1) ... [2023-11-29 22:29:29,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:29:29" (1/1) ... [2023-11-29 22:29:29,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:29:29" (1/1) ... [2023-11-29 22:29:29,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:29:29" (1/1) ... [2023-11-29 22:29:29,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:29:29" (1/1) ... [2023-11-29 22:29:29,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:29:29" (1/1) ... [2023-11-29 22:29:29,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 22:29:29,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 22:29:29,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 22:29:29,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 22:29:29,748 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:29:29" (1/1) ... [2023-11-29 22:29:29,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 22:29:29,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:29:29,782 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-11-29 22:29:29,801 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-11-29 22:29:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 22:29:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 22:29:29,806 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 22:29:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 22:29:29,806 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 22:29:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 22:29:29,807 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 22:29:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 22:29:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 22:29:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 22:29:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 22:29:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 22:29:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 22:29:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 22:29:29,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 22:29:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 22:29:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 22:29:29,810 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 22:29:29,880 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 22:29:29,882 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 22:29:30,156 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 22:29:30,207 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 22:29:30,207 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 22:29:30,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:29:30 BoogieIcfgContainer [2023-11-29 22:29:30,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 22:29:30,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 22:29:30,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 22:29:30,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 22:29:30,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 10:29:29" (1/3) ... [2023-11-29 22:29:30,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14268339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 10:29:30, skipping insertion in model container [2023-11-29 22:29:30,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:29:29" (2/3) ... [2023-11-29 22:29:30,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14268339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 10:29:30, skipping insertion in model container [2023-11-29 22:29:30,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:29:30" (3/3) ... [2023-11-29 22:29:30,214 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2023-11-29 22:29:30,225 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 22:29:30,226 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 22:29:30,226 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 22:29:30,302 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 22:29:30,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 160 transitions, 341 flow [2023-11-29 22:29:30,387 INFO L124 PetriNetUnfolderBase]: 12/157 cut-off events. [2023-11-29 22:29:30,387 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 22:29:30,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 157 events. 12/157 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2023-11-29 22:29:30,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 160 transitions, 341 flow [2023-11-29 22:29:30,394 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 146 transitions, 310 flow [2023-11-29 22:29:30,400 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 22:29:30,404 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3cf77148, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 22:29:30,404 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-29 22:29:30,428 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 22:29:30,428 INFO L124 PetriNetUnfolderBase]: 12/145 cut-off events. [2023-11-29 22:29:30,428 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 22:29:30,428 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:29:30,429 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:29:30,429 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:29:30,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:29:30,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1087243074, now seen corresponding path program 1 times [2023-11-29 22:29:30,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:29:30,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709950584] [2023-11-29 22:29:30,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:29:30,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:29:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:29:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:29:31,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:29:31,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709950584] [2023-11-29 22:29:31,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709950584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:29:31,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:29:31,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 22:29:31,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929986407] [2023-11-29 22:29:31,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:29:31,013 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 22:29:31,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:29:31,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 22:29:31,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-11-29 22:29:31,040 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 160 [2023-11-29 22:29:31,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 146 transitions, 310 flow. Second operand has 8 states, 8 states have (on average 95.875) internal successors, (767), 8 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:31,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:29:31,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 160 [2023-11-29 22:29:31,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:29:31,301 INFO L124 PetriNetUnfolderBase]: 295/761 cut-off events. [2023-11-29 22:29:31,302 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2023-11-29 22:29:31,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 761 events. 295/761 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3711 event pairs, 167 based on Foata normal form. 5/599 useless extension candidates. Maximal degree in co-relation 1052. Up to 416 conditions per place. [2023-11-29 22:29:31,313 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 53 selfloop transitions, 8 changer transitions 12/150 dead transitions. [2023-11-29 22:29:31,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 150 transitions, 464 flow [2023-11-29 22:29:31,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 22:29:31,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 22:29:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 804 transitions. [2023-11-29 22:29:31,328 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.628125 [2023-11-29 22:29:31,328 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 804 transitions. [2023-11-29 22:29:31,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 804 transitions. [2023-11-29 22:29:31,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:29:31,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 804 transitions. [2023-11-29 22:29:31,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:31,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 160.0) internal successors, (1440), 9 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:31,343 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 160.0) internal successors, (1440), 9 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:31,346 INFO L307 CegarLoopForPetriNet]: 144 programPoint places, 7 predicate places. [2023-11-29 22:29:31,346 INFO L500 AbstractCegarLoop]: Abstraction has has 151 places, 150 transitions, 464 flow [2023-11-29 22:29:31,347 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.875) internal successors, (767), 8 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:31,347 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:29:31,347 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:29:31,348 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 22:29:31,348 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:29:31,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:29:31,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1096071011, now seen corresponding path program 1 times [2023-11-29 22:29:31,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:29:31,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062733182] [2023-11-29 22:29:31,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:29:31,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:29:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:29:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:29:31,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:29:31,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062733182] [2023-11-29 22:29:31,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062733182] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:29:31,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893617747] [2023-11-29 22:29:31,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:29:31,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:29:31,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:29:31,533 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-11-29 22:29:31,552 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-11-29 22:29:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:29:31,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 22:29:31,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:29:31,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:29:31,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:29:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:29:31,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893617747] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 22:29:31,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 22:29:31,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-11-29 22:29:31,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739614380] [2023-11-29 22:29:31,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:29:31,919 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 22:29:31,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:29:31,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 22:29:31,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-29 22:29:31,921 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 160 [2023-11-29 22:29:31,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 150 transitions, 464 flow. Second operand has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:31,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:29:31,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 160 [2023-11-29 22:29:31,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:29:32,083 INFO L124 PetriNetUnfolderBase]: 412/950 cut-off events. [2023-11-29 22:29:32,083 INFO L125 PetriNetUnfolderBase]: For 379/446 co-relation queries the response was YES. [2023-11-29 22:29:32,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 950 events. 412/950 cut-off events. For 379/446 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4764 event pairs, 188 based on Foata normal form. 11/777 useless extension candidates. Maximal degree in co-relation 1830. Up to 550 conditions per place. [2023-11-29 22:29:32,090 INFO L140 encePairwiseOnDemand]: 149/160 looper letters, 39 selfloop transitions, 7 changer transitions 12/157 dead transitions. [2023-11-29 22:29:32,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 157 transitions, 600 flow [2023-11-29 22:29:32,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 22:29:32,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 22:29:32,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2023-11-29 22:29:32,092 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.76875 [2023-11-29 22:29:32,092 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 861 transitions. [2023-11-29 22:29:32,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 861 transitions. [2023-11-29 22:29:32,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:29:32,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 861 transitions. [2023-11-29 22:29:32,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:32,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 160.0) internal successors, (1280), 8 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:32,096 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 160.0) internal successors, (1280), 8 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:32,097 INFO L307 CegarLoopForPetriNet]: 144 programPoint places, 13 predicate places. [2023-11-29 22:29:32,097 INFO L500 AbstractCegarLoop]: Abstraction has has 157 places, 157 transitions, 600 flow [2023-11-29 22:29:32,097 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:32,097 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:29:32,097 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:29:32,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 22:29:32,304 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:29:32,307 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:29:32,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:29:32,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1056125606, now seen corresponding path program 1 times [2023-11-29 22:29:32,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:29:32,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012781616] [2023-11-29 22:29:32,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:29:32,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:29:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:29:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:29:32,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:29:32,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012781616] [2023-11-29 22:29:32,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012781616] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:29:32,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922569316] [2023-11-29 22:29:32,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:29:32,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:29:32,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:29:32,529 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-11-29 22:29:32,559 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-11-29 22:29:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:29:32,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 22:29:32,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:29:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:29:32,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:29:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:29:32,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922569316] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 22:29:32,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 22:29:32,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2023-11-29 22:29:32,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151801768] [2023-11-29 22:29:32,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:29:32,877 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 22:29:32,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:29:32,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 22:29:32,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-11-29 22:29:32,882 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 160 [2023-11-29 22:29:32,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 157 transitions, 600 flow. Second operand has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:32,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:29:32,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 160 [2023-11-29 22:29:32,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:29:33,257 INFO L124 PetriNetUnfolderBase]: 1734/3206 cut-off events. [2023-11-29 22:29:33,257 INFO L125 PetriNetUnfolderBase]: For 2857/3189 co-relation queries the response was YES. [2023-11-29 22:29:33,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9349 conditions, 3206 events. 1734/3206 cut-off events. For 2857/3189 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 19734 event pairs, 320 based on Foata normal form. 41/2677 useless extension candidates. Maximal degree in co-relation 8933. Up to 1714 conditions per place. [2023-11-29 22:29:33,282 INFO L140 encePairwiseOnDemand]: 143/160 looper letters, 96 selfloop transitions, 27 changer transitions 12/226 dead transitions. [2023-11-29 22:29:33,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 226 transitions, 1216 flow [2023-11-29 22:29:33,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 22:29:33,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 22:29:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1183 transitions. [2023-11-29 22:29:33,285 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.739375 [2023-11-29 22:29:33,285 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1183 transitions. [2023-11-29 22:29:33,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1183 transitions. [2023-11-29 22:29:33,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:29:33,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1183 transitions. [2023-11-29 22:29:33,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.3) internal successors, (1183), 10 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:33,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 160.0) internal successors, (1760), 11 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:33,289 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 160.0) internal successors, (1760), 11 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:33,290 INFO L307 CegarLoopForPetriNet]: 144 programPoint places, 22 predicate places. [2023-11-29 22:29:33,290 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 226 transitions, 1216 flow [2023-11-29 22:29:33,290 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:33,290 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:29:33,291 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:29:33,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 22:29:33,495 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-29 22:29:33,496 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:29:33,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:29:33,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1861703146, now seen corresponding path program 2 times [2023-11-29 22:29:33,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:29:33,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460020307] [2023-11-29 22:29:33,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:29:33,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:29:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:29:33,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:29:33,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:29:33,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460020307] [2023-11-29 22:29:33,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460020307] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:29:33,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882373758] [2023-11-29 22:29:33,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 22:29:33,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:29:33,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:29:33,678 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-11-29 22:29:33,704 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-11-29 22:29:33,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 22:29:33,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:29:33,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 22:29:33,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:29:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:29:33,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:29:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:29:34,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882373758] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 22:29:34,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 22:29:34,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2023-11-29 22:29:34,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746579138] [2023-11-29 22:29:34,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:29:34,020 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 22:29:34,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:29:34,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 22:29:34,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-11-29 22:29:34,022 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 160 [2023-11-29 22:29:34,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 226 transitions, 1216 flow. Second operand has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:34,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:29:34,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 160 [2023-11-29 22:29:34,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:29:34,708 INFO L124 PetriNetUnfolderBase]: 3070/5428 cut-off events. [2023-11-29 22:29:34,708 INFO L125 PetriNetUnfolderBase]: For 6534/7548 co-relation queries the response was YES. [2023-11-29 22:29:34,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20448 conditions, 5428 events. 3070/5428 cut-off events. For 6534/7548 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 36309 event pairs, 391 based on Foata normal form. 126/4576 useless extension candidates. Maximal degree in co-relation 19825. Up to 3018 conditions per place. [2023-11-29 22:29:34,746 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 251 selfloop transitions, 55 changer transitions 12/409 dead transitions. [2023-11-29 22:29:34,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 409 transitions, 3249 flow [2023-11-29 22:29:34,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 22:29:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 22:29:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1532 transitions. [2023-11-29 22:29:34,748 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7365384615384616 [2023-11-29 22:29:34,749 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1532 transitions. [2023-11-29 22:29:34,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1532 transitions. [2023-11-29 22:29:34,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:29:34,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1532 transitions. [2023-11-29 22:29:34,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 117.84615384615384) internal successors, (1532), 13 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:34,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 160.0) internal successors, (2240), 14 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:34,754 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 160.0) internal successors, (2240), 14 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:34,754 INFO L307 CegarLoopForPetriNet]: 144 programPoint places, 34 predicate places. [2023-11-29 22:29:34,754 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 409 transitions, 3249 flow [2023-11-29 22:29:34,755 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:34,755 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:29:34,755 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:29:34,760 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-11-29 22:29:34,960 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:29:34,960 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:29:34,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:29:34,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1949570920, now seen corresponding path program 3 times [2023-11-29 22:29:34,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:29:34,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803077576] [2023-11-29 22:29:34,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:29:34,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:29:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:29:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:29:35,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:29:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803077576] [2023-11-29 22:29:35,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803077576] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:29:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655521034] [2023-11-29 22:29:35,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 22:29:35,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:29:35,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:29:35,083 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-11-29 22:29:35,108 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-11-29 22:29:35,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 22:29:35,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:29:35,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 22:29:35,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:29:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:29:35,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:29:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:29:35,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655521034] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:29:35,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:29:35,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2023-11-29 22:29:35,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100863308] [2023-11-29 22:29:35,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:29:35,445 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 22:29:35,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:29:35,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 22:29:35,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-11-29 22:29:35,447 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 160 [2023-11-29 22:29:35,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 409 transitions, 3249 flow. Second operand has 18 states, 18 states have (on average 111.05555555555556) internal successors, (1999), 18 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:35,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:29:35,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 160 [2023-11-29 22:29:35,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:29:36,468 INFO L124 PetriNetUnfolderBase]: 3758/7080 cut-off events. [2023-11-29 22:29:36,468 INFO L125 PetriNetUnfolderBase]: For 7541/9659 co-relation queries the response was YES. [2023-11-29 22:29:36,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31046 conditions, 7080 events. 3758/7080 cut-off events. For 7541/9659 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 52746 event pairs, 421 based on Foata normal form. 77/6141 useless extension candidates. Maximal degree in co-relation 27529. Up to 3557 conditions per place. [2023-11-29 22:29:36,531 INFO L140 encePairwiseOnDemand]: 143/160 looper letters, 516 selfloop transitions, 112 changer transitions 12/731 dead transitions. [2023-11-29 22:29:36,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 731 transitions, 7599 flow [2023-11-29 22:29:36,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 22:29:36,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-29 22:29:36,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2320 transitions. [2023-11-29 22:29:36,535 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.725 [2023-11-29 22:29:36,535 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2320 transitions. [2023-11-29 22:29:36,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2320 transitions. [2023-11-29 22:29:36,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:29:36,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2320 transitions. [2023-11-29 22:29:36,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 116.0) internal successors, (2320), 20 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:36,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 160.0) internal successors, (3360), 21 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:36,543 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 160.0) internal successors, (3360), 21 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:36,543 INFO L307 CegarLoopForPetriNet]: 144 programPoint places, 53 predicate places. [2023-11-29 22:29:36,543 INFO L500 AbstractCegarLoop]: Abstraction has has 197 places, 731 transitions, 7599 flow [2023-11-29 22:29:36,544 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 111.05555555555556) internal successors, (1999), 18 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:36,544 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:29:36,544 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:29:36,551 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-11-29 22:29:36,749 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:29:36,749 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:29:36,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:29:36,750 INFO L85 PathProgramCache]: Analyzing trace with hash 147853648, now seen corresponding path program 4 times [2023-11-29 22:29:36,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:29:36,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011509398] [2023-11-29 22:29:36,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:29:36,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:29:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:29:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:29:36,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:29:36,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011509398] [2023-11-29 22:29:36,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011509398] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:29:36,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438527271] [2023-11-29 22:29:36,962 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 22:29:36,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:29:36,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:29:36,964 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-11-29 22:29:36,967 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-11-29 22:29:37,045 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 22:29:37,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:29:37,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 22:29:37,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:29:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:29:37,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:29:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:29:37,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438527271] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 22:29:37,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 22:29:37,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2023-11-29 22:29:37,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267267280] [2023-11-29 22:29:37,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:29:37,279 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 22:29:37,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:29:37,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 22:29:37,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-11-29 22:29:37,280 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 160 [2023-11-29 22:29:37,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 731 transitions, 7599 flow. Second operand has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:37,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:29:37,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 160 [2023-11-29 22:29:37,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:29:38,308 INFO L124 PetriNetUnfolderBase]: 3740/7019 cut-off events. [2023-11-29 22:29:38,309 INFO L125 PetriNetUnfolderBase]: For 12048/14770 co-relation queries the response was YES. [2023-11-29 22:29:38,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36202 conditions, 7019 events. 3740/7019 cut-off events. For 12048/14770 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 52298 event pairs, 348 based on Foata normal form. 292/6287 useless extension candidates. Maximal degree in co-relation 35256. Up to 3545 conditions per place. [2023-11-29 22:29:38,379 INFO L140 encePairwiseOnDemand]: 142/160 looper letters, 515 selfloop transitions, 115 changer transitions 12/733 dead transitions. [2023-11-29 22:29:38,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 733 transitions, 8892 flow [2023-11-29 22:29:38,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 22:29:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 22:29:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1310 transitions. [2023-11-29 22:29:38,382 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7443181818181818 [2023-11-29 22:29:38,382 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1310 transitions. [2023-11-29 22:29:38,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1310 transitions. [2023-11-29 22:29:38,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:29:38,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1310 transitions. [2023-11-29 22:29:38,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.0909090909091) internal successors, (1310), 11 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:38,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 160.0) internal successors, (1920), 12 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:38,387 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 160.0) internal successors, (1920), 12 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:38,389 INFO L307 CegarLoopForPetriNet]: 144 programPoint places, 63 predicate places. [2023-11-29 22:29:38,389 INFO L500 AbstractCegarLoop]: Abstraction has has 207 places, 733 transitions, 8892 flow [2023-11-29 22:29:38,390 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:38,390 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:29:38,390 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:29:38,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 22:29:38,598 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:29:38,599 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:29:38,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:29:38,599 INFO L85 PathProgramCache]: Analyzing trace with hash -963035946, now seen corresponding path program 5 times [2023-11-29 22:29:38,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:29:38,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748930137] [2023-11-29 22:29:38,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:29:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:29:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:29:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:29:38,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:29:38,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748930137] [2023-11-29 22:29:38,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748930137] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:29:38,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904811689] [2023-11-29 22:29:38,742 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 22:29:38,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:29:38,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:29:38,746 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-11-29 22:29:38,774 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-11-29 22:29:38,834 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 22:29:38,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:29:38,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 22:29:38,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:29:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:29:38,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:29:38,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:29:38,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904811689] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:29:38,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:29:38,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2023-11-29 22:29:38,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003260705] [2023-11-29 22:29:38,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:29:38,943 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 22:29:38,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:29:38,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 22:29:38,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-11-29 22:29:38,946 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 160 [2023-11-29 22:29:38,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 733 transitions, 8892 flow. Second operand has 17 states, 17 states have (on average 108.11764705882354) internal successors, (1838), 17 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:38,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:29:38,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 160 [2023-11-29 22:29:38,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:29:41,073 INFO L124 PetriNetUnfolderBase]: 7586/13325 cut-off events. [2023-11-29 22:29:41,074 INFO L125 PetriNetUnfolderBase]: For 15884/19470 co-relation queries the response was YES. [2023-11-29 22:29:41,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75805 conditions, 13325 events. 7586/13325 cut-off events. For 15884/19470 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 101692 event pairs, 302 based on Foata normal form. 120/12072 useless extension candidates. Maximal degree in co-relation 69077. Up to 5770 conditions per place. [2023-11-29 22:29:41,182 INFO L140 encePairwiseOnDemand]: 138/160 looper letters, 982 selfloop transitions, 335 changer transitions 12/1416 dead transitions. [2023-11-29 22:29:41,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 1416 transitions, 19818 flow [2023-11-29 22:29:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 22:29:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-29 22:29:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3017 transitions. [2023-11-29 22:29:41,187 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7252403846153846 [2023-11-29 22:29:41,187 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3017 transitions. [2023-11-29 22:29:41,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3017 transitions. [2023-11-29 22:29:41,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:29:41,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3017 transitions. [2023-11-29 22:29:41,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 116.03846153846153) internal successors, (3017), 26 states have internal predecessors, (3017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:41,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 160.0) internal successors, (4320), 27 states have internal predecessors, (4320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:41,197 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 160.0) internal successors, (4320), 27 states have internal predecessors, (4320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:41,198 INFO L307 CegarLoopForPetriNet]: 144 programPoint places, 88 predicate places. [2023-11-29 22:29:41,198 INFO L500 AbstractCegarLoop]: Abstraction has has 232 places, 1416 transitions, 19818 flow [2023-11-29 22:29:41,198 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 108.11764705882354) internal successors, (1838), 17 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:41,198 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:29:41,198 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:29:41,204 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-11-29 22:29:41,404 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:29:41,405 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:29:41,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:29:41,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1834185562, now seen corresponding path program 6 times [2023-11-29 22:29:41,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:29:41,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650180077] [2023-11-29 22:29:41,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:29:41,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:29:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:29:41,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:29:41,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:29:41,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650180077] [2023-11-29 22:29:41,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650180077] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:29:41,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011998046] [2023-11-29 22:29:41,515 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 22:29:41,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:29:41,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:29:41,516 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-11-29 22:29:41,536 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-11-29 22:29:41,589 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-11-29 22:29:41,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:29:41,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 22:29:41,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:29:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 22:29:41,727 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 22:29:41,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011998046] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:29:41,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 22:29:41,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-11-29 22:29:41,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761181855] [2023-11-29 22:29:41,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:29:41,728 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 22:29:41,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:29:41,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 22:29:41,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-11-29 22:29:41,729 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 160 [2023-11-29 22:29:41,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 1416 transitions, 19818 flow. Second operand has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:41,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:29:41,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 160 [2023-11-29 22:29:41,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:29:43,572 INFO L124 PetriNetUnfolderBase]: 6359/10969 cut-off events. [2023-11-29 22:29:43,572 INFO L125 PetriNetUnfolderBase]: For 19956/23342 co-relation queries the response was YES. [2023-11-29 22:29:43,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69670 conditions, 10969 events. 6359/10969 cut-off events. For 19956/23342 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 78956 event pairs, 311 based on Foata normal form. 36/9994 useless extension candidates. Maximal degree in co-relation 63419. Up to 4885 conditions per place. [2023-11-29 22:29:43,658 INFO L140 encePairwiseOnDemand]: 151/160 looper letters, 725 selfloop transitions, 103 changer transitions 12/1078 dead transitions. [2023-11-29 22:29:43,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 1078 transitions, 16376 flow [2023-11-29 22:29:43,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 22:29:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 22:29:43,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 854 transitions. [2023-11-29 22:29:43,660 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6671875 [2023-11-29 22:29:43,660 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 854 transitions. [2023-11-29 22:29:43,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 854 transitions. [2023-11-29 22:29:43,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:29:43,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 854 transitions. [2023-11-29 22:29:43,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 106.75) internal successors, (854), 8 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:43,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 160.0) internal successors, (1440), 9 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:43,665 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 160.0) internal successors, (1440), 9 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:43,667 INFO L307 CegarLoopForPetriNet]: 144 programPoint places, 89 predicate places. [2023-11-29 22:29:43,667 INFO L500 AbstractCegarLoop]: Abstraction has has 233 places, 1078 transitions, 16376 flow [2023-11-29 22:29:43,667 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:43,667 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:29:43,667 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:29:43,672 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-11-29 22:29:43,871 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:29:43,872 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:29:43,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:29:43,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1949756477, now seen corresponding path program 1 times [2023-11-29 22:29:43,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:29:43,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452923531] [2023-11-29 22:29:43,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:29:43,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:29:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:29:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:29:45,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:29:45,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452923531] [2023-11-29 22:29:45,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452923531] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:29:45,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116032625] [2023-11-29 22:29:45,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:29:45,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:29:45,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:29:45,367 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-11-29 22:29:45,370 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-11-29 22:29:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:29:45,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-29 22:29:45,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:29:45,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 22:29:45,767 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 22:29:45,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 22:29:46,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-29 22:29:46,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:29:46,797 INFO L378 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 67 treesize of output 39 [2023-11-29 22:29:47,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:29:47,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:29:48,011 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~max3~0 1)) (.cse3 (= c_~max1~0 c_~max2~0)) (.cse2 (+ c_~max2~0 1))) (and (forall ((~M~0 Int) (v_ArrVal_272 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_272) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse0 .cse1) (= c_~max1~0 .cse0) (< .cse0 .cse2) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))) (or .cse3 (forall ((~M~0 Int) (v_ArrVal_272 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_272) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse4 .cse1) (< c_~max2~0 .cse4) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))))) (or (forall ((~M~0 Int) (v_ArrVal_272 (Array Int Int))) (or (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_272) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))) (and (or .cse3 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (< c_~max3~0 .cse2)))))) is different from false [2023-11-29 22:29:48,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:29:48,675 INFO L378 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 282 treesize of output 258 [2023-11-29 22:29:48,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 176 [2023-11-29 22:29:48,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 158 [2023-11-29 22:29:48,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 146 [2023-11-29 22:29:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:29:54,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116032625] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:29:54,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:29:54,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 26] total 69 [2023-11-29 22:29:54,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885729062] [2023-11-29 22:29:54,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:29:54,798 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-11-29 22:29:54,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:29:54,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-11-29 22:29:54,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=4062, Unknown=4, NotChecked=132, Total=4692 [2023-11-29 22:29:54,801 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 160 [2023-11-29 22:29:54,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 1078 transitions, 16376 flow. Second operand has 69 states, 69 states have (on average 49.42028985507246) internal successors, (3410), 69 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:29:54,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:29:54,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 160 [2023-11-29 22:29:54,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:30:07,339 INFO L124 PetriNetUnfolderBase]: 26737/41649 cut-off events. [2023-11-29 22:30:07,339 INFO L125 PetriNetUnfolderBase]: For 112833/113198 co-relation queries the response was YES. [2023-11-29 22:30:07,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275100 conditions, 41649 events. 26737/41649 cut-off events. For 112833/113198 co-relation queries the response was YES. Maximal size of possible extension queue 1841. Compared 333827 event pairs, 1200 based on Foata normal form. 45/38236 useless extension candidates. Maximal degree in co-relation 245826. Up to 19688 conditions per place. [2023-11-29 22:30:07,867 INFO L140 encePairwiseOnDemand]: 115/160 looper letters, 2845 selfloop transitions, 1298 changer transitions 42/4223 dead transitions. [2023-11-29 22:30:07,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 4223 transitions, 72692 flow [2023-11-29 22:30:07,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-11-29 22:30:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2023-11-29 22:30:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 3837 transitions. [2023-11-29 22:30:07,874 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.34755434782608696 [2023-11-29 22:30:07,874 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 3837 transitions. [2023-11-29 22:30:07,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 3837 transitions. [2023-11-29 22:30:07,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:30:07,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 3837 transitions. [2023-11-29 22:30:07,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 55.608695652173914) internal successors, (3837), 69 states have internal predecessors, (3837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:30:07,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 160.0) internal successors, (11200), 70 states have internal predecessors, (11200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:30:07,891 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 160.0) internal successors, (11200), 70 states have internal predecessors, (11200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:30:07,891 INFO L307 CegarLoopForPetriNet]: 144 programPoint places, 157 predicate places. [2023-11-29 22:30:07,891 INFO L500 AbstractCegarLoop]: Abstraction has has 301 places, 4223 transitions, 72692 flow [2023-11-29 22:30:07,892 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 49.42028985507246) internal successors, (3410), 69 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:30:07,893 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:30:07,893 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:30:07,903 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-11-29 22:30:08,097 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-29 22:30:08,100 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:30:08,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:30:08,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1474234531, now seen corresponding path program 2 times [2023-11-29 22:30:08,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:30:08,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454989804] [2023-11-29 22:30:08,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:30:08,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:30:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:30:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:30:09,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:30:09,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454989804] [2023-11-29 22:30:09,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454989804] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:30:09,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549793421] [2023-11-29 22:30:09,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 22:30:09,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:30:09,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:30:09,248 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-11-29 22:30:09,248 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-11-29 22:30:09,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 22:30:09,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:30:09,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-29 22:30:09,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:30:09,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 22:30:10,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 22:30:10,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 22:30:10,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 22:30:10,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:30:10,881 INFO L378 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 67 treesize of output 39 [2023-11-29 22:30:11,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:30:11,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:30:19,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:30:19,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 93 [2023-11-29 22:30:19,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:30:19,633 INFO L378 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 2421 treesize of output 2317 [2023-11-29 22:30:19,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:30:19,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 245 [2023-11-29 22:30:19,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:30:19,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 205 [2023-11-29 22:30:19,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:30:19,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 201 [2023-11-29 22:30:20,541 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 22:30:20,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 1 [2023-11-29 22:30:20,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:30:20,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2023-11-29 22:30:20,568 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 22:30:20,569 INFO L378 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 1083 treesize of output 1039 [2023-11-29 22:30:20,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 22:30:20,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 119 [2023-11-29 22:30:20,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 22:30:20,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 111 [2023-11-29 22:30:20,638 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 22:30:20,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 113 [2023-11-29 22:30:20,664 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 22:30:20,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-11-29 22:30:20,669 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 22:30:20,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 1 [2023-11-29 22:30:20,675 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 22:30:20,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 1 [2023-11-29 22:30:20,682 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 22:30:20,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-11-29 22:30:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:30:21,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549793421] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:30:21,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:30:21,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32, 26] total 74 [2023-11-29 22:30:21,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024119285] [2023-11-29 22:30:21,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:30:21,488 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-29 22:30:21,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:30:21,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-29 22:30:21,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=893, Invalid=4415, Unknown=94, NotChecked=0, Total=5402 [2023-11-29 22:30:21,491 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 160 [2023-11-29 22:30:21,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 4223 transitions, 72692 flow. Second operand has 74 states, 74 states have (on average 49.310810810810814) internal successors, (3649), 74 states have internal predecessors, (3649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:30:21,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:30:21,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 160 [2023-11-29 22:30:21,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:30:46,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:30:47,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:30:48,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:30:50,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:30:56,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:31:00,777 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~max2~0 1))) (let ((.cse16 (= c_~max1~0 c_~max2~0)) (.cse8 (< c_~max2~0 c_~max3~0)) (.cse9 (< c_~max3~0 .cse3)) (.cse4 (+ c_~max3~0 1)) (.cse6 (select |c_#memory_int| c_~A~0.base))) (let ((.cse5 (select .cse6 c_~A~0.offset)) (.cse11 (forall ((~M~0 Int)) (let ((.cse31 (select .cse6 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< c_~max2~0 .cse31) (< .cse31 .cse4) (< (+ ~M~0 1) c_~N~0))))) (.cse10 (forall ((~M~0 Int)) (or (< c_~max3~0 (select .cse6 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0)))) (.cse15 (< c_thread2Thread1of1ForFork0_~i~1 c_~M~0)) (.cse1 (and (or .cse16 .cse8) (or (= c_~max1~0 c_~max3~0) .cse9))) (.cse12 (+ c_~max1~0 1))) (and (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (or (< c_~max3~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< c_~max1~0 (select .cse0 c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0)))) .cse1) (or (let ((.cse7 (= .cse5 c_~max2~0))) (and (forall ((~M~0 Int)) (let ((.cse2 (select .cse6 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< .cse2 .cse3) (< .cse2 .cse4) (= .cse5 .cse2) (< (+ ~M~0 1) c_~N~0)))) (or (and (or .cse7 .cse8) (or (= .cse5 c_~max3~0) .cse9)) .cse10) (or .cse7 .cse11))) (< .cse5 .cse12)) (forall ((v_ArrVal_308 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse13 (select .cse14 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse13 .cse3) (< .cse13 .cse4) (< 0 ~M~0) (= .cse13 c_~max1~0) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select .cse14 c_~A~0.offset))))) (or .cse15 .cse1) (or (< c_~max1~0 .cse5) (and (or .cse16 .cse11) (or .cse1 .cse10) (forall ((~M~0 Int)) (let ((.cse17 (select .cse6 (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse17) (< 0 ~M~0) (< .cse17 .cse3) (< .cse17 .cse4) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_308 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse19 (select .cse20 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse18 (select .cse20 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse18 .cse3) (< .cse18 .cse4) (< 0 ~M~0) (= .cse18 .cse19) (< (+ ~M~0 1) c_~N~0)))) (< .cse19 .cse12))))) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse21 (select .cse22 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse21 .cse4) (< 0 ~M~0) (< c_~max2~0 .cse21) (< c_~max1~0 (select .cse22 c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0))))) .cse16) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse24 (select .cse23 c_~A~0.offset))) (or (< c_~max3~0 (select .cse23 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< .cse24 .cse12) (= .cse24 c_~max3~0) (< (+ ~M~0 1) c_~N~0))))) .cse9) (or .cse15 (< (+ c_thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (let ((.cse25 (select .cse6 (+ c_~A~0.offset (* c_thread3Thread1of1ForFork1_~i~2 4))))) (and (or (and (or (< .cse25 .cse3) (= c_~max1~0 .cse25)) (or .cse16 (< c_~max2~0 .cse25))) (< .cse25 .cse4)) (or (< c_~max3~0 .cse25) .cse1)))) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse27 (select .cse26 c_~A~0.offset))) (or (< c_~max3~0 (select .cse26 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse27 c_~max2~0) (< 0 ~M~0) (< .cse27 .cse12) (< (+ ~M~0 1) c_~N~0))))) .cse8) (forall ((v_ArrVal_308 (Array Int Int))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse28 (select .cse30 c_~A~0.offset))) (or (= .cse28 c_~max2~0) (< .cse28 .cse12) (forall ((~M~0 Int)) (let ((.cse29 (select .cse30 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse29 .cse4) (< 0 ~M~0) (< c_~max2~0 .cse29) (< (+ ~M~0 1) c_~N~0)))))))))))) is different from false [2023-11-29 22:31:11,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:31:17,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:31:26,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:31:54,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:31:57,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:31:58,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:32:01,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:32:03,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:32:18,585 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~max2~0 1))) (let ((.cse3 (= c_~max1~0 c_~max2~0)) (.cse10 (< c_~max2~0 c_~max3~0)) (.cse2 (= c_~max1~0 c_~max3~0)) (.cse11 (< c_~max3~0 .cse5)) (.cse6 (+ c_~max3~0 1)) (.cse8 (select |c_#memory_int| c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset)) (.cse13 (forall ((~M~0 Int)) (let ((.cse32 (select .cse8 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< c_~max2~0 .cse32) (< .cse32 .cse6) (< (+ ~M~0 1) c_~N~0))))) (.cse12 (forall ((~M~0 Int)) (or (< c_~max3~0 (select .cse8 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0)))) (.cse17 (< c_thread2Thread1of1ForFork0_~i~1 c_~M~0)) (.cse1 (and (or .cse3 .cse10) (or .cse2 .cse11))) (.cse14 (+ c_~max1~0 1))) (and (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (or (< c_~max3~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< c_~max1~0 (select .cse0 c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0)))) .cse1) (or (< c_thread3Thread1of1ForFork1_~i~2 c_~N~0) (and .cse2 (<= 1 c_~max3~0) (= c_~max2~0 0)) (and .cse2 .cse3)) (or (let ((.cse9 (= .cse7 c_~max2~0))) (and (forall ((~M~0 Int)) (let ((.cse4 (select .cse8 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< .cse4 .cse5) (< .cse4 .cse6) (= .cse7 .cse4) (< (+ ~M~0 1) c_~N~0)))) (or (and (or .cse9 .cse10) (or (= .cse7 c_~max3~0) .cse11)) .cse12) (or .cse9 .cse13))) (< .cse7 .cse14)) (forall ((v_ArrVal_308 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse15 (select .cse16 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse15 .cse5) (< .cse15 .cse6) (< 0 ~M~0) (= .cse15 c_~max1~0) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select .cse16 c_~A~0.offset))))) (or .cse17 .cse1) (or (< c_~max1~0 .cse7) (and (or .cse3 .cse13) (or .cse1 .cse12) (forall ((~M~0 Int)) (let ((.cse18 (select .cse8 (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse18) (< 0 ~M~0) (< .cse18 .cse5) (< .cse18 .cse6) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_308 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse20 (select .cse21 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse19 (select .cse21 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse19 .cse5) (< .cse19 .cse6) (< 0 ~M~0) (= .cse19 .cse20) (< (+ ~M~0 1) c_~N~0)))) (< .cse20 .cse14))))) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse22 (select .cse23 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse22 .cse6) (< 0 ~M~0) (< c_~max2~0 .cse22) (< c_~max1~0 (select .cse23 c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0))))) .cse3) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse25 (select .cse24 c_~A~0.offset))) (or (< c_~max3~0 (select .cse24 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< .cse25 .cse14) (= .cse25 c_~max3~0) (< (+ ~M~0 1) c_~N~0))))) .cse11) (or .cse17 (< (+ c_thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (let ((.cse26 (select .cse8 (+ c_~A~0.offset (* c_thread3Thread1of1ForFork1_~i~2 4))))) (and (or (and (or (< .cse26 .cse5) (= c_~max1~0 .cse26)) (or .cse3 (< c_~max2~0 .cse26))) (< .cse26 .cse6)) (or (< c_~max3~0 .cse26) .cse1)))) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse28 (select .cse27 c_~A~0.offset))) (or (< c_~max3~0 (select .cse27 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse28 c_~max2~0) (< 0 ~M~0) (< .cse28 .cse14) (< (+ ~M~0 1) c_~N~0))))) .cse10) (forall ((v_ArrVal_308 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse29 (select .cse31 c_~A~0.offset))) (or (= .cse29 c_~max2~0) (< .cse29 .cse14) (forall ((~M~0 Int)) (let ((.cse30 (select .cse31 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse30 .cse6) (< 0 ~M~0) (< c_~max2~0 .cse30) (< (+ ~M~0 1) c_~N~0)))))))))))) is different from false [2023-11-29 22:32:27,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:32:30,181 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~max2~0 1))) (let ((.cse3 (= c_~max1~0 c_~max2~0)) (.cse11 (< c_~max2~0 c_~max3~0)) (.cse2 (= c_~max1~0 c_~max3~0)) (.cse12 (< c_~max3~0 .cse6)) (.cse7 (+ c_~max3~0 1)) (.cse9 (select |c_#memory_int| c_~A~0.base))) (let ((.cse8 (select .cse9 c_~A~0.offset)) (.cse14 (forall ((~M~0 Int)) (let ((.cse45 (select .cse9 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< c_~max2~0 .cse45) (< .cse45 .cse7) (< (+ ~M~0 1) c_~N~0))))) (.cse1 (and (or .cse3 .cse11) (or .cse2 .cse12))) (.cse13 (forall ((~M~0 Int)) (or (< c_~max3~0 (select .cse9 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0)))) (.cse15 (+ c_~max1~0 1))) (and (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (or (< c_~max3~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< c_~max1~0 (select .cse0 c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0)))) .cse1) (or (< c_thread3Thread1of1ForFork1_~i~2 c_~N~0) (and .cse2 (<= 1 c_~max3~0) (= c_~max2~0 0)) (and .cse2 .cse3)) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int) (v_ArrVal_307 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (or (< 0 ~M~0) (< c_~max1~0 (select .cse4 c_~A~0.offset)) (< c_~max3~0 (select .cse4 (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))) .cse1) (or (let ((.cse10 (= .cse8 c_~max2~0))) (and (forall ((~M~0 Int)) (let ((.cse5 (select .cse9 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< .cse5 .cse6) (< .cse5 .cse7) (= .cse8 .cse5) (< (+ ~M~0 1) c_~N~0)))) (or (and (or .cse10 .cse11) (or (= .cse8 c_~max3~0) .cse12)) .cse13) (or .cse10 .cse14))) (< .cse8 .cse15)) (forall ((v_ArrVal_308 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse16 (select .cse17 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse16 .cse6) (< .cse16 .cse7) (< 0 ~M~0) (= .cse16 c_~max1~0) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select .cse17 c_~A~0.offset))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse20 (select .cse19 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse18 (select .cse19 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< .cse18 .cse7) (< c_~max2~0 .cse18) (< (+ ~M~0 1) c_~N~0)))) (= .cse20 c_~max2~0) (< .cse20 .cse15))))) (or (< c_~max1~0 .cse8) (and (or .cse3 .cse14) (or .cse1 .cse13) (forall ((~M~0 Int)) (let ((.cse21 (select .cse9 (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse21) (< 0 ~M~0) (< .cse21 .cse6) (< .cse21 .cse7) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse23 (select .cse24 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse22 (select .cse24 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= .cse22 .cse23) (< .cse22 .cse7) (< .cse22 .cse6) (< (+ ~M~0 1) c_~N~0)))) (< .cse23 .cse15))))) (or (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (~M~0 Int)) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse25 (select .cse26 c_~A~0.offset))) (or (< 0 ~M~0) (= .cse25 c_~max2~0) (< c_~max3~0 (select .cse26 (+ c_~A~0.offset (* ~M~0 4)))) (< .cse25 .cse15) (< (+ ~M~0 1) c_~N~0))))) .cse11) (forall ((v_ArrVal_308 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse28 (select .cse29 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse27 (select .cse29 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse27 .cse6) (< .cse27 .cse7) (< 0 ~M~0) (= .cse27 .cse28) (< (+ ~M~0 1) c_~N~0)))) (< .cse28 .cse15))))) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse30 (select .cse31 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse30 .cse7) (< 0 ~M~0) (< c_~max2~0 .cse30) (< c_~max1~0 (select .cse31 c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0))))) .cse3) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse32 (select .cse33 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= .cse32 c_~max1~0) (< .cse32 .cse7) (< .cse32 .cse6) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select .cse33 c_~A~0.offset))))) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse35 (select .cse34 c_~A~0.offset))) (or (< c_~max3~0 (select .cse34 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< .cse35 .cse15) (= .cse35 c_~max3~0) (< (+ ~M~0 1) c_~N~0))))) .cse12) (or (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (~M~0 Int)) (let ((.cse37 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse36 (select .cse37 c_~A~0.offset))) (or (< 0 ~M~0) (= .cse36 c_~max3~0) (< c_~max3~0 (select .cse37 (+ c_~A~0.offset (* ~M~0 4)))) (< .cse36 .cse15) (< (+ ~M~0 1) c_~N~0))))) .cse12) (or .cse3 (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int) (v_ArrVal_307 (Array Int Int))) (let ((.cse39 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse38 (select .cse39 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< .cse38 .cse7) (< c_~max1~0 (select .cse39 c_~A~0.offset)) (< c_~max2~0 .cse38) (< (+ ~M~0 1) c_~N~0)))))) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse41 (select .cse40 c_~A~0.offset))) (or (< c_~max3~0 (select .cse40 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse41 c_~max2~0) (< 0 ~M~0) (< .cse41 .cse15) (< (+ ~M~0 1) c_~N~0))))) .cse11) (forall ((v_ArrVal_308 (Array Int Int))) (let ((.cse44 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse42 (select .cse44 c_~A~0.offset))) (or (= .cse42 c_~max2~0) (< .cse42 .cse15) (forall ((~M~0 Int)) (let ((.cse43 (select .cse44 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse43 .cse7) (< 0 ~M~0) (< c_~max2~0 .cse43) (< (+ ~M~0 1) c_~N~0)))))))))))) is different from false [2023-11-29 22:32:36,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:32:40,193 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~max2~0 1))) (let ((.cse3 (= c_~max1~0 c_~max2~0)) (.cse11 (< c_~max2~0 c_~max3~0)) (.cse2 (= c_~max1~0 c_~max3~0)) (.cse12 (< c_~max3~0 .cse6)) (.cse7 (+ c_~max3~0 1)) (.cse9 (select |c_#memory_int| c_~A~0.base))) (let ((.cse8 (select .cse9 c_~A~0.offset)) (.cse14 (forall ((~M~0 Int)) (let ((.cse45 (select .cse9 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< c_~max2~0 .cse45) (< .cse45 .cse7) (< (+ ~M~0 1) c_~N~0))))) (.cse1 (and (or .cse3 .cse11) (or .cse2 .cse12))) (.cse13 (forall ((~M~0 Int)) (or (< c_~max3~0 (select .cse9 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0)))) (.cse15 (+ c_~max1~0 1))) (and (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (or (< c_~max3~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< c_~max1~0 (select .cse0 c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0)))) .cse1) (or (< c_thread3Thread1of1ForFork1_~i~2 c_~N~0) (and .cse2 (<= 1 c_~max3~0) (= c_~max2~0 0)) (and .cse2 .cse3)) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int) (v_ArrVal_307 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (or (< 0 ~M~0) (< c_~max1~0 (select .cse4 c_~A~0.offset)) (< c_~max3~0 (select .cse4 (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))) .cse1) (or (let ((.cse10 (= .cse8 c_~max2~0))) (and (forall ((~M~0 Int)) (let ((.cse5 (select .cse9 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< .cse5 .cse6) (< .cse5 .cse7) (= .cse8 .cse5) (< (+ ~M~0 1) c_~N~0)))) (or (and (or .cse10 .cse11) (or (= .cse8 c_~max3~0) .cse12)) .cse13) (or .cse10 .cse14))) (< .cse8 .cse15)) (forall ((v_ArrVal_308 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse16 (select .cse17 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse16 .cse6) (< .cse16 .cse7) (< 0 ~M~0) (= .cse16 c_~max1~0) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select .cse17 c_~A~0.offset))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse20 (select .cse19 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse18 (select .cse19 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< .cse18 .cse7) (< c_~max2~0 .cse18) (< (+ ~M~0 1) c_~N~0)))) (= .cse20 c_~max2~0) (< .cse20 .cse15))))) (or (< c_thread2Thread1of1ForFork0_~i~1 c_~M~0) .cse1) (or (< c_~max1~0 .cse8) (and (or .cse3 .cse14) (or .cse1 .cse13) (forall ((~M~0 Int)) (let ((.cse21 (select .cse9 (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse21) (< 0 ~M~0) (< .cse21 .cse6) (< .cse21 .cse7) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse23 (select .cse24 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse22 (select .cse24 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= .cse22 .cse23) (< .cse22 .cse7) (< .cse22 .cse6) (< (+ ~M~0 1) c_~N~0)))) (< .cse23 .cse15))))) (or (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (~M~0 Int)) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse25 (select .cse26 c_~A~0.offset))) (or (< 0 ~M~0) (= .cse25 c_~max2~0) (< c_~max3~0 (select .cse26 (+ c_~A~0.offset (* ~M~0 4)))) (< .cse25 .cse15) (< (+ ~M~0 1) c_~N~0))))) .cse11) (forall ((v_ArrVal_308 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse28 (select .cse29 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse27 (select .cse29 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse27 .cse6) (< .cse27 .cse7) (< 0 ~M~0) (= .cse27 .cse28) (< (+ ~M~0 1) c_~N~0)))) (< .cse28 .cse15))))) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse30 (select .cse31 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse30 .cse7) (< 0 ~M~0) (< c_~max2~0 .cse30) (< c_~max1~0 (select .cse31 c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0))))) .cse3) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse32 (select .cse33 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= .cse32 c_~max1~0) (< .cse32 .cse7) (< .cse32 .cse6) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select .cse33 c_~A~0.offset))))) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse35 (select .cse34 c_~A~0.offset))) (or (< c_~max3~0 (select .cse34 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< .cse35 .cse15) (= .cse35 c_~max3~0) (< (+ ~M~0 1) c_~N~0))))) .cse12) (or (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (~M~0 Int)) (let ((.cse37 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse36 (select .cse37 c_~A~0.offset))) (or (< 0 ~M~0) (= .cse36 c_~max3~0) (< c_~max3~0 (select .cse37 (+ c_~A~0.offset (* ~M~0 4)))) (< .cse36 .cse15) (< (+ ~M~0 1) c_~N~0))))) .cse12) (or .cse3 (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int) (v_ArrVal_307 (Array Int Int))) (let ((.cse39 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse38 (select .cse39 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< .cse38 .cse7) (< c_~max1~0 (select .cse39 c_~A~0.offset)) (< c_~max2~0 .cse38) (< (+ ~M~0 1) c_~N~0)))))) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse41 (select .cse40 c_~A~0.offset))) (or (< c_~max3~0 (select .cse40 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse41 c_~max2~0) (< 0 ~M~0) (< .cse41 .cse15) (< (+ ~M~0 1) c_~N~0))))) .cse11) (forall ((v_ArrVal_308 (Array Int Int))) (let ((.cse44 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse42 (select .cse44 c_~A~0.offset))) (or (= .cse42 c_~max2~0) (< .cse42 .cse15) (forall ((~M~0 Int)) (let ((.cse43 (select .cse44 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse43 .cse7) (< 0 ~M~0) (< c_~max2~0 .cse43) (< (+ ~M~0 1) c_~N~0)))))))))))) is different from false [2023-11-29 22:33:20,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:34:22,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:34:57,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:35:00,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:35:09,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:35:19,725 INFO L124 PetriNetUnfolderBase]: 51232/80159 cut-off events. [2023-11-29 22:35:19,725 INFO L125 PetriNetUnfolderBase]: For 268802/270298 co-relation queries the response was YES. [2023-11-29 22:35:19,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616265 conditions, 80159 events. 51232/80159 cut-off events. For 268802/270298 co-relation queries the response was YES. Maximal size of possible extension queue 3679. Compared 698931 event pairs, 1758 based on Foata normal form. 251/73743 useless extension candidates. Maximal degree in co-relation 456197. Up to 37475 conditions per place. [2023-11-29 22:35:20,634 INFO L140 encePairwiseOnDemand]: 100/160 looper letters, 7548 selfloop transitions, 5554 changer transitions 140/13282 dead transitions. [2023-11-29 22:35:20,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 13282 transitions, 251270 flow [2023-11-29 22:35:20,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2023-11-29 22:35:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2023-11-29 22:35:20,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 12633 transitions. [2023-11-29 22:35:20,653 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.34936393805309734 [2023-11-29 22:35:20,653 INFO L72 ComplementDD]: Start complementDD. Operand 226 states and 12633 transitions. [2023-11-29 22:35:20,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226 states and 12633 transitions. [2023-11-29 22:35:20,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:35:20,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 226 states and 12633 transitions. [2023-11-29 22:35:20,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 227 states, 226 states have (on average 55.89823008849557) internal successors, (12633), 226 states have internal predecessors, (12633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:35:20,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 227 states, 227 states have (on average 160.0) internal successors, (36320), 227 states have internal predecessors, (36320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:35:20,715 INFO L81 ComplementDD]: Finished complementDD. Result has 227 states, 227 states have (on average 160.0) internal successors, (36320), 227 states have internal predecessors, (36320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:35:20,715 INFO L307 CegarLoopForPetriNet]: 144 programPoint places, 382 predicate places. [2023-11-29 22:35:20,716 INFO L500 AbstractCegarLoop]: Abstraction has has 526 places, 13282 transitions, 251270 flow [2023-11-29 22:35:20,716 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 49.310810810810814) internal successors, (3649), 74 states have internal predecessors, (3649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:35:20,716 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:35:20,717 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:35:20,722 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-11-29 22:35:20,921 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 22:35:20,922 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:35:20,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:35:20,922 INFO L85 PathProgramCache]: Analyzing trace with hash -338950991, now seen corresponding path program 3 times [2023-11-29 22:35:20,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:35:20,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448912603] [2023-11-29 22:35:20,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:35:20,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:35:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:35:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:35:22,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:35:22,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448912603] [2023-11-29 22:35:22,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448912603] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:35:22,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990334886] [2023-11-29 22:35:22,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 22:35:22,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:35:22,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:35:22,804 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 22:35:22,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 22:35:22,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 22:35:22,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:35:22,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 22:35:22,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:35:24,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 22:35:24,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-29 22:35:24,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:35:24,273 INFO L378 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 61 treesize of output 39 [2023-11-29 22:35:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:35:25,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:35:25,987 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0)) (.cse2 (+ c_~max3~0 1)) (.cse3 (+ c_~max2~0 1))) (and (or .cse0 (forall ((~M~0 Int) (v_ArrVal_341 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max2~0 .cse1) (< .cse1 .cse2) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))))) (or (forall ((~M~0 Int) (v_ArrVal_341 (Array Int Int))) (or (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))) (and (or .cse0 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (< c_~max3~0 .cse3)))) (forall ((~M~0 Int) (v_ArrVal_341 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse4 .cse2) (= c_~max1~0 .cse4) (< .cse4 .cse3) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))))) is different from false [2023-11-29 22:35:26,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:35:26,618 INFO L378 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 282 treesize of output 258 [2023-11-29 22:35:26,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 164 [2023-11-29 22:35:26,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 158 [2023-11-29 22:35:26,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 146 [2023-11-29 22:35:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:35:33,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990334886] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:35:33,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:35:33,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 24, 23] total 68 [2023-11-29 22:35:33,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553695550] [2023-11-29 22:35:33,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:35:33,427 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-29 22:35:33,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:35:33,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-29 22:35:33,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=607, Invalid=3816, Unknown=3, NotChecked=130, Total=4556 [2023-11-29 22:35:33,430 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 160 [2023-11-29 22:35:33,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 13282 transitions, 251270 flow. Second operand has 68 states, 68 states have (on average 49.529411764705884) internal successors, (3368), 68 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:35:33,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:35:33,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 160 [2023-11-29 22:35:33,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:38:17,355 INFO L124 PetriNetUnfolderBase]: 63020/98512 cut-off events. [2023-11-29 22:38:17,355 INFO L125 PetriNetUnfolderBase]: For 347159/349828 co-relation queries the response was YES. [2023-11-29 22:38:17,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845753 conditions, 98512 events. 63020/98512 cut-off events. For 347159/349828 co-relation queries the response was YES. Maximal size of possible extension queue 4677. Compared 880685 event pairs, 1521 based on Foata normal form. 563/90668 useless extension candidates. Maximal degree in co-relation 592963. Up to 48685 conditions per place. [2023-11-29 22:38:18,523 INFO L140 encePairwiseOnDemand]: 106/160 looper letters, 9229 selfloop transitions, 8807 changer transitions 291/18367 dead transitions. [2023-11-29 22:38:18,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 18367 transitions, 373035 flow [2023-11-29 22:38:18,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2023-11-29 22:38:18,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2023-11-29 22:38:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 12694 transitions. [2023-11-29 22:38:18,534 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3419719827586207 [2023-11-29 22:38:18,534 INFO L72 ComplementDD]: Start complementDD. Operand 232 states and 12694 transitions. [2023-11-29 22:38:18,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 232 states and 12694 transitions. [2023-11-29 22:38:18,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:38:18,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 232 states and 12694 transitions. [2023-11-29 22:38:18,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 233 states, 232 states have (on average 54.71551724137931) internal successors, (12694), 232 states have internal predecessors, (12694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:38:18,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 233 states, 233 states have (on average 160.0) internal successors, (37280), 233 states have internal predecessors, (37280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:38:18,574 INFO L81 ComplementDD]: Finished complementDD. Result has 233 states, 233 states have (on average 160.0) internal successors, (37280), 233 states have internal predecessors, (37280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:38:18,575 INFO L307 CegarLoopForPetriNet]: 144 programPoint places, 613 predicate places. [2023-11-29 22:38:18,575 INFO L500 AbstractCegarLoop]: Abstraction has has 757 places, 18367 transitions, 373035 flow [2023-11-29 22:38:18,575 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 49.529411764705884) internal successors, (3368), 68 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:38:18,575 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:38:18,576 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:38:18,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-29 22:38:18,780 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 22:38:18,781 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:38:18,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:38:18,781 INFO L85 PathProgramCache]: Analyzing trace with hash 248592135, now seen corresponding path program 4 times [2023-11-29 22:38:18,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:38:18,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944673090] [2023-11-29 22:38:18,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:38:18,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:38:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:38:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:38:20,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:38:20,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944673090] [2023-11-29 22:38:20,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944673090] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:38:20,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531249782] [2023-11-29 22:38:20,533 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 22:38:20,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:38:20,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:38:20,534 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 22:38:20,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 22:38:20,629 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 22:38:20,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:38:20,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-29 22:38:20,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:38:21,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 22:38:22,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 22:38:22,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 22:38:22,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-29 22:38:22,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 22:38:22,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-29 22:38:23,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2023-11-29 22:38:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:38:23,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:38:27,004 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse4 (+ c_~max2~0 1))) (let ((.cse10 (< c_~max3~0 .cse4)) (.cse8 (= c_~max1~0 c_~max2~0)) (.cse9 (< c_~max2~0 c_~max3~0)) (.cse1 (+ c_~max1~0 1)) (.cse3 (+ c_~max3~0 1)) (.cse6 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse0 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (or (< .cse0 .cse1) (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse2 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse6))) (or (< .cse2 .cse3) (< .cse2 .cse4) (= .cse0 .cse2)))))))) (or (forall ((v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (or (< c_~max1~0 (select (select .cse7 c_~A~0.base) c_~A~0.offset)) (< c_~max3~0 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse6))))) (and (or .cse8 .cse9) (or (= c_~max1~0 c_~max3~0) .cse10))) (or .cse10 (forall ((v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse11 (select (select .cse12 c_~A~0.base) c_~A~0.offset))) (or (< .cse11 .cse1) (< c_~max3~0 (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse6)) (= .cse11 c_~max3~0)))))) (or (forall ((v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse14 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse6))) (or (< c_~max1~0 (select (select .cse13 c_~A~0.base) c_~A~0.offset)) (< .cse14 .cse3) (< c_~max2~0 .cse14))))) .cse8) (or (forall ((v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse15 (select (select .cse16 c_~A~0.base) c_~A~0.offset))) (or (< .cse15 .cse1) (= .cse15 c_~max2~0) (< c_~max3~0 (select (select (store (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse6)))))) .cse9) (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse17 (select (select .cse19 c_~A~0.base) c_~A~0.offset))) (or (< .cse17 .cse1) (= .cse17 c_~max2~0) (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse18 (select (select (store (store .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse6))) (or (< .cse18 .cse3) (< c_~max2~0 .cse18)))))))) (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (or (< c_~max1~0 (select (select .cse20 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse21 (select (select (store (store .cse20 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse6))) (or (= c_~max1~0 .cse21) (< .cse21 .cse3) (< .cse21 .cse4)))))))))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< c_~N~0 (+ c_~M~0 1))) is different from false [2023-11-29 22:38:34,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:38:34,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 96 [2023-11-29 22:38:34,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:38:34,055 INFO L378 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 11129 treesize of output 10109 [2023-11-29 22:38:34,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 164 [2023-11-29 22:38:34,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:38:34,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 227 [2023-11-29 22:38:34,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 139 [2023-11-29 22:38:34,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:38:34,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 65 [2023-11-29 22:38:34,450 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 22:38:34,451 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 22:38:34,464 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 22:38:34,464 INFO L378 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 84 treesize of output 68 [2023-11-29 22:38:34,474 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 22:38:34,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2023-11-29 22:38:34,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:38:34,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2023-11-29 22:38:34,506 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 22:38:34,506 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 22:38:34,514 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 22:38:34,515 INFO L378 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 51 treesize of output 43 [2023-11-29 22:38:34,525 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 22:38:34,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2023-11-29 22:38:34,549 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 22:38:34,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 1 [2023-11-29 22:38:34,558 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 22:38:34,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 1 [2023-11-29 22:38:34,566 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 22:38:34,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 1 [2023-11-29 22:38:34,575 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 22:38:34,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 1 [2023-11-29 22:38:36,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:38:36,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531249782] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:38:36,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:38:36,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 31] total 81 [2023-11-29 22:38:36,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683480041] [2023-11-29 22:38:36,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:38:36,052 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2023-11-29 22:38:36,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:38:36,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2023-11-29 22:38:36,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=5628, Unknown=32, NotChecked=156, Total=6480 [2023-11-29 22:38:36,056 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 160 [2023-11-29 22:38:36,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 757 places, 18367 transitions, 373035 flow. Second operand has 81 states, 81 states have (on average 52.888888888888886) internal successors, (4284), 81 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:38:36,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:38:36,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 160 [2023-11-29 22:38:36,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:38:36,426 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~max2~0 1))) (let ((.cse30 (= c_~max1~0 c_~max2~0)) (.cse38 (< c_~max2~0 c_~max3~0)) (.cse16 (< c_~max3~0 .cse10))) (let ((.cse22 (< c_~N~0 1)) (.cse20 (and (or .cse30 .cse38) (or (= c_~max1~0 c_~max3~0) .cse16)))) (let ((.cse23 (<= c_~N~0 1)) (.cse24 (or .cse22 .cse20)) (.cse9 (+ c_~max3~0 1)) (.cse15 (+ c_~max1~0 1))) (let ((.cse0 (or (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse79 (select (select .cse78 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max3~0 (select (select (store (store .cse78 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< .cse79 .cse15) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (= .cse79 c_~max3~0))))) .cse16)) (.cse1 (or .cse20 (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse77 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (or (< c_~max1~0 (select (select .cse77 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (select (select (store (store .cse77 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1))))))) (.cse2 (forall ((~M~0 Int)) (or (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse76 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (or (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse75 (select (select (store (store .cse76 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= c_~max1~0 .cse75) (< .cse75 .cse10) (< .cse75 .cse9)))) (< c_~max1~0 (select (select .cse76 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (.cse33 (and (or .cse22 (and (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse23 .cse24)) (.cse3 (forall ((~M~0 Int)) (or (< ~M~0 0) (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse72 (select (select .cse74 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse72 .cse15) (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse73 (select (select (store (store .cse74 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse73 .cse72) (< .cse73 .cse10) (< .cse73 .cse9)))))))) (< c_~N~0 (+ ~M~0 1))))) (.cse25 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse4 (or .cse30 (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse70 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse71 (select (select (store (store .cse70 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< c_~max1~0 (select (select .cse70 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< ~M~0 0) (< c_~max2~0 .cse71) (< c_~N~0 (+ ~M~0 1)) (< .cse71 .cse9))))))) (.cse5 (or (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse68 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse69 (select (select .cse68 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max3~0 (select (select (store (store .cse68 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< .cse69 .cse15) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (= c_~max2~0 .cse69))))) .cse38)) (.cse44 (and .cse23 (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse22) .cse24)) (.cse6 (forall ((~M~0 Int)) (or (< ~M~0 0) (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse65 (select (select .cse67 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse65 .cse15) (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse66 (select (select (store (store .cse67 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< c_~max2~0 .cse66) (< .cse66 .cse9)))) (= c_~max2~0 .cse65))))) (< c_~N~0 (+ ~M~0 1)))))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (or (< c_~max1~0 (select (select .cse7 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse8 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< .cse8 .cse9) (< .cse8 .cse10) (= c_~max1~0 .cse8))))))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (or (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse11 (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse11 .cse9) (< .cse11 .cse10) (= .cse11 c_~max1~0)))) (< c_~max1~0 (select (select .cse12 c_~A~0.base) c_~A~0.offset))))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)))) (or (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse13 c_~max3~0) (< c_~max3~0 (select (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< ~M~0 0) (< .cse13 .cse15) (< c_~N~0 (+ ~M~0 1)))))) .cse16) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (or (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse17 (select (select (store (store .cse18 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= c_~max1~0 .cse17) (< .cse17 .cse9) (< .cse17 .cse10)))) (< c_~max1~0 (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)))) (or (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (or (< c_~max3~0 (select (select (store (store .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max1~0 (select (select .cse19 c_~A~0.base) c_~A~0.offset)) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1))))) .cse20) .cse0 (or (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (or (< c_~max1~0 (select (select .cse21 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (< c_~max3~0 (select (select (store (store .cse21 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1))))) .cse20) (or (and (or .cse22 (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base|)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base|)))) .cse23 .cse24) .cse25) (or (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (or (< c_~max3~0 (select (select (store (store .cse26 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (< c_~max1~0 (select (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) .cse20) .cse1 .cse2 (forall ((~M~0 Int)) (or (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse27 (select (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse27 c_~max2~0) (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse28 (select (select (store (store .cse29 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse28 .cse9) (< c_~max2~0 .cse28)))) (< .cse27 .cse15))))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)))) (or .cse30 (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse32 (select (select (store (store .cse31 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< c_~max1~0 (select (select .cse31 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (< ~M~0 0) (< .cse32 .cse9) (< c_~N~0 (+ ~M~0 1)) (< c_~max2~0 .cse32)))))) (or .cse33 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or .cse16 (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse35 (select (select .cse34 c_~A~0.base) c_~A~0.offset))) (or (< c_~max3~0 (select (select (store (store .cse34 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< .cse35 .cse15) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (= .cse35 c_~max3~0)))))) (or .cse33 .cse25) .cse3 (or (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< c_~max3~0 (select (select (store (store .cse36 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (= c_~max2~0 .cse37) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (< .cse37 .cse15))))) .cse38) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse40 (select (select .cse41 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse39 (select (select (store (store .cse41 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse39 .cse9) (< .cse39 .cse10) (= .cse39 .cse40)))) (< .cse40 .cse15))))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)))) (= c_~max1~0 0) (= c_~max2~0 0) (or (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max3~0 (select (select (store (store .cse42 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (= .cse43 c_~max2~0) (< ~M~0 0) (< .cse43 .cse15) (< c_~N~0 (+ ~M~0 1)))))) .cse38) (or .cse44 .cse25) .cse4 (forall ((~M~0 Int)) (or (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse45 (select (select .cse47 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (= c_~max2~0 .cse45) (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse46 (select (select (store (store .cse47 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< .cse46 .cse9) (< c_~max2~0 .cse46)))) (< .cse45 .cse15))))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)))) (or (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse48 (select (select .cse49 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (= c_~max3~0 .cse48) (< c_~max3~0 (select (select (store (store .cse49 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (< .cse48 .cse15))))) .cse16) (or .cse30 (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse50 (select (select (store (store .cse51 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max2~0 .cse50) (< .cse50 .cse9) (< c_~max1~0 (select (select .cse51 c_~A~0.base) c_~A~0.offset)) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1))))))) (forall ((~M~0 Int)) (or (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse53 (select (select .cse54 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse52 (select (select (store (store .cse54 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse52 .cse9) (< .cse52 .cse10) (= .cse53 .cse52)))) (< .cse53 .cse15))))))) (= c_~max3~0 0) .cse5 (forall ((~M~0 Int)) (or (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse56 (select (select .cse57 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse55 (select (select (store (store .cse57 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (= .cse55 .cse56) (< .cse55 .cse9) (< .cse55 .cse10)))) (< .cse56 .cse15))))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)))) (or (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse59 (select (select .cse58 c_~A~0.base) c_~A~0.offset))) (or (< c_~max3~0 (select (select (store (store .cse58 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< .cse59 .cse15) (< ~M~0 0) (= .cse59 c_~max2~0) (< c_~N~0 (+ ~M~0 1)))))) .cse38) (or .cse44 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse6 (forall ((~M~0 Int)) (or (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse60 (select (select .cse62 c_~A~0.base) c_~A~0.offset))) (or (< .cse60 .cse15) (= .cse60 c_~max2~0) (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse61 (select (select (store (store .cse62 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max2~0 .cse61) (< .cse61 .cse9)))))))))) (or .cse30 (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse63 (select (select (store (store .cse64 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse63 .cse9) (< ~M~0 0) (< c_~max2~0 .cse63) (< c_~N~0 (+ ~M~0 1)) (< c_~max1~0 (select (select .cse64 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))))))))) is different from false [2023-11-29 22:38:49,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:39:00,157 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse50 (select |c_#memory_int| c_~A~0.base))) (let ((.cse56 (select .cse50 0)) (.cse2 (+ c_~max2~0 1))) (let ((.cse30 (+ c_~M~0 1)) (.cse6 (= c_~max1~0 c_~max2~0)) (.cse23 (< c_~max2~0 c_~max3~0)) (.cse4 (= c_~max1~0 c_~max3~0)) (.cse16 (< c_~max3~0 .cse2)) (.cse57 (= .cse56 c_~max1~0)) (.cse55 (= c_~max1~0 0))) (let ((.cse7 (or (< 0 .cse56) .cse55)) (.cse34 (or (< .cse56 1) .cse57)) (.cse5 (= c_~max2~0 0)) (.cse33 (= c_thread3Thread1of1ForFork1_~i~2 0)) (.cse39 (+ 2 c_~A~0.base)) (.cse35 (= c_~max3~0 0)) (.cse9 (and (or .cse6 .cse23) (or .cse4 .cse16))) (.cse14 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse29 (< c_~N~0 .cse30)) (.cse11 (+ c_~max1~0 1)) (.cse1 (+ c_~max3~0 1))) (and (forall ((~M~0 Int)) (or (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (or (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse0 .cse1) (< .cse0 .cse2) (= .cse0 c_~max1~0)))) (< c_~max1~0 (select (select .cse3 c_~A~0.base) c_~A~0.offset))))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)))) (or (< c_thread3Thread1of1ForFork1_~i~2 c_~N~0) (and .cse4 (<= 1 c_~max3~0) .cse5) (and .cse4 .cse6)) .cse7 (or (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (or (< c_~max3~0 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max1~0 (select (select .cse8 c_~A~0.base) c_~A~0.offset)) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1))))) .cse9) (or (and (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse10 (select (select .cse13 c_~A~0.base) c_~A~0.offset))) (or (< .cse10 .cse11) (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse12 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse14))) (or (< .cse12 .cse1) (< .cse12 .cse2) (= .cse10 .cse12)))))))) (or (forall ((v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (or (< c_~max1~0 (select (select .cse15 c_~A~0.base) c_~A~0.offset)) (< c_~max3~0 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse14))))) .cse9) (or .cse16 (forall ((v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse17 (select (select .cse18 c_~A~0.base) c_~A~0.offset))) (or (< .cse17 .cse11) (< c_~max3~0 (select (select (store (store .cse18 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse14)) (= .cse17 c_~max3~0)))))) (or (forall ((v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse20 (select (select (store (store .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse14))) (or (< c_~max1~0 (select (select .cse19 c_~A~0.base) c_~A~0.offset)) (< .cse20 .cse1) (< c_~max2~0 .cse20))))) .cse6) (or (forall ((v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse21 (select (select .cse22 c_~A~0.base) c_~A~0.offset))) (or (< .cse21 .cse11) (= .cse21 c_~max2~0) (< c_~max3~0 (select (select (store (store .cse22 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse14)))))) .cse23) (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse24 (select (select .cse26 c_~A~0.base) c_~A~0.offset))) (or (< .cse24 .cse11) (= .cse24 c_~max2~0) (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse25 (select (select (store (store .cse26 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse14))) (or (< .cse25 .cse1) (< c_~max2~0 .cse25)))))))) (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (or (< c_~max1~0 (select (select .cse27 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse28 (select (select (store (store .cse27 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse14))) (or (= c_~max1~0 .cse28) (< .cse28 .cse1) (< .cse28 .cse2)))))))) .cse29) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= .cse30 c_~N~0) (or .cse16 (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse32 (select (select .cse31 c_~A~0.base) c_~A~0.offset))) (or (< c_~max3~0 (select (select (store (store .cse31 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< .cse32 .cse11) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (= .cse32 c_~max3~0)))))) (or (not .cse33) (and .cse7 .cse34 .cse5 .cse35)) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse37 (select (select .cse38 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse36 (select (select (store (store .cse38 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse36 .cse1) (< .cse36 .cse2) (= .cse36 .cse37)))) (< .cse37 .cse11))))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)))) .cse34 (<= c_~N~0 1) .cse5 (<= 0 c_~M~0) (= c_thread1Thread1of1ForFork2_~i~0 0) (or .cse33 (and (<= 1 c_~N~0) (<= c_thread3Thread1of1ForFork1_~i~2 0))) (<= .cse39 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse39 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)) (or .cse6 (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse40 (select (select (store (store .cse41 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max2~0 .cse40) (< .cse40 .cse1) (< c_~max1~0 (select (select .cse41 c_~A~0.base) c_~A~0.offset)) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1))))))) (= c_~N~0 1) .cse35 (or (forall ((~M~0 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse43 (select (select .cse42 c_~A~0.base) c_~A~0.offset))) (or (< c_~max3~0 (select (select (store (store .cse42 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< .cse43 .cse11) (< ~M~0 0) (= .cse43 c_~max2~0) (< c_~N~0 (+ ~M~0 1)))))) .cse23) (or (let ((.cse46 (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse51 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse14))) (or (< c_~max2~0 .cse51) (< .cse51 .cse1))))) (.cse45 (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse14)))) (.cse44 (select .cse50 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (and (or (< c_~max1~0 .cse44) (and (or .cse45 .cse9) (or .cse6 .cse46) (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse14))) (or (= c_~max1~0 .cse47) (< .cse47 .cse1) (< .cse47 .cse2)))))) (or (let ((.cse48 (= .cse44 c_~max2~0))) (and (or .cse46 .cse48) (or (and (or .cse16 (= .cse44 c_~max3~0)) (or .cse23 .cse48)) .cse45) (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) .cse14))) (or (= .cse44 .cse49) (< .cse49 .cse1) (< .cse49 .cse2)))))) (< .cse44 .cse11)))) .cse29) (forall ((~M~0 Int)) (or (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse52 (select (select .cse54 c_~A~0.base) c_~A~0.offset))) (or (< .cse52 .cse11) (= .cse52 c_~max2~0) (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse53 (select (select (store (store .cse54 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_377) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max2~0 .cse53) (< .cse53 .cse1)))))))))) (or (and .cse55 (<= .cse56 0)) (and (<= 1 .cse56) .cse57))))))) is different from false [2023-11-29 22:39:35,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:39:49,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:39:51,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:40:02,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:40:18,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:41:07,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:41:09,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-11-29 22:43:18,535 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-11-29 22:43:18,535 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 22:43:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-11-29 22:43:18,874 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-29 22:43:18,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-29 22:43:19,076 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 22:43:19,076 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (81states, 50/160 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 940101 conditions, 99217 events (64616/99216 cut-off events. For 412729/415468 co-relation queries the response was YES. Maximal size of possible extension queue 5913. Compared 919217 event pairs, 915 based on Foata normal form. 251/93503 useless extension candidates. Maximal degree in co-relation 756225. Up to 52039 conditions per place.). [2023-11-29 22:43:19,078 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-29 22:43:19,078 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-29 22:43:19,078 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-29 22:43:19,078 INFO L457 BasicCegarLoop]: Path program histogram: [6, 4, 1, 1] [2023-11-29 22:43:19,080 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 22:43:19,080 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 22:43:19,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 10:43:19 BasicIcfg [2023-11-29 22:43:19,083 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 22:43:19,083 INFO L158 Benchmark]: Toolchain (without parser) took 829559.70ms. Allocated memory was 450.9MB in the beginning and 4.9GB in the end (delta: 4.5GB). Free memory was 409.3MB in the beginning and 2.4GB in the end (delta: -2.0GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. [2023-11-29 22:43:19,083 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 327.2MB. Free memory is still 279.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 22:43:19,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.31ms. Allocated memory is still 450.9MB. Free memory was 409.0MB in the beginning and 397.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-29 22:43:19,083 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.02ms. Allocated memory is still 450.9MB. Free memory was 397.1MB in the beginning and 395.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 22:43:19,083 INFO L158 Benchmark]: Boogie Preprocessor took 22.89ms. Allocated memory is still 450.9MB. Free memory was 395.3MB in the beginning and 393.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 22:43:19,083 INFO L158 Benchmark]: RCFGBuilder took 460.94ms. Allocated memory is still 450.9MB. Free memory was 393.7MB in the beginning and 371.3MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-11-29 22:43:19,084 INFO L158 Benchmark]: TraceAbstraction took 828872.43ms. Allocated memory was 450.9MB in the beginning and 4.9GB in the end (delta: 4.5GB). Free memory was 370.7MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. [2023-11-29 22:43:19,084 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.10ms. Allocated memory is still 327.2MB. Free memory is still 279.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 170.31ms. Allocated memory is still 450.9MB. Free memory was 409.0MB in the beginning and 397.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 29.02ms. Allocated memory is still 450.9MB. Free memory was 397.1MB in the beginning and 395.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 22.89ms. Allocated memory is still 450.9MB. Free memory was 395.3MB in the beginning and 393.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 460.94ms. Allocated memory is still 450.9MB. Free memory was 393.7MB in the beginning and 371.3MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 828872.43ms. Allocated memory was 450.9MB in the beginning and 4.9GB in the end (delta: 4.5GB). Free memory was 370.7MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (81states, 50/160 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 940101 conditions, 99217 events (64616/99216 cut-off events. For 412729/415468 co-relation queries the response was YES. Maximal size of possible extension queue 5913. Compared 919217 event pairs, 915 based on Foata normal form. 251/93503 useless extension candidates. Maximal degree in co-relation 756225. Up to 52039 conditions per place.). - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (81states, 50/160 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 940101 conditions, 99217 events (64616/99216 cut-off events. For 412729/415468 co-relation queries the response was YES. Maximal size of possible extension queue 5913. Compared 919217 event pairs, 915 based on Foata normal form. 251/93503 useless extension candidates. Maximal degree in co-relation 756225. Up to 52039 conditions per place.). - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (81states, 50/160 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 940101 conditions, 99217 events (64616/99216 cut-off events. For 412729/415468 co-relation queries the response was YES. Maximal size of possible extension queue 5913. Compared 919217 event pairs, 915 based on Foata normal form. 251/93503 useless extension candidates. Maximal degree in co-relation 756225. Up to 52039 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (81states, 50/160 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 940101 conditions, 99217 events (64616/99216 cut-off events. For 412729/415468 co-relation queries the response was YES. Maximal size of possible extension queue 5913. Compared 919217 event pairs, 915 based on Foata normal form. 251/93503 useless extension candidates. Maximal degree in co-relation 756225. Up to 52039 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 185 locations, 4 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: 828.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 768.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 1423 mSolverCounterUnknown, 8460 SdHoareTripleChecker+Valid, 153.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8460 mSDsluCounter, 17020 SdHoareTripleChecker+Invalid, 148.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7071 IncrementalHoareTripleChecker+Unchecked, 16144 mSDsCounter, 510 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34335 IncrementalHoareTripleChecker+Invalid, 43339 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 510 mSolverCounterUnsat, 876 mSDtfsCounter, 34335 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 1423 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3441 GetRequests, 2414 SyntacticMatches, 29 SemanticMatches, 998 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 74424 ImplicationChecksByTransitivity, 237.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=373035occurred in iteration=11, InterpolantAutomatonStates: 630, 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.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 56.3s InterpolantComputationTime, 2869 NumberOfCodeBlocks, 2846 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4091 ConstructedInterpolants, 156 QuantifiedInterpolants, 82527 SizeOfPredicates, 181 NumberOfNonLiveVariables, 3289 ConjunctsInSsa, 247 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 23/73 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