/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 -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 02:50:56,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 02:50:56,095 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 02:50:56,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 02:50:56,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 02:50:56,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 02:50:56,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 02:50:56,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 02:50:56,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 02:50:56,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 02:50:56,131 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 02:50:56,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 02:50:56,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 02:50:56,133 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 02:50:56,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 02:50:56,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 02:50:56,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 02:50:56,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 02:50:56,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 02:50:56,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 02:50:56,134 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 02:50:56,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 02:50:56,135 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 02:50:56,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 02:50:56,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 02:50:56,135 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 02:50:56,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 02:50:56,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 02:50:56,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 02:50:56,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 02:50:56,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 02:50:56,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 02:50:56,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 02:50:56,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 02:50:56,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 02:50:56,137 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 [2023-08-24 02:50:56,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 02:50:56,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 02:50:56,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 02:50:56,414 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 02:50:56,418 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 02:50:56,418 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 02:50:57,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 02:50:57,639 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 02:50:57,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2023-08-24 02:50:57,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93fa5cb53/c3abb2f761f84f18b2f61c09f3a03f91/FLAGb6a267153 [2023-08-24 02:50:57,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93fa5cb53/c3abb2f761f84f18b2f61c09f3a03f91 [2023-08-24 02:50:57,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 02:50:57,670 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 02:50:57,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 02:50:57,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 02:50:57,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 02:50:57,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 02:50:57" (1/1) ... [2023-08-24 02:50:57,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c3722b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:50:57, skipping insertion in model container [2023-08-24 02:50:57,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 02:50:57" (1/1) ... [2023-08-24 02:50:57,697 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 02:50:57,866 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 02:50:57,869 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 02:50:57,877 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 02:50:57,904 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 02:50:57,910 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 02:50:57,916 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 02:50:57,916 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 02:50:57,920 INFO L206 MainTranslator]: Completed translation [2023-08-24 02:50:57,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:50:57 WrapperNode [2023-08-24 02:50:57,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 02:50:57,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 02:50:57,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 02:50:57,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 02:50:57,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:50:57" (1/1) ... [2023-08-24 02:50:57,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:50:57" (1/1) ... [2023-08-24 02:50:57,967 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 198 [2023-08-24 02:50:57,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 02:50:57,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 02:50:57,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 02:50:57,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 02:50:57,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:50:57" (1/1) ... [2023-08-24 02:50:57,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:50:57" (1/1) ... [2023-08-24 02:50:57,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:50:57" (1/1) ... [2023-08-24 02:50:57,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:50:57" (1/1) ... [2023-08-24 02:50:57,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:50:57" (1/1) ... [2023-08-24 02:50:57,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:50:57" (1/1) ... [2023-08-24 02:50:57,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:50:57" (1/1) ... [2023-08-24 02:50:57,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:50:57" (1/1) ... [2023-08-24 02:50:58,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 02:50:58,005 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 02:50:58,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 02:50:58,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 02:50:58,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:50:57" (1/1) ... [2023-08-24 02:50:58,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 02:50:58,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:50:58,033 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 02:50:58,070 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 02:50:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 02:50:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 02:50:58,080 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 02:50:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 02:50:58,080 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 02:50:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 02:50:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 02:50:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 02:50:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 02:50:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 02:50:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 02:50:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 02:50:58,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 02:50:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 02:50:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 02:50:58,083 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 02:50:58,165 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 02:50:58,167 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 02:50:58,382 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 02:50:58,458 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 02:50:58,458 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-24 02:50:58,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 02:50:58 BoogieIcfgContainer [2023-08-24 02:50:58,460 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 02:50:58,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 02:50:58,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 02:50:58,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 02:50:58,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 02:50:57" (1/3) ... [2023-08-24 02:50:58,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77932519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 02:50:58, skipping insertion in model container [2023-08-24 02:50:58,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:50:57" (2/3) ... [2023-08-24 02:50:58,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77932519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 02:50:58, skipping insertion in model container [2023-08-24 02:50:58,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 02:50:58" (3/3) ... [2023-08-24 02:50:58,469 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2023-08-24 02:50:58,481 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 02:50:58,482 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 02:50:58,482 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 02:50:58,537 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-24 02:50:58,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 180 transitions, 376 flow [2023-08-24 02:50:58,665 INFO L124 PetriNetUnfolderBase]: 15/178 cut-off events. [2023-08-24 02:50:58,665 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 02:50:58,669 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 02:50:58,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 180 transitions, 376 flow [2023-08-24 02:50:58,674 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 170 transitions, 352 flow [2023-08-24 02:50:58,677 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 02:50:58,685 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 170 transitions, 352 flow [2023-08-24 02:50:58,686 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 170 transitions, 352 flow [2023-08-24 02:50:58,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 170 transitions, 352 flow [2023-08-24 02:50:58,719 INFO L124 PetriNetUnfolderBase]: 15/170 cut-off events. [2023-08-24 02:50:58,720 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 02:50:58,721 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 02:50:58,722 INFO L119 LiptonReduction]: Number of co-enabled transitions 690 [2023-08-24 02:51:03,774 INFO L134 LiptonReduction]: Checked pairs total: 1213 [2023-08-24 02:51:03,774 INFO L136 LiptonReduction]: Total number of compositions: 176 [2023-08-24 02:51:03,784 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 02:51:03,787 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;@5318ede, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 02:51:03,787 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-24 02:51:03,798 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 02:51:03,800 INFO L124 PetriNetUnfolderBase]: 5/22 cut-off events. [2023-08-24 02:51:03,800 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 02:51:03,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:51:03,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:51:03,801 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 02:51:03,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:51:03,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2006983299, now seen corresponding path program 1 times [2023-08-24 02:51:03,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:51:03,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511211596] [2023-08-24 02:51:03,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:51:03,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:51:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:51:04,130 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 02:51:04,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:51:04,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511211596] [2023-08-24 02:51:04,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511211596] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 02:51:04,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 02:51:04,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 02:51:04,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336386864] [2023-08-24 02:51:04,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:51:04,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 02:51:04,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:51:04,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 02:51:04,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 02:51:04,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 356 [2023-08-24 02:51:04,162 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 02:51:04,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:51:04,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 356 [2023-08-24 02:51:04,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:51:04,236 INFO L124 PetriNetUnfolderBase]: 157/260 cut-off events. [2023-08-24 02:51:04,236 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-24 02:51:04,236 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 02:51:04,239 INFO L140 encePairwiseOnDemand]: 351/356 looper letters, 31 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2023-08-24 02:51:04,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 35 transitions, 155 flow [2023-08-24 02:51:04,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 02:51:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 02:51:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 640 transitions. [2023-08-24 02:51:04,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.449438202247191 [2023-08-24 02:51:04,257 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 640 transitions. [2023-08-24 02:51:04,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 640 transitions. [2023-08-24 02:51:04,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:51:04,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 640 transitions. [2023-08-24 02:51:04,266 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 02:51:04,270 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 02:51:04,271 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 02:51:04,272 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 58 flow. Second operand 4 states and 640 transitions. [2023-08-24 02:51:04,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 35 transitions, 155 flow [2023-08-24 02:51:04,274 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 02:51:04,276 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 71 flow [2023-08-24 02:51:04,277 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 02:51:04,280 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2023-08-24 02:51:04,281 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 71 flow [2023-08-24 02:51:04,281 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 02:51:04,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:51:04,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:51:04,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 02:51:04,282 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 02:51:04,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:51:04,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1822843996, now seen corresponding path program 1 times [2023-08-24 02:51:04,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:51:04,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359633210] [2023-08-24 02:51:04,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:51:04,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:51:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:51:04,415 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 02:51:04,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:51:04,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359633210] [2023-08-24 02:51:04,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359633210] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 02:51:04,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 02:51:04,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 02:51:04,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133714691] [2023-08-24 02:51:04,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:51:04,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 02:51:04,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:51:04,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 02:51:04,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 02:51:04,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 356 [2023-08-24 02:51:04,418 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 02:51:04,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:51:04,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 356 [2023-08-24 02:51:04,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:51:04,477 INFO L124 PetriNetUnfolderBase]: 157/261 cut-off events. [2023-08-24 02:51:04,477 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-24 02:51:04,478 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 02:51:04,479 INFO L140 encePairwiseOnDemand]: 350/356 looper letters, 31 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2023-08-24 02:51:04,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 36 transitions, 166 flow [2023-08-24 02:51:04,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 02:51:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 02:51:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 545 transitions. [2023-08-24 02:51:04,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3827247191011236 [2023-08-24 02:51:04,481 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 545 transitions. [2023-08-24 02:51:04,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 545 transitions. [2023-08-24 02:51:04,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:51:04,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 545 transitions. [2023-08-24 02:51:04,482 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 02:51:04,484 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 02:51:04,484 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 02:51:04,484 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 71 flow. Second operand 4 states and 545 transitions. [2023-08-24 02:51:04,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 36 transitions, 166 flow [2023-08-24 02:51:04,485 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 02:51:04,486 INFO L231 Difference]: Finished difference. Result has 27 places, 26 transitions, 84 flow [2023-08-24 02:51:04,486 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 02:51:04,486 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2023-08-24 02:51:04,486 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 26 transitions, 84 flow [2023-08-24 02:51:04,487 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 02:51:04,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:51:04,487 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 02:51:04,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 02:51:04,487 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 02:51:04,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:51:04,491 INFO L85 PathProgramCache]: Analyzing trace with hash 895958579, now seen corresponding path program 1 times [2023-08-24 02:51:04,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:51:04,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119413342] [2023-08-24 02:51:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:51:04,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:51:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:51:04,637 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 02:51:04,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:51:04,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119413342] [2023-08-24 02:51:04,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119413342] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 02:51:04,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 02:51:04,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 02:51:04,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232155039] [2023-08-24 02:51:04,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:51:04,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 02:51:04,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:51:04,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 02:51:04,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 02:51:04,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 356 [2023-08-24 02:51:04,641 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 02:51:04,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:51:04,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 356 [2023-08-24 02:51:04,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:51:04,725 INFO L124 PetriNetUnfolderBase]: 217/357 cut-off events. [2023-08-24 02:51:04,725 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-08-24 02:51:04,726 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 02:51:04,727 INFO L140 encePairwiseOnDemand]: 350/356 looper letters, 36 selfloop transitions, 13 changer transitions 0/49 dead transitions. [2023-08-24 02:51:04,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 49 transitions, 244 flow [2023-08-24 02:51:04,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 02:51:04,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 02:51:04,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 791 transitions. [2023-08-24 02:51:04,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4443820224719101 [2023-08-24 02:51:04,729 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 791 transitions. [2023-08-24 02:51:04,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 791 transitions. [2023-08-24 02:51:04,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:51:04,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 791 transitions. [2023-08-24 02:51:04,731 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 02:51:04,768 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 02:51:04,769 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 02:51:04,769 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 84 flow. Second operand 5 states and 791 transitions. [2023-08-24 02:51:04,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 49 transitions, 244 flow [2023-08-24 02:51:04,771 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 02:51:04,772 INFO L231 Difference]: Finished difference. Result has 32 places, 34 transitions, 154 flow [2023-08-24 02:51:04,772 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 02:51:04,773 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2023-08-24 02:51:04,775 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 34 transitions, 154 flow [2023-08-24 02:51:04,776 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 02:51:04,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:51:04,776 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 02:51:04,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 02:51:04,776 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 02:51:04,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:51:04,777 INFO L85 PathProgramCache]: Analyzing trace with hash -62373143, now seen corresponding path program 2 times [2023-08-24 02:51:04,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:51:04,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893125734] [2023-08-24 02:51:04,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:51:04,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:51:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:51:04,874 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 02:51:04,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:51:04,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893125734] [2023-08-24 02:51:04,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893125734] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 02:51:04,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 02:51:04,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 02:51:04,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813710534] [2023-08-24 02:51:04,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:51:04,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 02:51:04,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:51:04,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 02:51:04,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 02:51:04,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 356 [2023-08-24 02:51:04,877 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 02:51:04,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:51:04,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 356 [2023-08-24 02:51:04,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:51:04,940 INFO L124 PetriNetUnfolderBase]: 283/475 cut-off events. [2023-08-24 02:51:04,940 INFO L125 PetriNetUnfolderBase]: For 513/520 co-relation queries the response was YES. [2023-08-24 02:51:04,941 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 02:51:04,942 INFO L140 encePairwiseOnDemand]: 353/356 looper letters, 44 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-08-24 02:51:04,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 53 transitions, 347 flow [2023-08-24 02:51:04,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 02:51:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 02:51:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2023-08-24 02:51:04,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756554307116105 [2023-08-24 02:51:04,944 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2023-08-24 02:51:04,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2023-08-24 02:51:04,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:51:04,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2023-08-24 02:51:04,945 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 02:51:04,946 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 02:51:04,947 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 02:51:04,947 INFO L175 Difference]: Start difference. First operand has 32 places, 34 transitions, 154 flow. Second operand 3 states and 508 transitions. [2023-08-24 02:51:04,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 53 transitions, 347 flow [2023-08-24 02:51:04,950 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 02:51:04,951 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 166 flow [2023-08-24 02:51:04,951 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 02:51:04,952 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2023-08-24 02:51:04,952 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 35 transitions, 166 flow [2023-08-24 02:51:04,953 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 02:51:04,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:51:04,953 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 02:51:04,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 02:51:04,953 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 02:51:04,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:51:04,953 INFO L85 PathProgramCache]: Analyzing trace with hash 659062640, now seen corresponding path program 1 times [2023-08-24 02:51:04,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:51:04,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765339603] [2023-08-24 02:51:04,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:51:04,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:51:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:51:05,103 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 02:51:05,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:51:05,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765339603] [2023-08-24 02:51:05,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765339603] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 02:51:05,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 02:51:05,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 02:51:05,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828630876] [2023-08-24 02:51:05,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:51:05,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 02:51:05,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:51:05,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 02:51:05,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 02:51:05,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 356 [2023-08-24 02:51:05,106 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 02:51:05,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:51:05,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 356 [2023-08-24 02:51:05,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:51:05,193 INFO L124 PetriNetUnfolderBase]: 307/530 cut-off events. [2023-08-24 02:51:05,193 INFO L125 PetriNetUnfolderBase]: For 459/459 co-relation queries the response was YES. [2023-08-24 02:51:05,194 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 02:51:05,195 INFO L140 encePairwiseOnDemand]: 351/356 looper letters, 43 selfloop transitions, 2 changer transitions 15/60 dead transitions. [2023-08-24 02:51:05,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 382 flow [2023-08-24 02:51:05,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 02:51:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 02:51:05,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 773 transitions. [2023-08-24 02:51:05,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43426966292134833 [2023-08-24 02:51:05,197 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 773 transitions. [2023-08-24 02:51:05,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 773 transitions. [2023-08-24 02:51:05,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:51:05,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 773 transitions. [2023-08-24 02:51:05,200 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 02:51:05,202 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 02:51:05,202 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 02:51:05,202 INFO L175 Difference]: Start difference. First operand has 35 places, 35 transitions, 166 flow. Second operand 5 states and 773 transitions. [2023-08-24 02:51:05,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 382 flow [2023-08-24 02:51:05,205 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 02:51:05,207 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 184 flow [2023-08-24 02:51:05,207 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 02:51:05,209 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 16 predicate places. [2023-08-24 02:51:05,209 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 184 flow [2023-08-24 02:51:05,209 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 02:51:05,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:51:05,209 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 02:51:05,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 02:51:05,209 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 02:51:05,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:51:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1648851834, now seen corresponding path program 1 times [2023-08-24 02:51:05,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:51:05,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953237667] [2023-08-24 02:51:05,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:51:05,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:51:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:51:05,296 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 02:51:05,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:51:05,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953237667] [2023-08-24 02:51:05,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953237667] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 02:51:05,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 02:51:05,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 02:51:05,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756419952] [2023-08-24 02:51:05,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:51:05,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 02:51:05,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:51:05,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 02:51:05,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 02:51:05,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 356 [2023-08-24 02:51:05,302 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 02:51:05,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:51:05,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 356 [2023-08-24 02:51:05,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:51:05,376 INFO L124 PetriNetUnfolderBase]: 281/502 cut-off events. [2023-08-24 02:51:05,377 INFO L125 PetriNetUnfolderBase]: For 967/983 co-relation queries the response was YES. [2023-08-24 02:51:05,377 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 02:51:05,379 INFO L140 encePairwiseOnDemand]: 351/356 looper letters, 30 selfloop transitions, 2 changer transitions 15/52 dead transitions. [2023-08-24 02:51:05,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 353 flow [2023-08-24 02:51:05,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 02:51:05,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 02:51:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2023-08-24 02:51:05,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39775280898876403 [2023-08-24 02:51:05,381 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2023-08-24 02:51:05,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2023-08-24 02:51:05,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:51:05,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2023-08-24 02:51:05,382 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 02:51:05,384 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 02:51:05,385 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 02:51:05,385 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 184 flow. Second operand 5 states and 708 transitions. [2023-08-24 02:51:05,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 353 flow [2023-08-24 02:51:05,388 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 02:51:05,389 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 192 flow [2023-08-24 02:51:05,389 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 02:51:05,390 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 18 predicate places. [2023-08-24 02:51:05,391 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 192 flow [2023-08-24 02:51:05,391 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 02:51:05,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:51:05,391 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 02:51:05,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 02:51:05,391 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 02:51:05,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:51:05,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2084622646, now seen corresponding path program 1 times [2023-08-24 02:51:05,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:51:05,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142515048] [2023-08-24 02:51:05,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:51:05,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:51:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:51:06,195 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 02:51:06,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:51:06,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142515048] [2023-08-24 02:51:06,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142515048] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:51:06,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122193305] [2023-08-24 02:51:06,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:51:06,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:51:06,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:51:06,198 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 02:51:06,241 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 02:51:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:51:06,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 64 conjunts are in the unsatisfiable core [2023-08-24 02:51:06,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:51:06,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:51:06,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:51:06,375 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-24 02:51:06,375 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 02:51:06,426 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 02:51:06,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:51:06,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:51:06,511 INFO L322 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-08-24 02:51:06,511 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 02:51:06,548 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 02:51:06,583 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 02:51:06,678 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 02:51:06,920 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 02:51:06,945 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 02:51:06,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:51:09,452 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (< c_~end~0 0) (let ((.cse1 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (or (not (= (mod c_~ok~0 256) 0)) (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 ((.cse0 (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 .cse0 c_~queue~0.base) .cse1) (select (select .cse0 |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 ((.cse5 (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 ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse2 (select .cse3 c_~queue~0.base)) (.cse4 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse2 .cse1) (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4))) (< (select .cse2 (+ (* c_~start~0 4) c_~queue~0.offset)) (+ (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4) 1)))))))))) is different from false [2023-08-24 02:51:09,587 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:51:09,587 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 02:51:09,594 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 02:51:09,620 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:51:09,620 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 02:51:09,641 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:51:09,643 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 02:51:09,663 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:51:09,664 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 02:51:10,020 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:51:10,021 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 02:51:10,037 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:51:10,037 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 02:51:10,090 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:51:10,090 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 02:51:10,128 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:51:10,129 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 02:51:10,168 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:51:10,168 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 02:51:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-24 02:51:12,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122193305] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:51:12,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:51:12,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 27 [2023-08-24 02:51:12,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981834427] [2023-08-24 02:51:12,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:51:12,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 02:51:12,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:51:12,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 02:51:12,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=609, Unknown=8, NotChecked=52, Total=812 [2023-08-24 02:51:12,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 356 [2023-08-24 02:51:12,063 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 02:51:12,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:51:12,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 356 [2023-08-24 02:51:12,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:51:12,543 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))))))))) (= c_~ok~0 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 02:51:13,217 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (mod c_~ok~0 256) 0))) (.cse6 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse8 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse9 (+ c_~v_old~0 1)) (.cse0 (<= c_~n~0 c_~end~0)) (.cse1 (< c_~end~0 0))) (and (or .cse0 .cse1 (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (and (or .cse2 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_147 (Array Int Int))) (let ((.cse4 (+ (* ~i~0 4) ~A~0.offset))) (or (< c_~last~0 (select .cse3 .cse4)) (not (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse5 c_~A~0.base) .cse4) (select (select .cse5 c_~queue~0.base) .cse6)))))))) (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse11 (+ (* ~i~0 4) ~A~0.offset))) (or (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse7 (select .cse10 c_~queue~0.base))) (or (< (select .cse7 .cse8) .cse9) (not (= (select (select .cse10 c_~A~0.base) .cse11) (select .cse7 .cse6))))))) (< c_~last~0 (select .cse3 .cse11)))))))) (or (let ((.cse13 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or .cse2 (forall ((v_ArrVal_147 (Array Int Int))) (not (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse12 c_~queue~0.base) .cse6) (select (select .cse12 c_~A~0.base) .cse13)))))) (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 ((.cse14 (select .cse15 c_~queue~0.base))) (or (not (= (select .cse14 .cse6) (select (select .cse15 c_~A~0.base) .cse13))) (< (select .cse14 .cse8) .cse9))))))) .cse0 .cse1 (< c_~last~0 |c_thread1Thread1of1ForFork1_#t~mem1#1|)))) is different from false [2023-08-24 02:51:13,615 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (mod c_~ok~0 256) 0))) (.cse6 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse8 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse9 (+ c_~v_old~0 1)) (.cse0 (<= c_~n~0 c_~end~0)) (.cse1 (< c_~end~0 0))) (and (or .cse0 .cse1 (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (and (or .cse2 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_147 (Array Int Int))) (let ((.cse4 (+ (* ~i~0 4) ~A~0.offset))) (or (< c_~last~0 (select .cse3 .cse4)) (not (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse5 c_~A~0.base) .cse4) (select (select .cse5 c_~queue~0.base) .cse6)))))))) (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse11 (+ (* ~i~0 4) ~A~0.offset))) (or (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse7 (select .cse10 c_~queue~0.base))) (or (< (select .cse7 .cse8) .cse9) (not (= (select (select .cse10 c_~A~0.base) .cse11) (select .cse7 .cse6))))))) (< c_~last~0 (select .cse3 .cse11)))))))) (= c_~ok~0 1) (or (let ((.cse13 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or .cse2 (forall ((v_ArrVal_147 (Array Int Int))) (not (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse12 c_~queue~0.base) .cse6) (select (select .cse12 c_~A~0.base) .cse13)))))) (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 ((.cse14 (select .cse15 c_~queue~0.base))) (or (not (= (select .cse14 .cse6) (select (select .cse15 c_~A~0.base) .cse13))) (< (select .cse14 .cse8) .cse9))))))) .cse0 .cse1 (< c_~last~0 |c_thread1Thread1of1ForFork1_#t~mem1#1|)))) is different from false [2023-08-24 02:51:16,889 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse3 (+ (* c_~end~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 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse16 (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 .cse16 (= c_~start~0 c_~end~0)) (or .cse16 .cse4) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))))) is different from false [2023-08-24 02:51:18,493 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (mod c_~ok~0 256) 0))) (.cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse1 (+ c_~v_old~0 1))) (and (or (and (< (select (select |c_#memory_int| c_~queue~0.base) .cse0) .cse1) .cse2) (= (mod |c_thread2Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (let ((.cse4 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse5 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or .cse2 (forall ((v_ArrVal_147 (Array Int Int))) (not (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse3 c_~queue~0.base) .cse4) (select (select .cse3 c_~A~0.base) .cse5)))))) (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse6 (select .cse7 c_~queue~0.base))) (or (not (= (select .cse6 .cse4) (select (select .cse7 c_~A~0.base) .cse5))) (< (select .cse6 .cse0) .cse1))))))) (<= c_~n~0 c_~end~0) (< c_~end~0 0) (< c_~last~0 |c_thread1Thread1of1ForFork1_#t~mem1#1|)))) is different from false [2023-08-24 02:51:18,712 INFO L124 PetriNetUnfolderBase]: 1865/3116 cut-off events. [2023-08-24 02:51:18,712 INFO L125 PetriNetUnfolderBase]: For 3324/3324 co-relation queries the response was YES. [2023-08-24 02:51:18,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10481 conditions, 3116 events. 1865/3116 cut-off events. For 3324/3324 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 17344 event pairs, 241 based on Foata normal form. 28/3144 useless extension candidates. Maximal degree in co-relation 10458. Up to 635 conditions per place. [2023-08-24 02:51:18,728 INFO L140 encePairwiseOnDemand]: 338/356 looper letters, 257 selfloop transitions, 109 changer transitions 56/422 dead transitions. [2023-08-24 02:51:18,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 422 transitions, 2912 flow [2023-08-24 02:51:18,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-08-24 02:51:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-08-24 02:51:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 4182 transitions. [2023-08-24 02:51:18,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24994023428161607 [2023-08-24 02:51:18,739 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 4182 transitions. [2023-08-24 02:51:18,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 4182 transitions. [2023-08-24 02:51:18,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:51:18,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 4182 transitions. [2023-08-24 02:51:18,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 88.97872340425532) internal successors, (4182), 47 states have internal predecessors, (4182), 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 02:51:18,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 356.0) internal successors, (17088), 48 states have internal predecessors, (17088), 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 02:51:18,766 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 356.0) internal successors, (17088), 48 states have internal predecessors, (17088), 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 02:51:18,766 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 192 flow. Second operand 47 states and 4182 transitions. [2023-08-24 02:51:18,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 422 transitions, 2912 flow [2023-08-24 02:51:18,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 422 transitions, 2878 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-24 02:51:18,777 INFO L231 Difference]: Finished difference. Result has 111 places, 154 transitions, 1272 flow [2023-08-24 02:51:18,778 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=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=1272, PETRI_PLACES=111, PETRI_TRANSITIONS=154} [2023-08-24 02:51:18,778 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 86 predicate places. [2023-08-24 02:51:18,778 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 154 transitions, 1272 flow [2023-08-24 02:51:18,779 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 02:51:18,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:51:18,779 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 02:51:18,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-24 02:51:18,987 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 02:51:18,988 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 02:51:18,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:51:18,989 INFO L85 PathProgramCache]: Analyzing trace with hash -404572162, now seen corresponding path program 2 times [2023-08-24 02:51:18,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:51:18,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092989159] [2023-08-24 02:51:18,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:51:18,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:51:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:51:19,690 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 02:51:19,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:51:19,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092989159] [2023-08-24 02:51:19,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092989159] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:51:19,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103337750] [2023-08-24 02:51:19,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 02:51:19,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:51:19,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:51:19,692 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 02:51:19,725 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 02:51:19,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 02:51:19,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:51:19,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-24 02:51:19,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:51:19,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:51:19,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:51:19,880 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-24 02:51:19,881 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 02:51:19,928 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 02:51:19,969 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 02:51:19,969 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 02:51:20,001 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 02:51:20,041 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 02:51:20,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:51:20,257 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-24 02:51:20,257 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 02:51:20,265 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 02:51:20,382 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 02:51:20,400 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 02:51:20,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:51:20,504 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 02:51:20,751 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (< c_~end~0 0) (and (not (= (mod c_~ok~0 256) 0)) (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 ((.cse0 (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 ((.cse1 (select (select .cse0 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= (select (select .cse0 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse1)) (forall ((v_ArrVal_193 (Array Int Int))) (< (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_193) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) (+ .cse1 1))))))))) is different from false [2023-08-24 02:51:20,874 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:51:20,874 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 02:51:20,897 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:51:20,897 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 02:51:20,964 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:51:20,964 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 02:51:20,984 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 638 treesize of output 542 [2023-08-24 02:51:21,020 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:51:21,021 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 02:51:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-24 02:51:24,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103337750] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:51:24,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:51:24,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-08-24 02:51:24,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436290302] [2023-08-24 02:51:24,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:51:24,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-24 02:51:24,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:51:24,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-24 02:51:24,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=599, Unknown=10, NotChecked=106, Total=870 [2023-08-24 02:51:24,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 356 [2023-08-24 02:51:24,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 154 transitions, 1272 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 02:51:24,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:51:24,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 356 [2023-08-24 02:51:24,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:51:25,539 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (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)))) (.cse5 (not (= (mod c_~ok~0 256) 0)))) (let ((.cse1 (<= c_~n~0 c_~end~0)) (.cse3 (< c_~end~0 0)) (.cse4 (and .cse0 .cse5)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)))) (and .cse0 (or .cse1 (not (= .cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) .cse3 .cse4 (< c_~last~0 |c_thread1Thread1of1ForFork1_#t~mem1#1|)) .cse5 (= c_~ok~0 1) (or .cse1 .cse3 .cse4 (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse6 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse2 .cse6)) (< c_~last~0 .cse6)))))))) is different from false [2023-08-24 02:51:25,564 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (<= c_~n~0 c_~end~0)) (.cse4 (< c_~end~0 0)) (.cse2 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse6 (not (= (mod c_~ok~0 256) 0)))) (and (<= (select .cse0 0) c_~v_old~0) (<= c_~start~0 0) (<= (+ c_~start~0 1) c_~end~0) (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse1 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= .cse1 c_~v_old~0) (= .cse1 (select .cse0 .cse2))))) (<= 0 c_~start~0) (<= (+ c_~queue~0.base 2) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse3 .cse4 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse5 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_90| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_90|) 0))))) (and (or .cse5 (and (= c_~start~0 c_~end~0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (or .cse5 .cse6)))) (< c_~start~0 c_~n~0) (= c_~ok~0 1) (= c_~queue~0.offset 0) (< 0 c_~N~0) (< c_~start~0 c_~end~0) (or .cse3 .cse4 (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) .cse2) (+ .cse8 1))) (not (= .cse8 (select (select .cse7 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)))))))) .cse6)))) is different from false [2023-08-24 02:51:27,735 INFO L124 PetriNetUnfolderBase]: 4262/7109 cut-off events. [2023-08-24 02:51:27,735 INFO L125 PetriNetUnfolderBase]: For 45105/45105 co-relation queries the response was YES. [2023-08-24 02:51:27,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38145 conditions, 7109 events. 4262/7109 cut-off events. For 45105/45105 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 46254 event pairs, 542 based on Foata normal form. 9/7118 useless extension candidates. Maximal degree in co-relation 37998. Up to 2614 conditions per place. [2023-08-24 02:51:27,791 INFO L140 encePairwiseOnDemand]: 336/356 looper letters, 477 selfloop transitions, 173 changer transitions 50/700 dead transitions. [2023-08-24 02:51:27,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 700 transitions, 7880 flow [2023-08-24 02:51:27,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-08-24 02:51:27,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-08-24 02:51:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 3449 transitions. [2023-08-24 02:51:27,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24220505617977528 [2023-08-24 02:51:27,800 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 3449 transitions. [2023-08-24 02:51:27,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 3449 transitions. [2023-08-24 02:51:27,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:51:27,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 3449 transitions. [2023-08-24 02:51:27,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 86.225) internal successors, (3449), 40 states have internal predecessors, (3449), 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 02:51:27,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 356.0) internal successors, (14596), 41 states have internal predecessors, (14596), 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 02:51:27,898 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 356.0) internal successors, (14596), 41 states have internal predecessors, (14596), 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 02:51:27,898 INFO L175 Difference]: Start difference. First operand has 111 places, 154 transitions, 1272 flow. Second operand 40 states and 3449 transitions. [2023-08-24 02:51:27,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 700 transitions, 7880 flow [2023-08-24 02:51:28,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 700 transitions, 7455 flow, removed 199 selfloop flow, removed 10 redundant places. [2023-08-24 02:51:28,034 INFO L231 Difference]: Finished difference. Result has 152 places, 291 transitions, 3036 flow [2023-08-24 02:51:28,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=3036, PETRI_PLACES=152, PETRI_TRANSITIONS=291} [2023-08-24 02:51:28,035 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 127 predicate places. [2023-08-24 02:51:28,035 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 291 transitions, 3036 flow [2023-08-24 02:51:28,036 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 02:51:28,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:51:28,036 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 02:51:28,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-24 02:51:28,317 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 02:51:28,317 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 02:51:28,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:51:28,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1623181886, now seen corresponding path program 3 times [2023-08-24 02:51:28,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:51:28,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064280858] [2023-08-24 02:51:28,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:51:28,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:51:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:51:29,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 02:51:29,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:51:29,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064280858] [2023-08-24 02:51:29,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064280858] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:51:29,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908079884] [2023-08-24 02:51:29,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 02:51:29,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:51:29,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:51:29,707 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 02:51:29,709 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 02:51:29,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 02:51:29,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:51:29,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-24 02:51:29,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:51:29,981 INFO L322 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-08-24 02:51:29,981 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 02:51:30,028 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 02:51:30,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:51:32,465 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:51:32,465 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 02:51:32,576 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 02:51:32,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908079884] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:51:32,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:51:32,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2023-08-24 02:51:32,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49979468] [2023-08-24 02:51:32,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:51:32,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 02:51:32,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:51:32,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 02:51:32,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2023-08-24 02:51:32,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 356 [2023-08-24 02:51:32,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 291 transitions, 3036 flow. Second operand has 29 states, 29 states have (on average 83.34482758620689) internal successors, (2417), 29 states have internal predecessors, (2417), 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 02:51:32,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:51:32,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 356 [2023-08-24 02:51:32,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:51:36,119 INFO L124 PetriNetUnfolderBase]: 6866/11297 cut-off events. [2023-08-24 02:51:36,120 INFO L125 PetriNetUnfolderBase]: For 109560/109560 co-relation queries the response was YES. [2023-08-24 02:51:36,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75616 conditions, 11297 events. 6866/11297 cut-off events. For 109560/109560 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 78354 event pairs, 151 based on Foata normal form. 2/11299 useless extension candidates. Maximal degree in co-relation 75477. Up to 5563 conditions per place. [2023-08-24 02:51:36,203 INFO L140 encePairwiseOnDemand]: 339/356 looper letters, 437 selfloop transitions, 481 changer transitions 9/927 dead transitions. [2023-08-24 02:51:36,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 927 transitions, 12119 flow [2023-08-24 02:51:36,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-08-24 02:51:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-08-24 02:51:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 3564 transitions. [2023-08-24 02:51:36,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2441764867086873 [2023-08-24 02:51:36,208 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 3564 transitions. [2023-08-24 02:51:36,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 3564 transitions. [2023-08-24 02:51:36,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:51:36,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 3564 transitions. [2023-08-24 02:51:36,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 86.92682926829268) internal successors, (3564), 41 states have internal predecessors, (3564), 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 02:51:36,224 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 02:51:36,225 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 02:51:36,225 INFO L175 Difference]: Start difference. First operand has 152 places, 291 transitions, 3036 flow. Second operand 41 states and 3564 transitions. [2023-08-24 02:51:36,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 927 transitions, 12119 flow [2023-08-24 02:51:36,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 927 transitions, 11488 flow, removed 305 selfloop flow, removed 9 redundant places. [2023-08-24 02:51:36,770 INFO L231 Difference]: Finished difference. Result has 201 places, 626 transitions, 8497 flow [2023-08-24 02:51:36,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=2797, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=8497, PETRI_PLACES=201, PETRI_TRANSITIONS=626} [2023-08-24 02:51:36,771 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 176 predicate places. [2023-08-24 02:51:36,771 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 626 transitions, 8497 flow [2023-08-24 02:51:36,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 83.34482758620689) internal successors, (2417), 29 states have internal predecessors, (2417), 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 02:51:36,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:51:36,772 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 02:51:36,779 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 02:51:36,979 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 02:51:36,979 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 02:51:36,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:51:36,980 INFO L85 PathProgramCache]: Analyzing trace with hash 339383985, now seen corresponding path program 4 times [2023-08-24 02:51:36,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:51:36,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94075941] [2023-08-24 02:51:36,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:51:36,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:51:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:51:37,128 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 02:51:37,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:51:37,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94075941] [2023-08-24 02:51:37,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94075941] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:51:37,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977917068] [2023-08-24 02:51:37,129 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 02:51:37,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:51:37,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:51:37,146 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 02:51:37,182 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 02:51:37,236 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 02:51:37,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:51:37,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 02:51:37,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:51:37,260 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 02:51:37,260 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:51:37,322 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 02:51:37,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977917068] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:51:37,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:51:37,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 9 [2023-08-24 02:51:37,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242598741] [2023-08-24 02:51:37,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:51:37,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 02:51:37,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:51:37,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 02:51:37,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2023-08-24 02:51:37,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 356 [2023-08-24 02:51:37,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 626 transitions, 8497 flow. Second operand has 10 states, 10 states have (on average 150.1) internal successors, (1501), 10 states have internal predecessors, (1501), 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 02:51:37,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:51:37,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 356 [2023-08-24 02:51:37,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:51:39,939 INFO L124 PetriNetUnfolderBase]: 8124/13862 cut-off events. [2023-08-24 02:51:39,940 INFO L125 PetriNetUnfolderBase]: For 223366/223366 co-relation queries the response was YES. [2023-08-24 02:51:40,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109806 conditions, 13862 events. 8124/13862 cut-off events. For 223366/223366 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 102018 event pairs, 778 based on Foata normal form. 717/14579 useless extension candidates. Maximal degree in co-relation 104615. Up to 7440 conditions per place. [2023-08-24 02:51:40,228 INFO L140 encePairwiseOnDemand]: 351/356 looper letters, 555 selfloop transitions, 197 changer transitions 86/838 dead transitions. [2023-08-24 02:51:40,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 838 transitions, 13534 flow [2023-08-24 02:51:40,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 02:51:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 02:51:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1090 transitions. [2023-08-24 02:51:40,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4373996789727127 [2023-08-24 02:51:40,236 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1090 transitions. [2023-08-24 02:51:40,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1090 transitions. [2023-08-24 02:51:40,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:51:40,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1090 transitions. [2023-08-24 02:51:40,240 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 02:51:40,244 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 02:51:40,245 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 02:51:40,245 INFO L175 Difference]: Start difference. First operand has 201 places, 626 transitions, 8497 flow. Second operand 7 states and 1090 transitions. [2023-08-24 02:51:40,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 838 transitions, 13534 flow [2023-08-24 02:51:42,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 838 transitions, 12427 flow, removed 525 selfloop flow, removed 9 redundant places. [2023-08-24 02:51:42,279 INFO L231 Difference]: Finished difference. Result has 200 places, 602 transitions, 8543 flow [2023-08-24 02:51:42,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=6610, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8543, PETRI_PLACES=200, PETRI_TRANSITIONS=602} [2023-08-24 02:51:42,280 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 175 predicate places. [2023-08-24 02:51:42,280 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 602 transitions, 8543 flow [2023-08-24 02:51:42,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 150.1) internal successors, (1501), 10 states have internal predecessors, (1501), 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 02:51:42,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:51:42,281 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, 1] [2023-08-24 02:51:42,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-24 02:51:42,486 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 02:51:42,486 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 02:51:42,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:51:42,487 INFO L85 PathProgramCache]: Analyzing trace with hash 8997073, now seen corresponding path program 1 times [2023-08-24 02:51:42,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:51:42,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840840588] [2023-08-24 02:51:42,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:51:42,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:51:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:51:42,568 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 02:51:42,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:51:42,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840840588] [2023-08-24 02:51:42,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840840588] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:51:42,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226907342] [2023-08-24 02:51:42,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:51:42,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:51:42,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:51:42,586 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 02:51:42,604 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 02:51:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:51:42,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 02:51:42,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:51:42,724 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 02:51:42,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:51:42,771 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 02:51:42,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226907342] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:51:42,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:51:42,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-08-24 02:51:42,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023510314] [2023-08-24 02:51:42,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:51:42,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 02:51:42,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:51:42,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 02:51:42,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2023-08-24 02:51:42,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 356 [2023-08-24 02:51:42,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 602 transitions, 8543 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 02:51:42,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:51:42,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 356 [2023-08-24 02:51:42,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:51:45,599 INFO L124 PetriNetUnfolderBase]: 7508/13710 cut-off events. [2023-08-24 02:51:45,600 INFO L125 PetriNetUnfolderBase]: For 182570/182570 co-relation queries the response was YES. [2023-08-24 02:51:45,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106651 conditions, 13710 events. 7508/13710 cut-off events. For 182570/182570 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 108306 event pairs, 1124 based on Foata normal form. 280/13990 useless extension candidates. Maximal degree in co-relation 106353. Up to 8505 conditions per place. [2023-08-24 02:51:45,821 INFO L140 encePairwiseOnDemand]: 348/356 looper letters, 628 selfloop transitions, 52 changer transitions 182/862 dead transitions. [2023-08-24 02:51:45,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 862 transitions, 13632 flow [2023-08-24 02:51:45,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 02:51:45,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 02:51:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1212 transitions. [2023-08-24 02:51:45,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782771535580524 [2023-08-24 02:51:45,824 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1212 transitions. [2023-08-24 02:51:45,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1212 transitions. [2023-08-24 02:51:45,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:51:45,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1212 transitions. [2023-08-24 02:51:45,825 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 02:51:45,827 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 02:51:45,827 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 02:51:45,827 INFO L175 Difference]: Start difference. First operand has 200 places, 602 transitions, 8543 flow. Second operand 9 states and 1212 transitions. [2023-08-24 02:51:45,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 862 transitions, 13632 flow [2023-08-24 02:51:47,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 862 transitions, 13375 flow, removed 123 selfloop flow, removed 2 redundant places. [2023-08-24 02:51:47,264 INFO L231 Difference]: Finished difference. Result has 206 places, 556 transitions, 7975 flow [2023-08-24 02:51:47,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=8064, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7975, PETRI_PLACES=206, PETRI_TRANSITIONS=556} [2023-08-24 02:51:47,265 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 181 predicate places. [2023-08-24 02:51:47,265 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 556 transitions, 7975 flow [2023-08-24 02:51:47,266 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 02:51:47,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:51:47,266 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 02:51:47,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-24 02:51:47,471 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 02:51:47,471 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 02:51:47,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:51:47,471 INFO L85 PathProgramCache]: Analyzing trace with hash -303441625, now seen corresponding path program 5 times [2023-08-24 02:51:47,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:51:47,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864798501] [2023-08-24 02:51:47,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:51:47,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:51:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:51:47,566 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 02:51:47,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:51:47,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864798501] [2023-08-24 02:51:47,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864798501] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:51:47,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785735945] [2023-08-24 02:51:47,566 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 02:51:47,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:51:47,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:51:47,567 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 02:51:47,597 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 02:51:47,674 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 02:51:47,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:51:47,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 02:51:47,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:51:47,755 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 02:51:47,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:51:47,825 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 02:51:47,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785735945] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:51:47,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:51:47,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-08-24 02:51:47,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530475106] [2023-08-24 02:51:47,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:51:47,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 02:51:47,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:51:47,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 02:51:47,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-08-24 02:51:47,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 356 [2023-08-24 02:51:47,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 556 transitions, 7975 flow. Second operand has 15 states, 15 states have (on average 130.4) internal successors, (1956), 15 states have internal predecessors, (1956), 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 02:51:47,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:51:47,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 356 [2023-08-24 02:51:47,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:51:50,897 INFO L124 PetriNetUnfolderBase]: 8840/15364 cut-off events. [2023-08-24 02:51:50,898 INFO L125 PetriNetUnfolderBase]: For 217083/217083 co-relation queries the response was YES. [2023-08-24 02:51:51,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123290 conditions, 15364 events. 8840/15364 cut-off events. For 217083/217083 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 117933 event pairs, 1238 based on Foata normal form. 203/15567 useless extension candidates. Maximal degree in co-relation 122963. Up to 7998 conditions per place. [2023-08-24 02:51:51,067 INFO L140 encePairwiseOnDemand]: 348/356 looper letters, 735 selfloop transitions, 224 changer transitions 15/974 dead transitions. [2023-08-24 02:51:51,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 974 transitions, 15966 flow [2023-08-24 02:51:51,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 02:51:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 02:51:51,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1338 transitions. [2023-08-24 02:51:51,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3758426966292135 [2023-08-24 02:51:51,069 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1338 transitions. [2023-08-24 02:51:51,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1338 transitions. [2023-08-24 02:51:51,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:51:51,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1338 transitions. [2023-08-24 02:51:51,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 133.8) internal successors, (1338), 10 states have internal predecessors, (1338), 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 02:51:51,073 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 02:51:51,073 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 02:51:51,073 INFO L175 Difference]: Start difference. First operand has 206 places, 556 transitions, 7975 flow. Second operand 10 states and 1338 transitions. [2023-08-24 02:51:51,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 974 transitions, 15966 flow [2023-08-24 02:51:52,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 974 transitions, 15721 flow, removed 113 selfloop flow, removed 8 redundant places. [2023-08-24 02:51:52,682 INFO L231 Difference]: Finished difference. Result has 200 places, 650 transitions, 10181 flow [2023-08-24 02:51:52,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=7836, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10181, PETRI_PLACES=200, PETRI_TRANSITIONS=650} [2023-08-24 02:51:52,683 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 175 predicate places. [2023-08-24 02:51:52,683 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 650 transitions, 10181 flow [2023-08-24 02:51:52,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 130.4) internal successors, (1956), 15 states have internal predecessors, (1956), 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 02:51:52,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:51:52,684 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 02:51:52,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-24 02:51:52,888 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 02:51:52,889 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 02:51:52,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:51:52,889 INFO L85 PathProgramCache]: Analyzing trace with hash 438767924, now seen corresponding path program 2 times [2023-08-24 02:51:52,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:51:52,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418804367] [2023-08-24 02:51:52,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:51:52,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:51:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:51:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:51:53,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:51:53,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418804367] [2023-08-24 02:51:53,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418804367] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:51:53,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955219854] [2023-08-24 02:51:53,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 02:51:53,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:51:53,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:51:53,719 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 02:51:53,720 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 02:51:53,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 02:51:53,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:51:53,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-24 02:51:53,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:51:54,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:51:54,181 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-24 02:51:54,181 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 02:51:54,190 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 02:51:54,283 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 02:51:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 02:51:54,302 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:51:54,555 INFO L322 Elim1Store]: treesize reduction 19, result has 59.6 percent of original size [2023-08-24 02:51:54,556 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 73 treesize of output 68 [2023-08-24 02:51:54,561 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 33 treesize of output 27 [2023-08-24 02:51:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 02:51:54,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955219854] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:51:54,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:51:54,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-08-24 02:51:54,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421847923] [2023-08-24 02:51:54,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:51:54,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 02:51:54,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:51:54,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 02:51:54,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=654, Unknown=4, NotChecked=0, Total=812 [2023-08-24 02:51:54,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 356 [2023-08-24 02:51:54,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 650 transitions, 10181 flow. Second operand has 29 states, 29 states have (on average 81.51724137931035) internal successors, (2364), 29 states have internal predecessors, (2364), 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 02:51:54,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:51:54,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 356 [2023-08-24 02:51:54,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:52:01,251 INFO L124 PetriNetUnfolderBase]: 10718/18619 cut-off events. [2023-08-24 02:52:01,251 INFO L125 PetriNetUnfolderBase]: For 295745/295745 co-relation queries the response was YES. [2023-08-24 02:52:01,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155259 conditions, 18619 events. 10718/18619 cut-off events. For 295745/295745 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 145969 event pairs, 1055 based on Foata normal form. 93/18712 useless extension candidates. Maximal degree in co-relation 155111. Up to 9872 conditions per place. [2023-08-24 02:52:01,496 INFO L140 encePairwiseOnDemand]: 342/356 looper letters, 826 selfloop transitions, 471 changer transitions 129/1426 dead transitions. [2023-08-24 02:52:01,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 1426 transitions, 27157 flow [2023-08-24 02:52:01,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-24 02:52:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-24 02:52:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2633 transitions. [2023-08-24 02:52:01,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24653558052434457 [2023-08-24 02:52:01,500 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2633 transitions. [2023-08-24 02:52:01,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2633 transitions. [2023-08-24 02:52:01,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:52:01,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2633 transitions. [2023-08-24 02:52:01,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 87.76666666666667) internal successors, (2633), 30 states have internal predecessors, (2633), 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 02:52:01,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 356.0) internal successors, (11036), 31 states have internal predecessors, (11036), 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 02:52:01,534 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 356.0) internal successors, (11036), 31 states have internal predecessors, (11036), 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 02:52:01,535 INFO L175 Difference]: Start difference. First operand has 200 places, 650 transitions, 10181 flow. Second operand 30 states and 2633 transitions. [2023-08-24 02:52:01,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 1426 transitions, 27157 flow [2023-08-24 02:52:03,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 1426 transitions, 26224 flow, removed 371 selfloop flow, removed 8 redundant places. [2023-08-24 02:52:03,377 INFO L231 Difference]: Finished difference. Result has 233 places, 761 transitions, 13563 flow [2023-08-24 02:52:03,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=9462, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=13563, PETRI_PLACES=233, PETRI_TRANSITIONS=761} [2023-08-24 02:52:03,378 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 208 predicate places. [2023-08-24 02:52:03,378 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 761 transitions, 13563 flow [2023-08-24 02:52:03,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 81.51724137931035) internal successors, (2364), 29 states have internal predecessors, (2364), 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 02:52:03,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:52:03,379 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 02:52:03,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-24 02:52:03,584 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 02:52:03,584 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 02:52:03,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:52:03,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1921694670, now seen corresponding path program 6 times [2023-08-24 02:52:03,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:52:03,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281268340] [2023-08-24 02:52:03,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:52:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:52:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:52:04,706 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 02:52:04,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:52:04,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281268340] [2023-08-24 02:52:04,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281268340] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:52:04,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361187559] [2023-08-24 02:52:04,707 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 02:52:04,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:52:04,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:52:04,708 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 02:52:04,710 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 02:52:04,885 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-24 02:52:04,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:52:04,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-24 02:52:04,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:52:05,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:52:05,132 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-24 02:52:05,133 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 02:52:05,138 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 02:52:05,227 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 02:52:05,246 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 02:52:05,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:52:05,353 WARN L839 $PredicateComparison]: unable to prove that (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_451 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_451) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) (+ c_~v_old~0 1)))) is different from false [2023-08-24 02:52:05,429 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:52:05,430 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 02:52:05,435 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 02:52:05,590 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 02:52:05,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361187559] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:52:05,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:52:05,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 8] total 32 [2023-08-24 02:52:05,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254414732] [2023-08-24 02:52:05,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:52:05,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-24 02:52:05,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:52:05,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-24 02:52:05,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=870, Unknown=1, NotChecked=62, Total=1122 [2023-08-24 02:52:05,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 356 [2023-08-24 02:52:05,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 761 transitions, 13563 flow. Second operand has 34 states, 34 states have (on average 87.11764705882354) internal successors, (2962), 34 states have internal predecessors, (2962), 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 02:52:05,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:52:05,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 356 [2023-08-24 02:52:05,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:52:11,901 INFO L124 PetriNetUnfolderBase]: 12867/22274 cut-off events. [2023-08-24 02:52:11,901 INFO L125 PetriNetUnfolderBase]: For 386269/386269 co-relation queries the response was YES. [2023-08-24 02:52:12,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193209 conditions, 22274 events. 12867/22274 cut-off events. For 386269/386269 co-relation queries the response was YES. Maximal size of possible extension queue 1067. Compared 178955 event pairs, 1548 based on Foata normal form. 9/22283 useless extension candidates. Maximal degree in co-relation 193064. Up to 11959 conditions per place. [2023-08-24 02:52:12,125 INFO L140 encePairwiseOnDemand]: 341/356 looper letters, 681 selfloop transitions, 418 changer transitions 51/1150 dead transitions. [2023-08-24 02:52:12,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 1150 transitions, 22992 flow [2023-08-24 02:52:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-24 02:52:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-24 02:52:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2014 transitions. [2023-08-24 02:52:12,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25715015321756896 [2023-08-24 02:52:12,128 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2014 transitions. [2023-08-24 02:52:12,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2014 transitions. [2023-08-24 02:52:12,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:52:12,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2014 transitions. [2023-08-24 02:52:12,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 91.54545454545455) internal successors, (2014), 22 states have internal predecessors, (2014), 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 02:52:12,133 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 02:52:12,134 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 02:52:12,134 INFO L175 Difference]: Start difference. First operand has 233 places, 761 transitions, 13563 flow. Second operand 22 states and 2014 transitions. [2023-08-24 02:52:12,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 1150 transitions, 22992 flow [2023-08-24 02:52:15,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 1150 transitions, 22590 flow, removed 150 selfloop flow, removed 15 redundant places. [2023-08-24 02:52:15,429 INFO L231 Difference]: Finished difference. Result has 236 places, 849 transitions, 15954 flow [2023-08-24 02:52:15,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=13239, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=761, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=333, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=15954, PETRI_PLACES=236, PETRI_TRANSITIONS=849} [2023-08-24 02:52:15,430 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 211 predicate places. [2023-08-24 02:52:15,430 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 849 transitions, 15954 flow [2023-08-24 02:52:15,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 87.11764705882354) internal successors, (2962), 34 states have internal predecessors, (2962), 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 02:52:15,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:52:15,430 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 02:52:15,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-24 02:52:15,635 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 02:52:15,635 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 02:52:15,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:52:15,636 INFO L85 PathProgramCache]: Analyzing trace with hash 493806636, now seen corresponding path program 7 times [2023-08-24 02:52:15,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:52:15,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54896294] [2023-08-24 02:52:15,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:52:15,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:52:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:52:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 02:52:16,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:52:16,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54896294] [2023-08-24 02:52:16,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54896294] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:52:16,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611995236] [2023-08-24 02:52:16,879 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 02:52:16,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:52:16,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:52:16,880 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 02:52:16,883 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 02:52:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:52:16,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 49 conjunts are in the unsatisfiable core [2023-08-24 02:52:16,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:52:17,107 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 02:52:17,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:52:17,135 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 02:52:17,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:52:17,212 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 02:52:17,339 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-08-24 02:52:17,339 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 02:52:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:52:17,369 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:52:21,677 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~end~0 4)) (.cse3 (+ c_~A~0.offset (* c_~i~0 4)))) (and (forall ((v_ArrVal_505 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_505))) (let ((.cse0 (select .cse2 ~queue~0.base))) (or (not (= (select .cse0 (+ .cse1 ~queue~0.offset)) (select (select .cse2 c_~A~0.base) .cse3))) (< (select .cse0 (+ (* c_~start~0 4) ~queue~0.offset)) (+ c_~v_old~0 1)))))) (or (forall ((v_ArrVal_505 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (not (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_505))) (= (select (select .cse4 ~queue~0.base) (+ .cse1 ~queue~0.offset)) (select (select .cse4 c_~A~0.base) .cse3))))) (not (= (mod c_~ok~0 256) 0))))) is different from false [2023-08-24 02:52:21,723 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (* c_~end~0 4))) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_505))) (let ((.cse2 (select .cse0 ~queue~0.base))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) (select .cse2 (+ .cse3 ~queue~0.offset)))) (< (select .cse2 (+ (* 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)))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (not (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_505))) (= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) (select (select .cse4 ~queue~0.base) (+ .cse3 ~queue~0.offset))))))))) is different from false [2023-08-24 02:52:21,731 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:52:21,732 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 56 treesize of output 45 [2023-08-24 02:52:21,741 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:52:21,742 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 1718 treesize of output 1482 [2023-08-24 02:52:21,756 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:52:21,756 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 358 treesize of output 327 [2023-08-24 02:52:21,767 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:52:21,767 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 310 treesize of output 231 [2023-08-24 02:52:21,921 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:52:21,921 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 02:52:21,931 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:52:21,932 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 1965 treesize of output 1903 [2023-08-24 02:52:21,977 INFO L322 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2023-08-24 02:52:21,978 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 02:52:22,013 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:52:22,014 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 570 treesize of output 544 [2023-08-24 02:52:22,043 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:52:22,044 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 515 treesize of output 423 [2023-08-24 02:52:27,286 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:52:27,287 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 35 treesize of output 25 [2023-08-24 02:52:27,303 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 02:52:27,304 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 24 treesize of output 16 [2023-08-24 02:52:27,317 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 02:52:27,320 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 22 treesize of output 1 [2023-08-24 02:52:27,328 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-08-24 02:52:27,336 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 25 treesize of output 13 [2023-08-24 02:52:27,350 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:52:27,351 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 26 [2023-08-24 02:52:27,364 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 25 treesize of output 13 [2023-08-24 02:52:27,373 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:52:27,373 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 41 treesize of output 31 [2023-08-24 02:52:27,393 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 02:52:27,393 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 28 treesize of output 1 [2023-08-24 02:52:27,401 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-24 02:52:27,419 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-24 02:52:27,423 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-24 02:52:27,429 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-24 02:52:27,449 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 02:52:27,465 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 02:52:27,492 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 02:52:27,492 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 1 [2023-08-24 02:52:27,501 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-24 02:52:27,502 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 26 treesize of output 17 [2023-08-24 02:52:27,519 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-24 02:52:27,520 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 35 treesize of output 20 [2023-08-24 02:52:27,531 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 02:52:27,532 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 41 treesize of output 1 [2023-08-24 02:52:27,545 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 02:52:27,545 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 22 treesize of output 1 [2023-08-24 02:52:27,556 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 02:52:27,556 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 28 treesize of output 1 [2023-08-24 02:52:28,301 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:52:28,301 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 74 treesize of output 66 [2023-08-24 02:52:28,314 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 02:52:28,415 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 02:52:28,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611995236] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:52:28,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:52:28,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 30 [2023-08-24 02:52:28,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202952702] [2023-08-24 02:52:28,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:52:28,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-24 02:52:28,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:52:28,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-24 02:52:28,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=725, Unknown=3, NotChecked=114, Total=992 [2023-08-24 02:52:28,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 356 [2023-08-24 02:52:28,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 849 transitions, 15954 flow. Second operand has 32 states, 32 states have (on average 88.96875) internal successors, (2847), 32 states have internal predecessors, (2847), 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 02:52:28,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:52:28,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 356 [2023-08-24 02:52:28,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:52:32,640 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 02:52:34,649 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 02:52:36,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:52:45,268 INFO L124 PetriNetUnfolderBase]: 15543/26878 cut-off events. [2023-08-24 02:52:45,268 INFO L125 PetriNetUnfolderBase]: For 512894/512894 co-relation queries the response was YES. [2023-08-24 02:52:45,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244684 conditions, 26878 events. 15543/26878 cut-off events. For 512894/512894 co-relation queries the response was YES. Maximal size of possible extension queue 1285. Compared 221700 event pairs, 1576 based on Foata normal form. 9/26887 useless extension candidates. Maximal degree in co-relation 244575. Up to 14422 conditions per place. [2023-08-24 02:52:45,549 INFO L140 encePairwiseOnDemand]: 343/356 looper letters, 832 selfloop transitions, 333 changer transitions 48/1213 dead transitions. [2023-08-24 02:52:45,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 1213 transitions, 25028 flow [2023-08-24 02:52:45,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-24 02:52:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-24 02:52:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1586 transitions. [2023-08-24 02:52:45,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26206212822207536 [2023-08-24 02:52:45,553 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1586 transitions. [2023-08-24 02:52:45,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1586 transitions. [2023-08-24 02:52:45,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:52:45,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1586 transitions. [2023-08-24 02:52:45,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 93.29411764705883) internal successors, (1586), 17 states have internal predecessors, (1586), 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 02:52:45,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 356.0) internal successors, (6408), 18 states have internal predecessors, (6408), 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 02:52:45,557 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 356.0) internal successors, (6408), 18 states have internal predecessors, (6408), 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 02:52:45,558 INFO L175 Difference]: Start difference. First operand has 236 places, 849 transitions, 15954 flow. Second operand 17 states and 1586 transitions. [2023-08-24 02:52:45,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 1213 transitions, 25028 flow [2023-08-24 02:52:50,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 1213 transitions, 24755 flow, removed 131 selfloop flow, removed 5 redundant places. [2023-08-24 02:52:50,186 INFO L231 Difference]: Finished difference. Result has 252 places, 969 transitions, 19407 flow [2023-08-24 02:52:50,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=15771, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=849, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=19407, PETRI_PLACES=252, PETRI_TRANSITIONS=969} [2023-08-24 02:52:50,187 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 227 predicate places. [2023-08-24 02:52:50,187 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 969 transitions, 19407 flow [2023-08-24 02:52:50,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 88.96875) internal successors, (2847), 32 states have internal predecessors, (2847), 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 02:52:50,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:52:50,188 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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 02:52:50,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-24 02:52:50,392 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 02:52:50,392 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 02:52:50,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:52:50,392 INFO L85 PathProgramCache]: Analyzing trace with hash 33029824, now seen corresponding path program 3 times [2023-08-24 02:52:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:52:50,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469520488] [2023-08-24 02:52:50,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:52:50,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:52:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:52:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 02:52:50,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:52:50,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469520488] [2023-08-24 02:52:50,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469520488] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 02:52:50,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 02:52:50,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 02:52:50,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152983431] [2023-08-24 02:52:50,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:52:50,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 02:52:50,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:52:50,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 02:52:50,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-24 02:52:50,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 356 [2023-08-24 02:52:50,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 969 transitions, 19407 flow. Second operand has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 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 02:52:50,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:52:50,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 356 [2023-08-24 02:52:50,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:52:56,822 INFO L124 PetriNetUnfolderBase]: 13666/23483 cut-off events. [2023-08-24 02:52:56,822 INFO L125 PetriNetUnfolderBase]: For 495876/495876 co-relation queries the response was YES. [2023-08-24 02:52:56,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219812 conditions, 23483 events. 13666/23483 cut-off events. For 495876/495876 co-relation queries the response was YES. Maximal size of possible extension queue 1160. Compared 187693 event pairs, 1635 based on Foata normal form. 30/23513 useless extension candidates. Maximal degree in co-relation 219697. Up to 22634 conditions per place. [2023-08-24 02:52:57,063 INFO L140 encePairwiseOnDemand]: 349/356 looper letters, 828 selfloop transitions, 80 changer transitions 0/908 dead transitions. [2023-08-24 02:52:57,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 908 transitions, 20003 flow [2023-08-24 02:52:57,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 02:52:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 02:52:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2023-08-24 02:52:57,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3553370786516854 [2023-08-24 02:52:57,064 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 759 transitions. [2023-08-24 02:52:57,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 759 transitions. [2023-08-24 02:52:57,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:52:57,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 759 transitions. [2023-08-24 02:52:57,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 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 02:52:57,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 356.0) internal successors, (2492), 7 states have internal predecessors, (2492), 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 02:52:57,066 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 356.0) internal successors, (2492), 7 states have internal predecessors, (2492), 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 02:52:57,066 INFO L175 Difference]: Start difference. First operand has 252 places, 969 transitions, 19407 flow. Second operand 6 states and 759 transitions. [2023-08-24 02:52:57,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 908 transitions, 20003 flow [2023-08-24 02:53:01,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 908 transitions, 19550 flow, removed 67 selfloop flow, removed 14 redundant places. [2023-08-24 02:53:01,351 INFO L231 Difference]: Finished difference. Result has 241 places, 869 transitions, 17377 flow [2023-08-24 02:53:01,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=17086, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=786, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=17377, PETRI_PLACES=241, PETRI_TRANSITIONS=869} [2023-08-24 02:53:01,352 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 216 predicate places. [2023-08-24 02:53:01,352 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 869 transitions, 17377 flow [2023-08-24 02:53:01,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 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 02:53:01,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:53:01,352 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 02:53:01,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-24 02:53:01,353 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 02:53:01,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:53:01,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1319285353, now seen corresponding path program 8 times [2023-08-24 02:53:01,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:53:01,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138143521] [2023-08-24 02:53:01,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:53:01,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:53:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:53:01,507 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 02:53:01,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:53:01,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138143521] [2023-08-24 02:53:01,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138143521] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:53:01,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431994900] [2023-08-24 02:53:01,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 02:53:01,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:53:01,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:53:01,509 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 02:53:01,543 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 02:53:01,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 02:53:01,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:53:01,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 02:53:01,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:53:01,682 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 02:53:01,682 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:53:01,739 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 02:53:01,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431994900] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:53:01,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:53:01,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-24 02:53:01,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311503298] [2023-08-24 02:53:01,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:53:01,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 02:53:01,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:53:01,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 02:53:01,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-08-24 02:53:01,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 356 [2023-08-24 02:53:01,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 869 transitions, 17377 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 02:53:01,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:53:01,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 356 [2023-08-24 02:53:01,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:53:06,021 INFO L124 PetriNetUnfolderBase]: 9359/16600 cut-off events. [2023-08-24 02:53:06,021 INFO L125 PetriNetUnfolderBase]: For 366868/366868 co-relation queries the response was YES. [2023-08-24 02:53:06,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156287 conditions, 16600 events. 9359/16600 cut-off events. For 366868/366868 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 133376 event pairs, 3242 based on Foata normal form. 441/17041 useless extension candidates. Maximal degree in co-relation 156065. Up to 12321 conditions per place. [2023-08-24 02:53:06,170 INFO L140 encePairwiseOnDemand]: 351/356 looper letters, 451 selfloop transitions, 3 changer transitions 350/804 dead transitions. [2023-08-24 02:53:06,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 804 transitions, 17588 flow [2023-08-24 02:53:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 02:53:06,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 02:53:06,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 967 transitions. [2023-08-24 02:53:06,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3880417335473515 [2023-08-24 02:53:06,173 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 967 transitions. [2023-08-24 02:53:06,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 967 transitions. [2023-08-24 02:53:06,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:53:06,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 967 transitions. [2023-08-24 02:53:06,174 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 02:53:06,175 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 02:53:06,175 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 02:53:06,175 INFO L175 Difference]: Start difference. First operand has 241 places, 869 transitions, 17377 flow. Second operand 7 states and 967 transitions. [2023-08-24 02:53:06,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 804 transitions, 17588 flow [2023-08-24 02:53:08,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 804 transitions, 17475 flow, removed 20 selfloop flow, removed 4 redundant places. [2023-08-24 02:53:08,335 INFO L231 Difference]: Finished difference. Result has 239 places, 454 transitions, 9008 flow [2023-08-24 02:53:08,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=14321, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=717, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9008, PETRI_PLACES=239, PETRI_TRANSITIONS=454} [2023-08-24 02:53:08,335 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 214 predicate places. [2023-08-24 02:53:08,335 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 454 transitions, 9008 flow [2023-08-24 02:53:08,336 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 02:53:08,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:53:08,336 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 02:53:08,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-08-24 02:53:08,540 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,SelfDestructingSolverStorable16 [2023-08-24 02:53:08,540 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 02:53:08,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:53:08,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2134167191, now seen corresponding path program 9 times [2023-08-24 02:53:08,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:53:08,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234717506] [2023-08-24 02:53:08,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:53:08,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:53:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:53:09,439 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 02:53:09,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:53:09,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234717506] [2023-08-24 02:53:09,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234717506] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:53:09,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015046994] [2023-08-24 02:53:09,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 02:53:09,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:53:09,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:53:09,440 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:53:09,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-24 02:53:09,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 02:53:09,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:53:09,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 80 conjunts are in the unsatisfiable core [2023-08-24 02:53:09,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:53:09,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:53:09,858 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 02:53:09,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:53:09,913 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 02:53:10,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:53:10,537 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 02:53:10,566 INFO L322 Elim1Store]: treesize reduction 48, result has 46.1 percent of original size [2023-08-24 02:53:10,566 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 66 treesize of output 56 [2023-08-24 02:53:10,703 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 02:53:10,703 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:53:13,767 INFO L322 Elim1Store]: treesize reduction 155, result has 87.0 percent of original size [2023-08-24 02:53:13,768 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 8739 treesize of output 8451 [2023-08-24 02:53:14,178 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:53:14,179 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 2585 treesize of output 2520 [2023-08-24 02:53:14,592 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:53:14,593 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 2337 treesize of output 2336 [2023-08-24 02:53:14,889 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:53:14,889 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 1983 treesize of output 1834 [2023-08-24 02:53:15,192 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:53:15,192 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 case distinctions, treesize of input 1759 treesize of output 1648 Received shutdown request... [2023-08-24 03:05:10,906 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-24 03:05:10,908 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-24 03:05:10,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-24 03:05:10,949 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 03:05:10,950 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 03:05:11,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-24 03:05:11,113 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 65ms.. [2023-08-24 03:05:11,115 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-24 03:05:11,115 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-24 03:05:11,115 INFO L445 BasicCegarLoop]: Path program histogram: [9, 3, 2, 1, 1, 1, 1] [2023-08-24 03:05:11,137 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 03:05:11,137 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 03:05:11,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 03:05:11 BasicIcfg [2023-08-24 03:05:11,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 03:05:11,139 INFO L158 Benchmark]: Toolchain (without parser) took 853469.09ms. Allocated memory was 341.8MB in the beginning and 8.4GB in the end (delta: 8.0GB). Free memory was 317.7MB in the beginning and 2.9GB in the end (delta: -2.5GB). Peak memory consumption was 7.5GB. Max. memory is 16.0GB. [2023-08-24 03:05:11,139 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 341.8MB. Free memory is still 318.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 03:05:11,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.35ms. Allocated memory is still 341.8MB. Free memory was 317.7MB in the beginning and 305.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 03:05:11,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.93ms. Allocated memory is still 341.8MB. Free memory was 305.7MB in the beginning and 303.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 03:05:11,140 INFO L158 Benchmark]: Boogie Preprocessor took 36.49ms. Allocated memory is still 341.8MB. Free memory was 303.7MB in the beginning and 301.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 03:05:11,140 INFO L158 Benchmark]: RCFGBuilder took 454.82ms. Allocated memory is still 341.8MB. Free memory was 301.6MB in the beginning and 276.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-24 03:05:11,140 INFO L158 Benchmark]: TraceAbstraction took 852674.27ms. Allocated memory was 341.8MB in the beginning and 8.4GB in the end (delta: 8.0GB). Free memory was 276.1MB in the beginning and 2.9GB in the end (delta: -2.6GB). Peak memory consumption was 7.4GB. Max. memory is 16.0GB. [2023-08-24 03:05:11,147 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 341.8MB. Free memory is still 318.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 250.35ms. Allocated memory is still 341.8MB. Free memory was 317.7MB in the beginning and 305.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 45.93ms. Allocated memory is still 341.8MB. Free memory was 305.7MB in the beginning and 303.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.49ms. Allocated memory is still 341.8MB. Free memory was 303.7MB in the beginning and 301.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 454.82ms. Allocated memory is still 341.8MB. Free memory was 301.6MB in the beginning and 276.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 852674.27ms. Allocated memory was 341.8MB in the beginning and 8.4GB in the end (delta: 8.0GB). Free memory was 276.1MB in the beginning and 2.9GB in the end (delta: -2.6GB). Peak memory consumption was 7.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 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 65ms.. - 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 65ms.. - 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 65ms.. - 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: 852.6s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 87.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 205 mSolverCounterUnknown, 2095 SdHoareTripleChecker+Valid, 11.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2095 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 10.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2107 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6676 IncrementalHoareTripleChecker+Invalid, 9220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 9 mSDtfsCounter, 6676 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 752 GetRequests, 350 SyntacticMatches, 12 SemanticMatches, 390 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 4111 ImplicationChecksByTransitivity, 25.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19407occurred in iteration=15, InterpolantAutomatonStates: 262, 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.0s SatisfiabilityAnalysisTime, 33.3s InterpolantComputationTime, 616 NumberOfCodeBlocks, 616 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 822 ConstructedInterpolants, 62 QuantifiedInterpolants, 12389 SizeOfPredicates, 170 NumberOfNonLiveVariables, 2649 ConjunctsInSsa, 315 ConjunctsInUnsatCore, 37 InterpolantComputations, 7 PerfectInterpolantSequences, 157/277 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