/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 09:18:05,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 09:18:05,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 09:18:05,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 09:18:05,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 09:18:06,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 09:18:06,012 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 09:18:06,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 09:18:06,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 09:18:06,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 09:18:06,013 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 09:18:06,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 09:18:06,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 09:18:06,014 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 09:18:06,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 09:18:06,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 09:18:06,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 09:18:06,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 09:18:06,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 09:18:06,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 09:18:06,016 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 09:18:06,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 09:18:06,017 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 09:18:06,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 09:18:06,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 09:18:06,018 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 09:18:06,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 09:18:06,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 09:18:06,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 09:18:06,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 09:18:06,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 09:18:06,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 09:18:06,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 09:18:06,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 09:18:06,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 09:18:06,020 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 09:18:06,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 09:18:06,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 09:18:06,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 09:18:06,348 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 09:18:06,349 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 09:18:06,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2023-08-24 09:18:07,587 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 09:18:07,786 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 09:18:07,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2023-08-24 09:18:07,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d5bc2b3/243e02ad72e5472a8cefc80f49aeb7f6/FLAG1a7effd6e [2023-08-24 09:18:07,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d5bc2b3/243e02ad72e5472a8cefc80f49aeb7f6 [2023-08-24 09:18:07,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 09:18:07,817 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 09:18:07,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 09:18:07,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 09:18:07,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 09:18:07,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 09:18:07" (1/1) ... [2023-08-24 09:18:07,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4242569f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:18:07, skipping insertion in model container [2023-08-24 09:18:07,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 09:18:07" (1/1) ... [2023-08-24 09:18:07,853 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 09:18:08,040 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-dec-subseq.wvr.c[2924,2937] [2023-08-24 09:18:08,051 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 09:18:08,064 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 09:18:08,099 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-dec-subseq.wvr.c[2924,2937] [2023-08-24 09:18:08,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 09:18:08,115 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 09:18:08,117 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 09:18:08,124 INFO L206 MainTranslator]: Completed translation [2023-08-24 09:18:08,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:18:08 WrapperNode [2023-08-24 09:18:08,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 09:18:08,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 09:18:08,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 09:18:08,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 09:18:08,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:18:08" (1/1) ... [2023-08-24 09:18:08,150 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:18:08" (1/1) ... [2023-08-24 09:18:08,187 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 198 [2023-08-24 09:18:08,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 09:18:08,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 09:18:08,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 09:18:08,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 09:18:08,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:18:08" (1/1) ... [2023-08-24 09:18:08,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:18:08" (1/1) ... [2023-08-24 09:18:08,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:18:08" (1/1) ... [2023-08-24 09:18:08,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:18:08" (1/1) ... [2023-08-24 09:18:08,217 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:18:08" (1/1) ... [2023-08-24 09:18:08,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:18:08" (1/1) ... [2023-08-24 09:18:08,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:18:08" (1/1) ... [2023-08-24 09:18:08,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:18:08" (1/1) ... [2023-08-24 09:18:08,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 09:18:08,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 09:18:08,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 09:18:08,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 09:18:08,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:18:08" (1/1) ... [2023-08-24 09:18:08,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 09:18:08,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:18:08,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 09:18:08,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 09:18:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 09:18:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 09:18:08,332 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 09:18:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 09:18:08,332 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 09:18:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 09:18:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 09:18:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 09:18:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 09:18:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 09:18:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 09:18:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 09:18:08,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 09:18:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 09:18:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 09:18:08,336 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 09:18:08,422 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 09:18:08,423 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 09:18:08,788 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 09:18:08,861 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 09:18:08,861 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-24 09:18:08,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 09:18:08 BoogieIcfgContainer [2023-08-24 09:18:08,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 09:18:08,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 09:18:08,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 09:18:08,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 09:18:08,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 09:18:07" (1/3) ... [2023-08-24 09:18:08,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e639c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 09:18:08, skipping insertion in model container [2023-08-24 09:18:08,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:18:08" (2/3) ... [2023-08-24 09:18:08,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e639c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 09:18:08, skipping insertion in model container [2023-08-24 09:18:08,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 09:18:08" (3/3) ... [2023-08-24 09:18:08,869 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2023-08-24 09:18:08,889 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 09:18:08,890 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 09:18:08,890 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 09:18:08,957 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-24 09:18:08,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 180 transitions, 376 flow [2023-08-24 09:18:09,055 INFO L124 PetriNetUnfolderBase]: 15/178 cut-off events. [2023-08-24 09:18:09,056 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 09:18:09,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 178 events. 15/178 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2023-08-24 09:18:09,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 180 transitions, 376 flow [2023-08-24 09:18:09,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 170 transitions, 352 flow [2023-08-24 09:18:09,073 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 09:18:09,085 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 170 transitions, 352 flow [2023-08-24 09:18:09,088 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 170 transitions, 352 flow [2023-08-24 09:18:09,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 170 transitions, 352 flow [2023-08-24 09:18:09,136 INFO L124 PetriNetUnfolderBase]: 15/170 cut-off events. [2023-08-24 09:18:09,136 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 09:18:09,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 15/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2023-08-24 09:18:09,141 INFO L119 LiptonReduction]: Number of co-enabled transitions 690 [2023-08-24 09:18:14,478 INFO L134 LiptonReduction]: Checked pairs total: 1213 [2023-08-24 09:18:14,479 INFO L136 LiptonReduction]: Total number of compositions: 176 [2023-08-24 09:18:14,490 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 09:18:14,494 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d58071f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 09:18:14,494 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-24 09:18:14,502 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 09:18:14,502 INFO L124 PetriNetUnfolderBase]: 5/22 cut-off events. [2023-08-24 09:18:14,502 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 09:18:14,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:18:14,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:18:14,503 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 09:18:14,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:18:14,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2006983299, now seen corresponding path program 1 times [2023-08-24 09:18:14,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:18:14,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765902526] [2023-08-24 09:18:14,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:18:14,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:18:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:18:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:18:14,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:18:14,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765902526] [2023-08-24 09:18:14,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765902526] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 09:18:14,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 09:18:14,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 09:18:14,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426380387] [2023-08-24 09:18:14,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:18:14,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 09:18:14,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:18:15,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 09:18:15,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 09:18:15,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 356 [2023-08-24 09:18:15,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:18:15,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 356 [2023-08-24 09:18:15,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:18:15,139 INFO L124 PetriNetUnfolderBase]: 157/260 cut-off events. [2023-08-24 09:18:15,140 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-24 09:18:15,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 260 events. 157/260 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 820 event pairs, 39 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 490. Up to 169 conditions per place. [2023-08-24 09:18:15,144 INFO L140 encePairwiseOnDemand]: 351/356 looper letters, 31 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2023-08-24 09:18:15,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 35 transitions, 155 flow [2023-08-24 09:18:15,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 09:18:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 09:18:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 640 transitions. [2023-08-24 09:18:15,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.449438202247191 [2023-08-24 09:18:15,165 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 640 transitions. [2023-08-24 09:18:15,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 640 transitions. [2023-08-24 09:18:15,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:18:15,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 640 transitions. [2023-08-24 09:18:15,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,182 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,184 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 58 flow. Second operand 4 states and 640 transitions. [2023-08-24 09:18:15,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 35 transitions, 155 flow [2023-08-24 09:18:15,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 09:18:15,188 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 71 flow [2023-08-24 09:18:15,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=25, PETRI_TRANSITIONS=25} [2023-08-24 09:18:15,193 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2023-08-24 09:18:15,193 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 71 flow [2023-08-24 09:18:15,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:18:15,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:18:15,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 09:18:15,195 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 09:18:15,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:18:15,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1822843996, now seen corresponding path program 1 times [2023-08-24 09:18:15,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:18:15,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360641060] [2023-08-24 09:18:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:18:15,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:18:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:18:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:18:15,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:18:15,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360641060] [2023-08-24 09:18:15,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360641060] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 09:18:15,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 09:18:15,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 09:18:15,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845228172] [2023-08-24 09:18:15,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:18:15,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 09:18:15,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:18:15,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 09:18:15,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 09:18:15,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 356 [2023-08-24 09:18:15,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:18:15,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 356 [2023-08-24 09:18:15,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:18:15,485 INFO L124 PetriNetUnfolderBase]: 157/261 cut-off events. [2023-08-24 09:18:15,485 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-24 09:18:15,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 261 events. 157/261 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 827 event pairs, 39 based on Foata normal form. 1/241 useless extension candidates. Maximal degree in co-relation 179. Up to 169 conditions per place. [2023-08-24 09:18:15,491 INFO L140 encePairwiseOnDemand]: 350/356 looper letters, 31 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2023-08-24 09:18:15,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 36 transitions, 166 flow [2023-08-24 09:18:15,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 09:18:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 09:18:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 545 transitions. [2023-08-24 09:18:15,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3827247191011236 [2023-08-24 09:18:15,495 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 545 transitions. [2023-08-24 09:18:15,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 545 transitions. [2023-08-24 09:18:15,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:18:15,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 545 transitions. [2023-08-24 09:18:15,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,500 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,500 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 71 flow. Second operand 4 states and 545 transitions. [2023-08-24 09:18:15,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 36 transitions, 166 flow [2023-08-24 09:18:15,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 09:18:15,502 INFO L231 Difference]: Finished difference. Result has 27 places, 26 transitions, 84 flow [2023-08-24 09:18:15,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=27, PETRI_TRANSITIONS=26} [2023-08-24 09:18:15,503 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2023-08-24 09:18:15,503 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 26 transitions, 84 flow [2023-08-24 09:18:15,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:18:15,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:18:15,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 09:18:15,507 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 09:18:15,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:18:15,508 INFO L85 PathProgramCache]: Analyzing trace with hash 895958579, now seen corresponding path program 1 times [2023-08-24 09:18:15,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:18:15,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632278417] [2023-08-24 09:18:15,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:18:15,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:18:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:18:15,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:18:15,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:18:15,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632278417] [2023-08-24 09:18:15,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632278417] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 09:18:15,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 09:18:15,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 09:18:15,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630502393] [2023-08-24 09:18:15,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:18:15,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 09:18:15,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:18:15,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 09:18:15,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 09:18:15,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 356 [2023-08-24 09:18:15,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 153.25) internal successors, (613), 4 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:18:15,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 356 [2023-08-24 09:18:15,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:18:15,735 INFO L124 PetriNetUnfolderBase]: 217/357 cut-off events. [2023-08-24 09:18:15,735 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-08-24 09:18:15,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 357 events. 217/357 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1284 event pairs, 33 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 810. Up to 124 conditions per place. [2023-08-24 09:18:15,738 INFO L140 encePairwiseOnDemand]: 350/356 looper letters, 36 selfloop transitions, 13 changer transitions 0/49 dead transitions. [2023-08-24 09:18:15,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 49 transitions, 244 flow [2023-08-24 09:18:15,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 09:18:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 09:18:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 791 transitions. [2023-08-24 09:18:15,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4443820224719101 [2023-08-24 09:18:15,741 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 791 transitions. [2023-08-24 09:18:15,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 791 transitions. [2023-08-24 09:18:15,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:18:15,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 791 transitions. [2023-08-24 09:18:15,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 158.2) internal successors, (791), 5 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,747 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,747 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 84 flow. Second operand 5 states and 791 transitions. [2023-08-24 09:18:15,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 49 transitions, 244 flow [2023-08-24 09:18:15,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 49 transitions, 230 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 09:18:15,749 INFO L231 Difference]: Finished difference. Result has 32 places, 34 transitions, 154 flow [2023-08-24 09:18:15,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=32, PETRI_TRANSITIONS=34} [2023-08-24 09:18:15,750 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2023-08-24 09:18:15,750 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 34 transitions, 154 flow [2023-08-24 09:18:15,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.25) internal successors, (613), 4 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:18:15,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:18:15,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 09:18:15,752 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 09:18:15,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:18:15,752 INFO L85 PathProgramCache]: Analyzing trace with hash -62373143, now seen corresponding path program 2 times [2023-08-24 09:18:15,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:18:15,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155027762] [2023-08-24 09:18:15,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:18:15,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:18:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:18:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:18:15,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:18:15,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155027762] [2023-08-24 09:18:15,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155027762] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 09:18:15,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 09:18:15,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 09:18:15,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107030897] [2023-08-24 09:18:15,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:18:15,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 09:18:15,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:18:15,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 09:18:15,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 09:18:15,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 356 [2023-08-24 09:18:15,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 34 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:18:15,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 356 [2023-08-24 09:18:15,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:18:15,957 INFO L124 PetriNetUnfolderBase]: 283/475 cut-off events. [2023-08-24 09:18:15,957 INFO L125 PetriNetUnfolderBase]: For 513/520 co-relation queries the response was YES. [2023-08-24 09:18:15,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1406 conditions, 475 events. 283/475 cut-off events. For 513/520 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1819 event pairs, 81 based on Foata normal form. 3/466 useless extension candidates. Maximal degree in co-relation 1382. Up to 244 conditions per place. [2023-08-24 09:18:15,961 INFO L140 encePairwiseOnDemand]: 353/356 looper letters, 44 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-08-24 09:18:15,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 53 transitions, 347 flow [2023-08-24 09:18:15,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 09:18:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 09:18:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2023-08-24 09:18:15,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756554307116105 [2023-08-24 09:18:15,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2023-08-24 09:18:15,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2023-08-24 09:18:15,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:18:15,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2023-08-24 09:18:15,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,969 INFO L175 Difference]: Start difference. First operand has 32 places, 34 transitions, 154 flow. Second operand 3 states and 508 transitions. [2023-08-24 09:18:15,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 53 transitions, 347 flow [2023-08-24 09:18:15,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 53 transitions, 347 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 09:18:15,975 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 166 flow [2023-08-24 09:18:15,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=35, PETRI_TRANSITIONS=35} [2023-08-24 09:18:15,977 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2023-08-24 09:18:15,977 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 35 transitions, 166 flow [2023-08-24 09:18:15,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:15,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:18:15,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:18:15,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 09:18:15,978 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 09:18:15,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:18:15,979 INFO L85 PathProgramCache]: Analyzing trace with hash 659062640, now seen corresponding path program 1 times [2023-08-24 09:18:15,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:18:15,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865421225] [2023-08-24 09:18:15,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:18:15,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:18:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:18:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:18:16,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:18:16,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865421225] [2023-08-24 09:18:16,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865421225] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 09:18:16,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 09:18:16,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 09:18:16,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535171490] [2023-08-24 09:18:16,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:18:16,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 09:18:16,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:18:16,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 09:18:16,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 09:18:16,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 356 [2023-08-24 09:18:16,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 35 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:16,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:18:16,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 356 [2023-08-24 09:18:16,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:18:16,310 INFO L124 PetriNetUnfolderBase]: 307/530 cut-off events. [2023-08-24 09:18:16,310 INFO L125 PetriNetUnfolderBase]: For 459/459 co-relation queries the response was YES. [2023-08-24 09:18:16,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 530 events. 307/530 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2069 event pairs, 70 based on Foata normal form. 26/556 useless extension candidates. Maximal degree in co-relation 1652. Up to 403 conditions per place. [2023-08-24 09:18:16,314 INFO L140 encePairwiseOnDemand]: 351/356 looper letters, 43 selfloop transitions, 2 changer transitions 15/60 dead transitions. [2023-08-24 09:18:16,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 382 flow [2023-08-24 09:18:16,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 09:18:16,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 09:18:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 773 transitions. [2023-08-24 09:18:16,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43426966292134833 [2023-08-24 09:18:16,316 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 773 transitions. [2023-08-24 09:18:16,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 773 transitions. [2023-08-24 09:18:16,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:18:16,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 773 transitions. [2023-08-24 09:18:16,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.6) internal successors, (773), 5 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:16,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:16,322 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:16,322 INFO L175 Difference]: Start difference. First operand has 35 places, 35 transitions, 166 flow. Second operand 5 states and 773 transitions. [2023-08-24 09:18:16,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 382 flow [2023-08-24 09:18:16,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 60 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 09:18:16,325 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 184 flow [2023-08-24 09:18:16,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2023-08-24 09:18:16,326 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 16 predicate places. [2023-08-24 09:18:16,326 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 184 flow [2023-08-24 09:18:16,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:16,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:18:16,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:18:16,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 09:18:16,327 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 09:18:16,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:18:16,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1648851834, now seen corresponding path program 1 times [2023-08-24 09:18:16,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:18:16,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237127939] [2023-08-24 09:18:16,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:18:16,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:18:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:18:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:18:16,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:18:16,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237127939] [2023-08-24 09:18:16,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237127939] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 09:18:16,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 09:18:16,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 09:18:16,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191704483] [2023-08-24 09:18:16,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:18:16,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 09:18:16,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:18:16,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 09:18:16,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 09:18:16,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 356 [2023-08-24 09:18:16,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:16,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:18:16,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 356 [2023-08-24 09:18:16,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:18:16,501 INFO L124 PetriNetUnfolderBase]: 281/502 cut-off events. [2023-08-24 09:18:16,501 INFO L125 PetriNetUnfolderBase]: For 967/983 co-relation queries the response was YES. [2023-08-24 09:18:16,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1780 conditions, 502 events. 281/502 cut-off events. For 967/983 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1960 event pairs, 159 based on Foata normal form. 25/517 useless extension candidates. Maximal degree in co-relation 1478. Up to 397 conditions per place. [2023-08-24 09:18:16,505 INFO L140 encePairwiseOnDemand]: 351/356 looper letters, 30 selfloop transitions, 2 changer transitions 15/52 dead transitions. [2023-08-24 09:18:16,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 353 flow [2023-08-24 09:18:16,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 09:18:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 09:18:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2023-08-24 09:18:16,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39775280898876403 [2023-08-24 09:18:16,507 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2023-08-24 09:18:16,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2023-08-24 09:18:16,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:18:16,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2023-08-24 09:18:16,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.6) internal successors, (708), 5 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:16,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:16,512 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:16,512 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 184 flow. Second operand 5 states and 708 transitions. [2023-08-24 09:18:16,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 353 flow [2023-08-24 09:18:16,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 345 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-24 09:18:16,515 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 192 flow [2023-08-24 09:18:16,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-08-24 09:18:16,516 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 18 predicate places. [2023-08-24 09:18:16,516 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 192 flow [2023-08-24 09:18:16,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:16,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:18:16,517 INFO L208 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] [2023-08-24 09:18:16,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 09:18:16,517 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 09:18:16,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:18:16,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2084622646, now seen corresponding path program 1 times [2023-08-24 09:18:16,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:18:16,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441304656] [2023-08-24 09:18:16,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:18:16,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:18:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:18:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:18:17,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:18:17,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441304656] [2023-08-24 09:18:17,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441304656] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:18:17,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352979310] [2023-08-24 09:18:17,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:18:17,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:18:17,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:18:17,529 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:18:17,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 09:18:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:18:17,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 64 conjunts are in the unsatisfiable core [2023-08-24 09:18:17,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:18:17,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:18:17,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:18:17,776 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-24 09:18:17,777 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2023-08-24 09:18:17,850 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-24 09:18:17,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:18:17,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:18:17,939 INFO L322 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-08-24 09:18:17,940 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2023-08-24 09:18:17,986 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 09:18:18,024 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 09:18:18,132 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-24 09:18:18,403 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 10 [2023-08-24 09:18:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:18:18,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:18:21,336 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:18:21,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2023-08-24 09:18:21,346 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1670 treesize of output 1606 [2023-08-24 09:18:21,386 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:18:21,387 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 798 treesize of output 623 [2023-08-24 09:18:21,412 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:18:21,413 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 606 treesize of output 551 [2023-08-24 09:18:21,467 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:18:21,469 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 534 treesize of output 455 [2023-08-24 09:18:21,906 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:18:21,906 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 87 [2023-08-24 09:18:21,924 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:18:21,931 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2532 treesize of output 2444 [2023-08-24 09:18:21,999 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:18:22,000 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1208 treesize of output 1080 [2023-08-24 09:18:22,044 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:18:22,045 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1040 treesize of output 840 [2023-08-24 09:18:22,090 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:18:22,091 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 800 treesize of output 708 [2023-08-24 09:18:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:18:24,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352979310] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:18:24,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:18:24,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 27 [2023-08-24 09:18:24,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832263358] [2023-08-24 09:18:24,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:18:24,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 09:18:24,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:18:24,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 09:18:24,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=659, Unknown=6, NotChecked=0, Total=812 [2023-08-24 09:18:24,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 356 [2023-08-24 09:18:24,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 192 flow. Second operand has 29 states, 29 states have (on average 84.27586206896552) internal successors, (2444), 29 states have internal predecessors, (2444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:24,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:18:24,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 356 [2023-08-24 09:18:24,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:18:27,022 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-08-24 09:18:30,460 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-08-24 09:18:32,782 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-08-24 09:18:34,927 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse8 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse0 (<= c_~n~0 c_~end~0)) (.cse1 (< c_~end~0 0)) (.cse4 (not (= (mod c_~ok~0 256) 0)))) (and (or .cse0 .cse1 (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse2 c_~queue~0.base) .cse3))))) .cse4) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146))) (let ((.cse5 (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse7 (select .cse5 c_~queue~0.base)) (.cse6 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) (select .cse7 .cse3))) (< (select .cse7 .cse8) (+ (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) 1))))))))) (or .cse0 .cse1 (and (or .cse4 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (not (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse10 c_~queue~0.base) .cse3) (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146))) (let ((.cse12 (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse11 (select .cse12 c_~queue~0.base)) (.cse13 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse11 .cse3) (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse13))) (< (select .cse11 .cse8) (+ (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse13) 1))))))))) (or .cse0 .cse1 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse15 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_88| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_88|) 0))))) (and (or .cse15 (= c_~start~0 c_~end~0)) (or .cse15 .cse4) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))))) is different from false [2023-08-24 09:18:35,303 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse8 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse0 (<= c_~n~0 c_~end~0)) (.cse1 (< c_~end~0 0)) (.cse4 (not (= (mod c_~ok~0 256) 0)))) (and (or .cse0 .cse1 (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse2 c_~queue~0.base) .cse3))))) .cse4) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146))) (let ((.cse5 (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse7 (select .cse5 c_~queue~0.base)) (.cse6 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) (select .cse7 .cse3))) (< (select .cse7 .cse8) (+ (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) 1))))))))) (or .cse0 .cse1 (let ((.cse10 (select |c_#memory_int| c_~A~0.base))) (and (or .cse4 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_147 (Array Int Int))) (let ((.cse11 (+ (* ~i~0 4) ~A~0.offset))) (or (< c_~last~0 (select .cse10 .cse11)) (not (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse12 c_~A~0.base) .cse11) (select (select .cse12 c_~queue~0.base) .cse3)))))))) (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse15 (+ (* ~i~0 4) ~A~0.offset))) (or (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse13 (select .cse14 c_~queue~0.base))) (or (< (select .cse13 .cse8) (+ c_~v_old~0 1)) (not (= (select (select .cse14 c_~A~0.base) .cse15) (select .cse13 .cse3))))))) (< c_~last~0 (select .cse10 .cse15)))))))) (or .cse0 .cse1 (and (or .cse4 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (not (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse16 c_~queue~0.base) .cse3) (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146))) (let ((.cse18 (store .cse20 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse17 (select .cse18 c_~queue~0.base)) (.cse19 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse17 .cse3) (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse19))) (< (select .cse17 .cse8) (+ (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse19) 1))))))))) (or .cse0 .cse1 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse21 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_88| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_88|) 0))))) (and (or .cse21 (= c_~start~0 c_~end~0)) (or .cse21 .cse4) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))))) is different from false [2023-08-24 09:18:35,590 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse8 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse14 (+ c_~v_old~0 1)) (.cse0 (<= c_~n~0 c_~end~0)) (.cse1 (< c_~end~0 0)) (.cse4 (not (= (mod c_~ok~0 256) 0)))) (and (or .cse0 .cse1 (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse2 c_~queue~0.base) .cse3))))) .cse4) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146))) (let ((.cse5 (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse7 (select .cse5 c_~queue~0.base)) (.cse6 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) (select .cse7 .cse3))) (< (select .cse7 .cse8) (+ (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) 1))))))))) (or .cse0 .cse1 (let ((.cse10 (select |c_#memory_int| c_~A~0.base))) (and (or .cse4 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_147 (Array Int Int))) (let ((.cse11 (+ (* ~i~0 4) ~A~0.offset))) (or (< c_~last~0 (select .cse10 .cse11)) (not (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse12 c_~A~0.base) .cse11) (select (select .cse12 c_~queue~0.base) .cse3)))))))) (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse16 (+ (* ~i~0 4) ~A~0.offset))) (or (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse13 (select .cse15 c_~queue~0.base))) (or (< (select .cse13 .cse8) .cse14) (not (= (select (select .cse15 c_~A~0.base) .cse16) (select .cse13 .cse3))))))) (< c_~last~0 (select .cse10 .cse16)))))))) (or .cse0 .cse1 (and (or .cse4 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (not (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse17 c_~queue~0.base) .cse3) (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146))) (let ((.cse19 (store .cse21 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse18 (select .cse19 c_~queue~0.base)) (.cse20 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse18 .cse3) (select (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse20))) (< (select .cse18 .cse8) (+ (select (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse20) 1))))))))) (or (let ((.cse23 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or .cse4 (forall ((v_ArrVal_147 (Array Int Int))) (not (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse22 c_~queue~0.base) .cse3) (select (select .cse22 c_~A~0.base) .cse23)))))) (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse24 (select .cse25 c_~queue~0.base))) (or (not (= (select .cse24 .cse3) (select (select .cse25 c_~A~0.base) .cse23))) (< (select .cse24 .cse8) .cse14))))))) .cse0 .cse1 (< c_~last~0 |c_thread1Thread1of1ForFork1_#t~mem1#1|)) (or .cse0 .cse1 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse26 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_88| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_88|) 0))))) (and (or .cse26 (= c_~start~0 c_~end~0)) (or .cse26 .cse4) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))))) is different from false [2023-08-24 09:18:35,800 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse23 (select |c_#memory_int| c_~queue~0.base)) (.cse8 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse14 (+ c_~v_old~0 1)) (.cse4 (not (= (mod c_~ok~0 256) 0)))) (let ((.cse10 (select |c_#memory_int| c_~A~0.base)) (.cse17 (and (< (select .cse23 .cse8) .cse14) .cse4)) (.cse3 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse24 (+ c_~A~0.offset (* c_~i~0 4))) (.cse25 (< c_~last~0 |c_thread1Thread1of1ForFork1_#t~mem1#1|)) (.cse0 (<= c_~n~0 c_~end~0)) (.cse1 (< c_~end~0 0))) (and (or .cse0 .cse1 (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse2 c_~queue~0.base) .cse3))))) .cse4) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146))) (let ((.cse5 (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse7 (select .cse5 c_~queue~0.base)) (.cse6 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) (select .cse7 .cse3))) (< (select .cse7 .cse8) (+ (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) 1))))))))) (or .cse0 .cse1 (and (or .cse4 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_147 (Array Int Int))) (let ((.cse11 (+ (* ~i~0 4) ~A~0.offset))) (or (< c_~last~0 (select .cse10 .cse11)) (not (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse12 c_~A~0.base) .cse11) (select (select .cse12 c_~queue~0.base) .cse3)))))))) (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse16 (+ (* ~i~0 4) ~A~0.offset))) (or (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse13 (select .cse15 c_~queue~0.base))) (or (< (select .cse13 .cse8) .cse14) (not (= (select (select .cse15 c_~A~0.base) .cse16) (select .cse13 .cse3))))))) (< c_~last~0 (select .cse10 .cse16))))))) (or .cse17 (= (mod |c_thread2Thread1of1ForFork0_~cond~0#1| 256) 0)) (or .cse0 .cse1 (and (or .cse4 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (not (let ((.cse18 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse18 c_~queue~0.base) .cse3) (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146))) (let ((.cse20 (store .cse22 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse19 (select .cse20 c_~queue~0.base)) (.cse21 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse19 .cse3) (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse21))) (< (select .cse19 .cse8) (+ (select (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse21) 1))))))))) (or .cse0 (not (= (select .cse23 .cse3) (select .cse10 .cse24))) .cse17 .cse1 .cse25) (or (and (or .cse4 (forall ((v_ArrVal_147 (Array Int Int))) (not (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse26 c_~queue~0.base) .cse3) (select (select .cse26 c_~A~0.base) .cse24)))))) (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse27 (select .cse28 c_~queue~0.base))) (or (not (= (select .cse27 .cse3) (select (select .cse28 c_~A~0.base) .cse24))) (< (select .cse27 .cse8) .cse14)))))) .cse0 .cse1 .cse25) (or .cse0 .cse1 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse29 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_88| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_88|) 0))))) (and (or .cse29 (= c_~start~0 c_~end~0)) (or .cse29 .cse4) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)))))))) is different from false [2023-08-24 09:18:36,477 INFO L124 PetriNetUnfolderBase]: 1624/2708 cut-off events. [2023-08-24 09:18:36,477 INFO L125 PetriNetUnfolderBase]: For 2907/2907 co-relation queries the response was YES. [2023-08-24 09:18:36,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9115 conditions, 2708 events. 1624/2708 cut-off events. For 2907/2907 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 14549 event pairs, 172 based on Foata normal form. 28/2736 useless extension candidates. Maximal degree in co-relation 9092. Up to 553 conditions per place. [2023-08-24 09:18:36,494 INFO L140 encePairwiseOnDemand]: 335/356 looper letters, 222 selfloop transitions, 107 changer transitions 55/384 dead transitions. [2023-08-24 09:18:36,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 384 transitions, 2670 flow [2023-08-24 09:18:36,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-08-24 09:18:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-08-24 09:18:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 3658 transitions. [2023-08-24 09:18:36,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2506166072896684 [2023-08-24 09:18:36,507 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 3658 transitions. [2023-08-24 09:18:36,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 3658 transitions. [2023-08-24 09:18:36,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:18:36,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 3658 transitions. [2023-08-24 09:18:36,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 89.21951219512195) internal successors, (3658), 41 states have internal predecessors, (3658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:36,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 356.0) internal successors, (14952), 42 states have internal predecessors, (14952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:36,536 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 356.0) internal successors, (14952), 42 states have internal predecessors, (14952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:36,537 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 192 flow. Second operand 41 states and 3658 transitions. [2023-08-24 09:18:36,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 384 transitions, 2670 flow [2023-08-24 09:18:36,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 384 transitions, 2644 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-24 09:18:36,548 INFO L231 Difference]: Finished difference. Result has 102 places, 147 transitions, 1253 flow [2023-08-24 09:18:36,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=1253, PETRI_PLACES=102, PETRI_TRANSITIONS=147} [2023-08-24 09:18:36,549 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 77 predicate places. [2023-08-24 09:18:36,549 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 147 transitions, 1253 flow [2023-08-24 09:18:36,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 84.27586206896552) internal successors, (2444), 29 states have internal predecessors, (2444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:36,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:18:36,550 INFO L208 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] [2023-08-24 09:18:36,563 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-08-24 09:18:36,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:18:36,759 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 09:18:36,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:18:36,759 INFO L85 PathProgramCache]: Analyzing trace with hash -404572162, now seen corresponding path program 2 times [2023-08-24 09:18:36,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:18:36,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076977225] [2023-08-24 09:18:36,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:18:36,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:18:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:18:37,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:18:37,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:18:37,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076977225] [2023-08-24 09:18:37,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076977225] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:18:37,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850190948] [2023-08-24 09:18:37,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 09:18:37,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:18:37,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:18:37,769 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:18:37,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 09:18:37,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:18:37,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:18:37,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-24 09:18:37,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:18:37,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:18:37,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:18:37,968 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-24 09:18:37,968 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-24 09:18:38,020 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-24 09:18:38,062 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 09:18:38,062 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 09:18:38,101 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 09:18:38,138 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 09:18:38,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:18:38,349 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-24 09:18:38,350 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2023-08-24 09:18:38,359 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-08-24 09:18:38,520 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-08-24 09:18:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:18:38,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:18:38,679 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_193 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_193) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) (+ c_~v_old~0 1))) (not (= (mod c_~ok~0 256) 0))) is different from false [2023-08-24 09:18:38,772 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (< c_~end~0 0) (and (forall ((v_ArrVal_193 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_193) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) (+ c_~v_old~0 1))) (not (= (mod c_~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse0 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0)) (< c_~last~0 .cse0))))) is different from false [2023-08-24 09:18:39,134 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:18:39,134 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2023-08-24 09:18:39,165 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:18:39,166 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5260 treesize of output 4666 [2023-08-24 09:18:39,239 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:18:39,240 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1140 treesize of output 940 [2023-08-24 09:18:39,267 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 638 treesize of output 542 [2023-08-24 09:18:39,318 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:18:39,318 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 804 treesize of output 724 [2023-08-24 09:18:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-24 09:18:43,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850190948] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:18:43,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:18:43,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-08-24 09:18:43,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30856342] [2023-08-24 09:18:43,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:18:43,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-24 09:18:43,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:18:43,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-24 09:18:43,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=603, Unknown=5, NotChecked=106, Total=870 [2023-08-24 09:18:43,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 356 [2023-08-24 09:18:43,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 147 transitions, 1253 flow. Second operand has 30 states, 30 states have (on average 81.2) internal successors, (2436), 30 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:43,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:18:43,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 356 [2023-08-24 09:18:43,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:18:43,881 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n~0 c_~end~0)) (.cse1 (< c_~end~0 0)) (.cse6 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse4 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse2 (not (= (mod c_~ok~0 256) 0)))) (and (or .cse0 .cse1 (and .cse2 (forall ((~A~0.offset Int) (v_ArrVal_191 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_192))) (let ((.cse5 (select (select .cse3 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= (select (select .cse3 c_~queue~0.base) .cse4) .cse5)) (forall ((v_ArrVal_193 (Array Int Int))) (< (select (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_193) c_~queue~0.base) .cse6) (+ .cse5 1))))))))) (= c_~ok~0 1) (or .cse0 .cse1 (and (forall ((~A~0.offset Int) (v_ArrVal_192 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_192))) (let ((.cse8 (select (select .cse7 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (forall ((v_ArrVal_193 (Array Int Int))) (< (select (select (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_193) c_~queue~0.base) .cse6) (+ .cse8 1))) (not (= .cse8 (select (select .cse7 c_~queue~0.base) .cse4))))))) .cse2)))) is different from false [2023-08-24 09:18:47,510 INFO L124 PetriNetUnfolderBase]: 2911/4842 cut-off events. [2023-08-24 09:18:47,510 INFO L125 PetriNetUnfolderBase]: For 34643/34643 co-relation queries the response was YES. [2023-08-24 09:18:47,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28497 conditions, 4842 events. 2911/4842 cut-off events. For 34643/34643 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 29135 event pairs, 446 based on Foata normal form. 4/4846 useless extension candidates. Maximal degree in co-relation 28416. Up to 1681 conditions per place. [2023-08-24 09:18:47,566 INFO L140 encePairwiseOnDemand]: 342/356 looper letters, 382 selfloop transitions, 106 changer transitions 32/520 dead transitions. [2023-08-24 09:18:47,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 520 transitions, 5977 flow [2023-08-24 09:18:47,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-24 09:18:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-24 09:18:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3099 transitions. [2023-08-24 09:18:47,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2418071161048689 [2023-08-24 09:18:47,577 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 3099 transitions. [2023-08-24 09:18:47,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 3099 transitions. [2023-08-24 09:18:47,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:18:47,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 3099 transitions. [2023-08-24 09:18:47,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 86.08333333333333) internal successors, (3099), 36 states have internal predecessors, (3099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:47,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 356.0) internal successors, (13172), 37 states have internal predecessors, (13172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:47,601 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 356.0) internal successors, (13172), 37 states have internal predecessors, (13172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:47,601 INFO L175 Difference]: Start difference. First operand has 102 places, 147 transitions, 1253 flow. Second operand 36 states and 3099 transitions. [2023-08-24 09:18:47,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 520 transitions, 5977 flow [2023-08-24 09:18:47,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 520 transitions, 5662 flow, removed 151 selfloop flow, removed 9 redundant places. [2023-08-24 09:18:47,703 INFO L231 Difference]: Finished difference. Result has 140 places, 220 transitions, 2177 flow [2023-08-24 09:18:47,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2177, PETRI_PLACES=140, PETRI_TRANSITIONS=220} [2023-08-24 09:18:47,707 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 115 predicate places. [2023-08-24 09:18:47,707 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 220 transitions, 2177 flow [2023-08-24 09:18:47,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 81.2) internal successors, (2436), 30 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:47,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:18:47,708 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:18:47,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-24 09:18:47,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-08-24 09:18:47,914 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 09:18:47,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:18:47,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1834912782, now seen corresponding path program 3 times [2023-08-24 09:18:47,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:18:47,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971572181] [2023-08-24 09:18:47,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:18:47,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:18:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:18:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:18:49,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:18:49,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971572181] [2023-08-24 09:18:49,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971572181] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:18:49,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817772784] [2023-08-24 09:18:49,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 09:18:49,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:18:49,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:18:49,057 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:18:49,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 09:18:49,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 09:18:49,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:18:49,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-24 09:18:49,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:18:49,401 INFO L322 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-08-24 09:18:49,401 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2023-08-24 09:18:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:18:49,419 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:18:51,700 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:18:51,701 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 121 [2023-08-24 09:18:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:18:51,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817772784] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:18:51,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:18:51,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 22 [2023-08-24 09:18:51,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6961896] [2023-08-24 09:18:51,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:18:51,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-24 09:18:51,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:18:51,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-24 09:18:51,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2023-08-24 09:18:51,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 356 [2023-08-24 09:18:51,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 220 transitions, 2177 flow. Second operand has 24 states, 24 states have (on average 91.83333333333333) internal successors, (2204), 24 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:51,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:18:51,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 356 [2023-08-24 09:18:51,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:18:53,413 INFO L124 PetriNetUnfolderBase]: 3318/5492 cut-off events. [2023-08-24 09:18:53,413 INFO L125 PetriNetUnfolderBase]: For 46877/46877 co-relation queries the response was YES. [2023-08-24 09:18:53,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34925 conditions, 5492 events. 3318/5492 cut-off events. For 46877/46877 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 33377 event pairs, 368 based on Foata normal form. 1/5493 useless extension candidates. Maximal degree in co-relation 34858. Up to 2479 conditions per place. [2023-08-24 09:18:53,475 INFO L140 encePairwiseOnDemand]: 343/356 looper letters, 261 selfloop transitions, 112 changer transitions 11/384 dead transitions. [2023-08-24 09:18:53,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 384 transitions, 4838 flow [2023-08-24 09:18:53,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-24 09:18:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-24 09:18:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2097 transitions. [2023-08-24 09:18:53,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2677477017364658 [2023-08-24 09:18:53,480 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2097 transitions. [2023-08-24 09:18:53,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2097 transitions. [2023-08-24 09:18:53,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:18:53,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2097 transitions. [2023-08-24 09:18:53,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 95.31818181818181) internal successors, (2097), 22 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:53,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 356.0) internal successors, (8188), 23 states have internal predecessors, (8188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:53,495 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 356.0) internal successors, (8188), 23 states have internal predecessors, (8188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:53,495 INFO L175 Difference]: Start difference. First operand has 140 places, 220 transitions, 2177 flow. Second operand 22 states and 2097 transitions. [2023-08-24 09:18:53,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 384 transitions, 4838 flow [2023-08-24 09:18:53,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 384 transitions, 4693 flow, removed 63 selfloop flow, removed 9 redundant places. [2023-08-24 09:18:53,691 INFO L231 Difference]: Finished difference. Result has 158 places, 255 transitions, 2868 flow [2023-08-24 09:18:53,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=2040, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2868, PETRI_PLACES=158, PETRI_TRANSITIONS=255} [2023-08-24 09:18:53,691 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 133 predicate places. [2023-08-24 09:18:53,691 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 255 transitions, 2868 flow [2023-08-24 09:18:53,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 91.83333333333333) internal successors, (2204), 24 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:53,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:18:53,693 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:18:53,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 09:18:53,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:18:53,900 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 09:18:53,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:18:53,900 INFO L85 PathProgramCache]: Analyzing trace with hash 680892151, now seen corresponding path program 4 times [2023-08-24 09:18:53,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:18:53,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015903270] [2023-08-24 09:18:53,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:18:53,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:18:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:18:54,096 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:18:54,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:18:54,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015903270] [2023-08-24 09:18:54,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015903270] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:18:54,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673068729] [2023-08-24 09:18:54,097 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 09:18:54,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:18:54,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:18:54,098 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:18:54,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 09:18:54,194 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 09:18:54,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:18:54,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 09:18:54,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:18:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:18:54,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:18:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:18:54,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673068729] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:18:54,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:18:54,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 9 [2023-08-24 09:18:54,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625802298] [2023-08-24 09:18:54,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:18:54,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 09:18:54,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:18:54,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 09:18:54,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2023-08-24 09:18:54,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 356 [2023-08-24 09:18:54,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 255 transitions, 2868 flow. Second operand has 10 states, 10 states have (on average 150.0) internal successors, (1500), 10 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:54,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:18:54,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 356 [2023-08-24 09:18:54,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:18:55,439 INFO L124 PetriNetUnfolderBase]: 4262/7245 cut-off events. [2023-08-24 09:18:55,439 INFO L125 PetriNetUnfolderBase]: For 88698/88698 co-relation queries the response was YES. [2023-08-24 09:18:55,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50922 conditions, 7245 events. 4262/7245 cut-off events. For 88698/88698 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 47135 event pairs, 534 based on Foata normal form. 286/7531 useless extension candidates. Maximal degree in co-relation 50853. Up to 2996 conditions per place. [2023-08-24 09:18:55,502 INFO L140 encePairwiseOnDemand]: 351/356 looper letters, 274 selfloop transitions, 74 changer transitions 27/375 dead transitions. [2023-08-24 09:18:55,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 375 transitions, 5045 flow [2023-08-24 09:18:55,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 09:18:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 09:18:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1090 transitions. [2023-08-24 09:18:55,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4373996789727127 [2023-08-24 09:18:55,508 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1090 transitions. [2023-08-24 09:18:55,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1090 transitions. [2023-08-24 09:18:55,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:18:55,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1090 transitions. [2023-08-24 09:18:55,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 155.71428571428572) internal successors, (1090), 7 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:55,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 356.0) internal successors, (2848), 8 states have internal predecessors, (2848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:55,515 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 356.0) internal successors, (2848), 8 states have internal predecessors, (2848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:55,515 INFO L175 Difference]: Start difference. First operand has 158 places, 255 transitions, 2868 flow. Second operand 7 states and 1090 transitions. [2023-08-24 09:18:55,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 375 transitions, 5045 flow [2023-08-24 09:18:55,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 375 transitions, 4850 flow, removed 78 selfloop flow, removed 10 redundant places. [2023-08-24 09:18:55,862 INFO L231 Difference]: Finished difference. Result has 155 places, 263 transitions, 3241 flow [2023-08-24 09:18:55,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=2418, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3241, PETRI_PLACES=155, PETRI_TRANSITIONS=263} [2023-08-24 09:18:55,862 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 130 predicate places. [2023-08-24 09:18:55,863 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 263 transitions, 3241 flow [2023-08-24 09:18:55,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 150.0) internal successors, (1500), 10 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:55,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:18:55,863 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:18:55,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 09:18:56,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:18:56,072 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 09:18:56,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:18:56,072 INFO L85 PathProgramCache]: Analyzing trace with hash -857604897, now seen corresponding path program 5 times [2023-08-24 09:18:56,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:18:56,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138449728] [2023-08-24 09:18:56,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:18:56,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:18:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:18:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:18:56,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:18:56,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138449728] [2023-08-24 09:18:56,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138449728] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:18:56,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606051464] [2023-08-24 09:18:56,200 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 09:18:56,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:18:56,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:18:56,201 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:18:56,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 09:18:56,302 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:18:56,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:18:56,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 09:18:56,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:18:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:18:56,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:18:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:18:56,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606051464] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:18:56,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:18:56,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-08-24 09:18:56,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382019379] [2023-08-24 09:18:56,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:18:56,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 09:18:56,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:18:56,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 09:18:56,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-08-24 09:18:56,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 356 [2023-08-24 09:18:56,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 263 transitions, 3241 flow. Second operand has 15 states, 15 states have (on average 130.46666666666667) internal successors, (1957), 15 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:56,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:18:56,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 356 [2023-08-24 09:18:56,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:18:58,106 INFO L124 PetriNetUnfolderBase]: 5648/9679 cut-off events. [2023-08-24 09:18:58,106 INFO L125 PetriNetUnfolderBase]: For 132617/132617 co-relation queries the response was YES. [2023-08-24 09:18:58,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72670 conditions, 9679 events. 5648/9679 cut-off events. For 132617/132617 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 67670 event pairs, 1023 based on Foata normal form. 148/9827 useless extension candidates. Maximal degree in co-relation 72351. Up to 3961 conditions per place. [2023-08-24 09:18:58,202 INFO L140 encePairwiseOnDemand]: 348/356 looper letters, 445 selfloop transitions, 127 changer transitions 0/572 dead transitions. [2023-08-24 09:18:58,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 572 transitions, 8597 flow [2023-08-24 09:18:58,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 09:18:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 09:18:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1339 transitions. [2023-08-24 09:18:58,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37612359550561797 [2023-08-24 09:18:58,205 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1339 transitions. [2023-08-24 09:18:58,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1339 transitions. [2023-08-24 09:18:58,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:18:58,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1339 transitions. [2023-08-24 09:18:58,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 133.9) internal successors, (1339), 10 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:58,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 356.0) internal successors, (3916), 11 states have internal predecessors, (3916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:58,211 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 356.0) internal successors, (3916), 11 states have internal predecessors, (3916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:58,211 INFO L175 Difference]: Start difference. First operand has 155 places, 263 transitions, 3241 flow. Second operand 10 states and 1339 transitions. [2023-08-24 09:18:58,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 572 transitions, 8597 flow [2023-08-24 09:18:58,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 572 transitions, 8361 flow, removed 118 selfloop flow, removed 0 redundant places. [2023-08-24 09:18:58,941 INFO L231 Difference]: Finished difference. Result has 167 places, 317 transitions, 4315 flow [2023-08-24 09:18:58,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=3149, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4315, PETRI_PLACES=167, PETRI_TRANSITIONS=317} [2023-08-24 09:18:58,942 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 142 predicate places. [2023-08-24 09:18:58,942 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 317 transitions, 4315 flow [2023-08-24 09:18:58,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 130.46666666666667) internal successors, (1957), 15 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:58,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:18:58,943 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:18:58,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 09:18:59,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-24 09:18:59,149 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 09:18:59,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:18:59,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1553171405, now seen corresponding path program 1 times [2023-08-24 09:18:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:18:59,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426091260] [2023-08-24 09:18:59,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:18:59,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:18:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:18:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:18:59,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:18:59,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426091260] [2023-08-24 09:18:59,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426091260] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:18:59,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49198386] [2023-08-24 09:18:59,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:18:59,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:18:59,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:18:59,259 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:18:59,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 09:18:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:18:59,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 09:18:59,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:18:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:18:59,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:18:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:18:59,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49198386] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:18:59,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:18:59,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-08-24 09:18:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283150342] [2023-08-24 09:18:59,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:18:59,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 09:18:59,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:18:59,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 09:18:59,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2023-08-24 09:18:59,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 356 [2023-08-24 09:18:59,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 317 transitions, 4315 flow. Second operand has 15 states, 15 states have (on average 129.86666666666667) internal successors, (1948), 15 states have internal predecessors, (1948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:18:59,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:18:59,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 356 [2023-08-24 09:18:59,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:19:01,173 INFO L124 PetriNetUnfolderBase]: 5297/9513 cut-off events. [2023-08-24 09:19:01,174 INFO L125 PetriNetUnfolderBase]: For 132865/132865 co-relation queries the response was YES. [2023-08-24 09:19:01,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71343 conditions, 9513 events. 5297/9513 cut-off events. For 132865/132865 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 69545 event pairs, 877 based on Foata normal form. 215/9728 useless extension candidates. Maximal degree in co-relation 71093. Up to 5971 conditions per place. [2023-08-24 09:19:01,258 INFO L140 encePairwiseOnDemand]: 348/356 looper letters, 321 selfloop transitions, 35 changer transitions 102/458 dead transitions. [2023-08-24 09:19:01,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 458 transitions, 6975 flow [2023-08-24 09:19:01,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 09:19:01,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 09:19:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1212 transitions. [2023-08-24 09:19:01,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782771535580524 [2023-08-24 09:19:01,263 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1212 transitions. [2023-08-24 09:19:01,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1212 transitions. [2023-08-24 09:19:01,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:19:01,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1212 transitions. [2023-08-24 09:19:01,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 134.66666666666666) internal successors, (1212), 9 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:01,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 356.0) internal successors, (3560), 10 states have internal predecessors, (3560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:01,268 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 356.0) internal successors, (3560), 10 states have internal predecessors, (3560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:01,268 INFO L175 Difference]: Start difference. First operand has 167 places, 317 transitions, 4315 flow. Second operand 9 states and 1212 transitions. [2023-08-24 09:19:01,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 458 transitions, 6975 flow [2023-08-24 09:19:01,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 458 transitions, 6783 flow, removed 57 selfloop flow, removed 9 redundant places. [2023-08-24 09:19:01,990 INFO L231 Difference]: Finished difference. Result has 165 places, 250 transitions, 3311 flow [2023-08-24 09:19:01,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=3695, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3311, PETRI_PLACES=165, PETRI_TRANSITIONS=250} [2023-08-24 09:19:01,991 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 140 predicate places. [2023-08-24 09:19:01,991 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 250 transitions, 3311 flow [2023-08-24 09:19:01,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 129.86666666666667) internal successors, (1948), 15 states have internal predecessors, (1948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:01,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:19:01,992 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:19:01,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 09:19:02,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:19:02,197 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 09:19:02,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:19:02,198 INFO L85 PathProgramCache]: Analyzing trace with hash 342309910, now seen corresponding path program 6 times [2023-08-24 09:19:02,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:19:02,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872746065] [2023-08-24 09:19:02,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:19:02,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:19:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:19:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:19:03,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:19:03,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872746065] [2023-08-24 09:19:03,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872746065] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:19:03,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906545399] [2023-08-24 09:19:03,700 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 09:19:03,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:19:03,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:19:03,701 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:19:03,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 09:19:03,902 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-24 09:19:03,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:19:03,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 44 conjunts are in the unsatisfiable core [2023-08-24 09:19:03,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:19:04,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:19:04,195 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-24 09:19:04,196 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2023-08-24 09:19:04,203 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-08-24 09:19:04,291 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-08-24 09:19:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:19:04,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:19:04,436 WARN L839 $PredicateComparison]: unable to prove that (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_412 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_412) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) (+ c_~v_old~0 1)))) is different from false [2023-08-24 09:19:04,532 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:19:04,532 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 135 [2023-08-24 09:19:04,539 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2023-08-24 09:19:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-24 09:19:04,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906545399] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:19:04,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:19:04,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 31 [2023-08-24 09:19:04,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050580835] [2023-08-24 09:19:04,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:19:04,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 09:19:04,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:19:04,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 09:19:04,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=812, Unknown=1, NotChecked=60, Total=1056 [2023-08-24 09:19:04,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 356 [2023-08-24 09:19:04,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 250 transitions, 3311 flow. Second operand has 33 states, 33 states have (on average 87.18181818181819) internal successors, (2877), 33 states have internal predecessors, (2877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:04,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:19:04,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 356 [2023-08-24 09:19:04,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:19:07,334 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 [0] [2023-08-24 09:19:09,550 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 [0] [2023-08-24 09:19:11,576 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 [0] [2023-08-24 09:19:13,211 INFO L124 PetriNetUnfolderBase]: 5574/9645 cut-off events. [2023-08-24 09:19:13,212 INFO L125 PetriNetUnfolderBase]: For 125039/125039 co-relation queries the response was YES. [2023-08-24 09:19:13,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72364 conditions, 9645 events. 5574/9645 cut-off events. For 125039/125039 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 68325 event pairs, 787 based on Foata normal form. 6/9651 useless extension candidates. Maximal degree in co-relation 72305. Up to 4393 conditions per place. [2023-08-24 09:19:13,316 INFO L140 encePairwiseOnDemand]: 342/356 looper letters, 247 selfloop transitions, 210 changer transitions 36/493 dead transitions. [2023-08-24 09:19:13,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 493 transitions, 7782 flow [2023-08-24 09:19:13,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-24 09:19:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-24 09:19:13,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1816 transitions. [2023-08-24 09:19:13,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2550561797752809 [2023-08-24 09:19:13,320 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1816 transitions. [2023-08-24 09:19:13,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1816 transitions. [2023-08-24 09:19:13,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:19:13,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1816 transitions. [2023-08-24 09:19:13,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 90.8) internal successors, (1816), 20 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:13,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 356.0) internal successors, (7476), 21 states have internal predecessors, (7476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:13,332 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 356.0) internal successors, (7476), 21 states have internal predecessors, (7476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:13,332 INFO L175 Difference]: Start difference. First operand has 165 places, 250 transitions, 3311 flow. Second operand 20 states and 1816 transitions. [2023-08-24 09:19:13,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 493 transitions, 7782 flow [2023-08-24 09:19:13,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 493 transitions, 7565 flow, removed 78 selfloop flow, removed 7 redundant places. [2023-08-24 09:19:13,991 INFO L231 Difference]: Finished difference. Result has 174 places, 360 transitions, 5734 flow [2023-08-24 09:19:13,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=3189, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=5734, PETRI_PLACES=174, PETRI_TRANSITIONS=360} [2023-08-24 09:19:13,991 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 149 predicate places. [2023-08-24 09:19:13,992 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 360 transitions, 5734 flow [2023-08-24 09:19:13,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 87.18181818181819) internal successors, (2877), 33 states have internal predecessors, (2877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:13,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:19:13,992 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:19:14,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 09:19:14,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:19:14,199 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 09:19:14,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:19:14,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1424845512, now seen corresponding path program 7 times [2023-08-24 09:19:14,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:19:14,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658496794] [2023-08-24 09:19:14,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:19:14,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:19:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:19:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:19:15,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:19:15,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658496794] [2023-08-24 09:19:15,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658496794] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:19:15,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38564016] [2023-08-24 09:19:15,788 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 09:19:15,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:19:15,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:19:15,789 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:19:15,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-24 09:19:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:19:15,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-24 09:19:15,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:19:16,010 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 09:19:16,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:19:16,051 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 09:19:16,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:19:16,140 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 09:19:16,299 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-08-24 09:19:16,299 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2023-08-24 09:19:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-24 09:19:16,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:19:22,776 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse1 (* c_~end~0 4)) (.cse2 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_466 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_466))) (= (select (select .cse0 ~queue~0.base) (+ .cse1 ~queue~0.offset)) (select (select .cse0 c_~A~0.base) .cse2)))))) (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_466 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_466))) (let ((.cse3 (select .cse4 ~queue~0.base))) (or (< (select .cse3 (+ (* c_~start~0 4) ~queue~0.offset)) (+ c_~v_old~0 1)) (not (= (select .cse3 (+ .cse1 ~queue~0.offset)) (select (select .cse4 c_~A~0.base) .cse2))))))))) (and (<= c_~N~0 c_~i~0) (<= c_~end~0 c_~start~0))) is different from false [2023-08-24 09:19:22,790 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~end~0 4)) (.cse2 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_466 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_466))) (= (select (select .cse0 ~queue~0.base) (+ .cse1 ~queue~0.offset)) (select (select .cse0 c_~A~0.base) .cse2)))))) (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_466 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_466))) (let ((.cse3 (select .cse4 ~queue~0.base))) (or (< (select .cse3 (+ (* c_~start~0 4) ~queue~0.offset)) (+ c_~v_old~0 1)) (not (= (select .cse3 (+ .cse1 ~queue~0.offset)) (select (select .cse4 c_~A~0.base) .cse2))))))))) is different from false [2023-08-24 09:19:22,838 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~end~0 4)) (.cse2 (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_466))) (= (select (select .cse0 ~queue~0.base) (+ .cse1 ~queue~0.offset)) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2)))))) (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_466))) (let ((.cse3 (select .cse4 ~queue~0.base))) (or (not (= (select .cse3 (+ .cse1 ~queue~0.offset)) (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2))) (< (select .cse3 (+ (* c_~start~0 4) ~queue~0.offset)) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)))))))) is different from false [2023-08-24 09:19:22,850 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:19:22,850 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 74 [2023-08-24 09:19:22,860 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:19:22,861 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 547 treesize of output 535 [2023-08-24 09:19:22,909 INFO L322 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2023-08-24 09:19:22,910 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 667 treesize of output 672 [2023-08-24 09:19:22,951 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:19:22,951 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 652 treesize of output 560 [2023-08-24 09:19:22,991 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:19:22,992 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 449 treesize of output 423 [2023-08-24 09:19:32,307 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 09:19:32,307 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2023-08-24 09:19:32,320 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-24 09:19:32,321 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2023-08-24 09:19:32,335 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 09:19:32,335 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 22 [2023-08-24 09:19:32,342 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-24 09:19:32,342 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2023-08-24 09:19:32,348 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-08-24 09:19:32,353 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-08-24 09:19:32,363 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 09:19:32,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 1 [2023-08-24 09:19:32,373 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-24 09:19:32,393 INFO L322 Elim1Store]: treesize reduction 58, result has 20.5 percent of original size [2023-08-24 09:19:32,394 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 24 [2023-08-24 09:19:32,411 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:19:32,411 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 41 [2023-08-24 09:19:32,414 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:19:32,414 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:19:32,420 INFO L322 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2023-08-24 09:19:32,420 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 138 [2023-08-24 09:19:32,426 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-08-24 09:19:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2023-08-24 09:19:32,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38564016] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:19:32,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:19:32,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2023-08-24 09:19:32,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729011910] [2023-08-24 09:19:32,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:19:32,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-24 09:19:32,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:19:32,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-24 09:19:32,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=619, Unknown=3, NotChecked=162, Total=930 [2023-08-24 09:19:32,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 356 [2023-08-24 09:19:32,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 360 transitions, 5734 flow. Second operand has 31 states, 31 states have (on average 83.2258064516129) internal successors, (2580), 31 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:32,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:19:32,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 356 [2023-08-24 09:19:32,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:19:39,403 INFO L124 PetriNetUnfolderBase]: 6107/10587 cut-off events. [2023-08-24 09:19:39,403 INFO L125 PetriNetUnfolderBase]: For 160391/160391 co-relation queries the response was YES. [2023-08-24 09:19:39,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85450 conditions, 10587 events. 6107/10587 cut-off events. For 160391/160391 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 75020 event pairs, 638 based on Foata normal form. 9/10596 useless extension candidates. Maximal degree in co-relation 85385. Up to 4315 conditions per place. [2023-08-24 09:19:39,500 INFO L140 encePairwiseOnDemand]: 342/356 looper letters, 334 selfloop transitions, 211 changer transitions 54/599 dead transitions. [2023-08-24 09:19:39,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 599 transitions, 10694 flow [2023-08-24 09:19:39,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-24 09:19:39,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-24 09:19:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2001 transitions. [2023-08-24 09:19:39,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2443820224719101 [2023-08-24 09:19:39,504 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2001 transitions. [2023-08-24 09:19:39,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2001 transitions. [2023-08-24 09:19:39,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:19:39,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2001 transitions. [2023-08-24 09:19:39,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 87.0) internal successors, (2001), 23 states have internal predecessors, (2001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:39,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 356.0) internal successors, (8544), 24 states have internal predecessors, (8544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:39,515 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 356.0) internal successors, (8544), 24 states have internal predecessors, (8544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:39,515 INFO L175 Difference]: Start difference. First operand has 174 places, 360 transitions, 5734 flow. Second operand 23 states and 2001 transitions. [2023-08-24 09:19:39,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 599 transitions, 10694 flow [2023-08-24 09:19:40,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 599 transitions, 10258 flow, removed 114 selfloop flow, removed 11 redundant places. [2023-08-24 09:19:40,498 INFO L231 Difference]: Finished difference. Result has 193 places, 415 transitions, 7094 flow [2023-08-24 09:19:40,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=5460, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7094, PETRI_PLACES=193, PETRI_TRANSITIONS=415} [2023-08-24 09:19:40,498 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 168 predicate places. [2023-08-24 09:19:40,499 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 415 transitions, 7094 flow [2023-08-24 09:19:40,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 83.2258064516129) internal successors, (2580), 31 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:40,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:19:40,499 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:19:40,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-24 09:19:40,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-24 09:19:40,700 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 09:19:40,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:19:40,700 INFO L85 PathProgramCache]: Analyzing trace with hash 504415727, now seen corresponding path program 8 times [2023-08-24 09:19:40,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:19:40,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442934167] [2023-08-24 09:19:40,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:19:40,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:19:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:19:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:19:40,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:19:40,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442934167] [2023-08-24 09:19:40,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442934167] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:19:40,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705705950] [2023-08-24 09:19:40,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 09:19:40,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:19:40,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:19:40,808 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:19:40,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-24 09:19:40,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:19:40,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:19:40,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 09:19:40,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:19:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:19:41,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:19:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:19:41,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705705950] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:19:41,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:19:41,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-24 09:19:41,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318802800] [2023-08-24 09:19:41,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:19:41,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 09:19:41,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:19:41,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 09:19:41,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-08-24 09:19:41,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 356 [2023-08-24 09:19:41,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 415 transitions, 7094 flow. Second operand has 12 states, 12 states have (on average 135.16666666666666) internal successors, (1622), 12 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:41,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:19:41,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 356 [2023-08-24 09:19:41,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:19:42,816 INFO L124 PetriNetUnfolderBase]: 3996/7052 cut-off events. [2023-08-24 09:19:42,816 INFO L125 PetriNetUnfolderBase]: For 128151/128151 co-relation queries the response was YES. [2023-08-24 09:19:42,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59027 conditions, 7052 events. 3996/7052 cut-off events. For 128151/128151 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 48464 event pairs, 1554 based on Foata normal form. 137/7189 useless extension candidates. Maximal degree in co-relation 58955. Up to 5050 conditions per place. [2023-08-24 09:19:42,888 INFO L140 encePairwiseOnDemand]: 351/356 looper letters, 232 selfloop transitions, 3 changer transitions 193/428 dead transitions. [2023-08-24 09:19:42,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 428 transitions, 8300 flow [2023-08-24 09:19:42,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 09:19:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 09:19:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 967 transitions. [2023-08-24 09:19:42,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3880417335473515 [2023-08-24 09:19:42,889 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 967 transitions. [2023-08-24 09:19:42,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 967 transitions. [2023-08-24 09:19:42,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:19:42,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 967 transitions. [2023-08-24 09:19:42,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.14285714285714) internal successors, (967), 7 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:42,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 356.0) internal successors, (2848), 8 states have internal predecessors, (2848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:42,894 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 356.0) internal successors, (2848), 8 states have internal predecessors, (2848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:42,894 INFO L175 Difference]: Start difference. First operand has 193 places, 415 transitions, 7094 flow. Second operand 7 states and 967 transitions. [2023-08-24 09:19:42,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 428 transitions, 8300 flow [2023-08-24 09:19:43,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 428 transitions, 7677 flow, removed 95 selfloop flow, removed 18 redundant places. [2023-08-24 09:19:43,717 INFO L231 Difference]: Finished difference. Result has 174 places, 235 transitions, 3757 flow [2023-08-24 09:19:43,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=5798, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3757, PETRI_PLACES=174, PETRI_TRANSITIONS=235} [2023-08-24 09:19:43,717 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 149 predicate places. [2023-08-24 09:19:43,718 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 235 transitions, 3757 flow [2023-08-24 09:19:43,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 135.16666666666666) internal successors, (1622), 12 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:19:43,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:19:43,718 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:19:43,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-24 09:19:43,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-24 09:19:43,919 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 09:19:43,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:19:43,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1773197649, now seen corresponding path program 9 times [2023-08-24 09:19:43,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:19:43,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965523238] [2023-08-24 09:19:43,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:19:43,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:19:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:19:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:19:45,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:19:45,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965523238] [2023-08-24 09:19:45,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965523238] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:19:45,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512325424] [2023-08-24 09:19:45,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 09:19:45,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:19:45,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:19:45,289 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-08-24 09:19:45,316 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-08-24 09:19:45,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 09:19:45,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:19:45,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 61 conjunts are in the unsatisfiable core [2023-08-24 09:19:45,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:19:46,302 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:19:46,333 INFO L322 Elim1Store]: treesize reduction 75, result has 39.5 percent of original size [2023-08-24 09:19:46,334 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 64 [2023-08-24 09:19:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:19:46,360 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:19:48,468 INFO L322 Elim1Store]: treesize reduction 158, result has 85.4 percent of original size [2023-08-24 09:19:48,468 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 265 treesize of output 1013 [2023-08-24 09:19:51,664 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:19:57,207 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:19:58,836 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:19:59,226 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:19:59,424 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:19:59,514 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:19:59,712 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:20:00,111 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:20:01,871 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:20:03,531 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:20:08,611 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:20:14,422 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:20:16,213 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:20:16,654 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:20:16,875 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:20:16,971 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:20:17,192 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:20:17,638 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:20:19,886 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:20:21,692 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:20:42,676 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:21,315 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:21,515 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:21,604 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:21:21,948 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:22,420 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:23,281 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:25,960 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:29,805 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:31,705 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:31,871 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:31,950 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:21:32,252 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:32,688 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:33,488 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:36,014 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:39,696 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:41,555 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:43,008 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:43,526 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:43,675 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:21:43,833 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:44,321 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:44,710 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:46,944 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:47,707 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:47,936 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:21:48,178 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:48,905 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:49,284 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:50,251 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:50,521 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:50,791 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:21:51,428 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:52,373 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:52,624 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:21:52,968 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:53,261 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:53,444 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:21:53,547 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:53,647 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:21:53,763 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:21:53,894 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:21:54,007 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:54,139 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:54,834 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:55,097 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:55,223 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:21:55,664 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:56,260 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:21:57,327 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:00,525 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:03,266 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:04,619 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:04,952 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:05,099 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:22:05,482 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:05,944 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:06,912 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:09,601 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:12,676 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:13,579 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:15,341 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:16,237 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:16,431 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:22:16,634 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:17,224 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:17,696 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:20,542 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:21,882 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:22,167 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:22:22,457 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:23,372 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:23,608 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:23,980 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:24,088 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:24,192 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:22:24,459 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:24,891 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:25,008 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:22:25,180 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:25,355 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:25,578 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:22:25,755 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:25,918 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:22:26,110 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:22:26,311 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:22:26,486 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:26,661 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:22:43,429 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:23:28,299 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:23:28,450 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:23:28,647 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:23:28,987 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:23:30,652 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:23:36,771 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:23:45,531 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:23:56,405 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:20,073 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:25,705 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:26,055 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:26,326 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:26,349 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:24:26,513 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:26,778 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:26,966 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:27,932 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:29,558 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:35,006 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:35,300 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:35,348 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:24:35,739 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:36,184 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:36,934 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:37,223 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:37,370 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:24:37,625 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:37,849 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:24:38,066 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:24:38,287 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:24:38,316 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:38,348 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:38,378 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:24:38,586 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:38,900 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:39,214 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:39,277 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:39,464 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:24:39,737 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:40,429 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:40,651 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:40,692 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:24:40,996 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:41,304 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:43,092 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:45,953 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:48,684 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:50,143 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:50,631 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:50,886 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:51,104 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:24:51,709 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:24:55,704 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:25:00,600 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:25:01,118 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:25:01,789 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:25:02,071 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:25:02,264 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:25:05,021 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:25:08,550 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:25:31,757 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:25:56,127 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:25:56,352 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:25:56,621 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:25:56,901 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:25:57,784 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:25:58,054 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:25:58,371 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:25:58,740 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:26:12,680 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:26:13,143 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:26:13,510 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:26:13,980 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:26:21,937 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:26:29,793 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:26:34,257 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:26:45,812 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:26:50,441 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:26:56,030 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:08,945 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:12,845 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:18,739 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:21,334 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:21,367 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:27:21,664 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:27:21,980 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:27:22,049 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:22,081 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:27:22,383 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:22,465 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:22,870 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:22,906 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:27:23,225 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:23,574 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:27:23,909 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:23,949 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:24,416 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:24,931 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:26,635 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:28,223 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:28,733 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:29,199 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:27:29,579 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:29,863 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:30,807 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:31,946 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:32,304 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:32,635 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:27:32,980 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:33,358 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:42,432 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:55,316 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:27:55,347 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:55,856 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:56,277 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:57,076 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:57,277 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:27:57,540 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:01,096 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:02,741 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:28:03,009 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:05,357 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:05,918 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:08,883 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:10,202 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:10,416 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:12,645 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:27,508 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:27,985 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:28:28,180 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:28,541 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:28,913 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:30,104 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:30,665 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:30,805 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:31,710 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:41,687 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:42,268 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:44,068 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:44,785 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:46,821 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:47,313 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:48,172 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:49,757 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:50,485 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:51,250 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:51,769 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:52,558 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:53,617 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:54,790 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:55,317 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:56,635 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:57,577 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:58,280 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:58,661 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:28:59,287 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:00,131 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:01,150 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:02,180 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:03,488 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:04,566 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:05,315 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:05,789 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:15,756 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:25,511 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:27,430 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:30,721 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:31,440 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:31,515 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:32,967 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:43,779 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:47,044 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:51,471 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:53,162 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:29:53,799 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:03,691 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:05,646 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:06,237 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:38,641 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:40,990 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:42,977 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:44,739 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:30:44,865 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:45,014 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:45,150 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:45,267 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:30:45,607 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:45,746 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:46,313 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:47,140 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:47,257 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:30:47,407 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:49,024 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:49,603 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:30:49,918 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:51,206 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:54,382 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:55,449 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:57,557 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:57,909 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:30:58,265 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:58,870 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:59,320 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:59,418 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:30:59,638 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:30:59,770 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:00,270 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:00,774 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:00,912 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:01,055 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:31:01,253 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:01,586 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:02,160 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:02,398 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:02,601 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:31:02,847 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:03,066 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:31:04,935 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:31:05,624 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:31:05,768 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:06,056 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:06,555 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:07,419 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:07,645 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:07,842 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:31:08,071 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:08,910 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:10,577 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:11,018 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:11,862 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:12,078 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:12,175 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:31:12,909 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:13,040 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:31:13,947 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:14,598 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:14,768 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:16,356 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:17,289 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:31:18,597 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:19,369 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:31:21,263 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:22,187 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:23,045 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:31:23,435 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:25,713 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:27,683 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:30,434 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:31,346 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:31:31,628 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:31,945 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:32,225 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:32,465 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:31:33,003 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:33,113 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:33,578 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:34,472 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:34,624 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:31:34,813 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:36,791 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:37,484 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 09:31:37,815 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:38,030 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:31:38,502 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:38,770 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:39,739 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:40,666 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:40,918 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:41,178 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:31:41,527 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:42,110 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:43,126 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:43,725 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:47,808 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:48,182 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:48,444 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:48,799 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 09:31:49,052 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:50,032 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:50,348 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:50,637 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 09:31:50,888 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. Received shutdown request... [2023-08-24 09:31:51,055 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 09:31:51,055 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 09:31:51,065 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-24 09:31:51,067 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-24 09:31:51,073 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-08-24 09:31:51,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-24 09:31:51,268 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 28ms.. [2023-08-24 09:31:51,269 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-24 09:31:51,269 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-24 09:31:51,270 INFO L445 BasicCegarLoop]: Path program histogram: [9, 2, 1, 1, 1, 1, 1] [2023-08-24 09:31:51,272 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 09:31:51,272 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 09:31:51,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 09:31:51 BasicIcfg [2023-08-24 09:31:51,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 09:31:51,275 INFO L158 Benchmark]: Toolchain (without parser) took 823458.38ms. Allocated memory was 396.4MB in the beginning and 2.2GB in the end (delta: 1.8GB). Free memory was 352.2MB in the beginning and 1.1GB in the end (delta: -770.2MB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. [2023-08-24 09:31:51,275 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 396.4MB. Free memory is still 373.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 09:31:51,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.27ms. Allocated memory is still 396.4MB. Free memory was 352.2MB in the beginning and 340.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 09:31:51,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.61ms. Allocated memory is still 396.4MB. Free memory was 340.3MB in the beginning and 338.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 09:31:51,276 INFO L158 Benchmark]: Boogie Preprocessor took 47.82ms. Allocated memory is still 396.4MB. Free memory was 338.2MB in the beginning and 336.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 09:31:51,276 INFO L158 Benchmark]: RCFGBuilder took 626.33ms. Allocated memory is still 396.4MB. Free memory was 336.5MB in the beginning and 352.0MB in the end (delta: -15.5MB). Peak memory consumption was 6.5MB. Max. memory is 16.0GB. [2023-08-24 09:31:51,276 INFO L158 Benchmark]: TraceAbstraction took 822409.89ms. Allocated memory was 396.4MB in the beginning and 2.2GB in the end (delta: 1.8GB). Free memory was 351.3MB in the beginning and 1.1GB in the end (delta: -771.1MB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. [2023-08-24 09:31:51,277 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.14ms. Allocated memory is still 396.4MB. Free memory is still 373.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 304.27ms. Allocated memory is still 396.4MB. Free memory was 352.2MB in the beginning and 340.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.61ms. Allocated memory is still 396.4MB. Free memory was 340.3MB in the beginning and 338.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 47.82ms. Allocated memory is still 396.4MB. Free memory was 338.2MB in the beginning and 336.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 626.33ms. Allocated memory is still 396.4MB. Free memory was 336.5MB in the beginning and 352.0MB in the end (delta: -15.5MB). Peak memory consumption was 6.5MB. Max. memory is 16.0GB. * TraceAbstraction took 822409.89ms. Allocated memory was 396.4MB in the beginning and 2.2GB in the end (delta: 1.8GB). Free memory was 351.3MB in the beginning and 1.1GB in the end (delta: -771.1MB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 162 PlacesBefore, 25 PlacesAfterwards, 170 TransitionsBefore, 23 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 7 FixpointIterations, 118 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 25 TrivialYvCompositions, 5 ConcurrentYvCompositions, 10 ChoiceCompositions, 176 TotalNumberOfCompositions, 1213 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1002, independent: 935, independent conditional: 0, independent unconditional: 935, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 390, independent: 379, independent conditional: 0, independent unconditional: 379, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1002, independent: 556, independent conditional: 0, independent unconditional: 556, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 390, unknown conditional: 0, unknown unconditional: 390] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 28ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 28ms.. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 28ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 190 locations, 3 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: 822.3s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 44.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 123 mSolverCounterUnknown, 1545 SdHoareTripleChecker+Valid, 18.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1545 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 17.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1690 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5554 IncrementalHoareTripleChecker+Invalid, 7535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 7 mSDtfsCounter, 5554 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 636 GetRequests, 315 SyntacticMatches, 12 SemanticMatches, 309 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 2941 ImplicationChecksByTransitivity, 24.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7094occurred in iteration=14, InterpolantAutomatonStates: 201, 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, 1.1s SatisfiabilityAnalysisTime, 40.6s InterpolantComputationTime, 542 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 728 ConstructedInterpolants, 52 QuantifiedInterpolants, 10798 SizeOfPredicates, 139 NumberOfNonLiveVariables, 2394 ConjunctsInSsa, 270 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 147/245 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