/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_79-equ_racefree_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 15:24:37,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 15:24:37,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 15:24:37,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 15:24:37,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 15:24:37,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 15:24:37,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 15:24:37,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 15:24:37,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 15:24:37,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 15:24:37,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 15:24:37,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 15:24:37,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 15:24:37,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 15:24:37,584 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 15:24:37,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 15:24:37,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 15:24:37,584 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 15:24:37,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 15:24:37,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 15:24:37,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 15:24:37,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 15:24:37,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 15:24:37,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 15:24:37,586 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 15:24:37,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 15:24:37,586 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 15:24:37,587 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 15:24:37,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 15:24:37,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 15:24:37,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 15:24:37,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 15:24:37,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 15:24:37,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 15:24:37,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 15:24:37,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 15:24:37,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 15:24:37,588 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 15:24:37,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 15:24:37,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 15:24:37,589 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 15:24:37,589 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> TOGETHER [2023-08-03 15:24:37,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 15:24:37,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 15:24:37,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 15:24:37,770 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 15:24:37,771 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 15:24:37,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_79-equ_racefree_bound2.i [2023-08-03 15:24:38,704 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 15:24:38,928 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 15:24:38,928 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_79-equ_racefree_bound2.i [2023-08-03 15:24:38,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e24da2b7c/731c5391d29d4fa4a1b64b1aff00e2bf/FLAGcdd1cc846 [2023-08-03 15:24:38,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e24da2b7c/731c5391d29d4fa4a1b64b1aff00e2bf [2023-08-03 15:24:38,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 15:24:38,957 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 15:24:38,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 15:24:38,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 15:24:38,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 15:24:38,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 03:24:38" (1/1) ... [2023-08-03 15:24:38,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5924c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:24:38, skipping insertion in model container [2023-08-03 15:24:38,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 03:24:38" (1/1) ... [2023-08-03 15:24:39,006 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 15:24:39,296 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_79-equ_racefree_bound2.i[47038,47051] [2023-08-03 15:24:39,312 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 15:24:39,320 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 15:24:39,330 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-03 15:24:39,338 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-03 15:24:39,349 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_79-equ_racefree_bound2.i[47038,47051] [2023-08-03 15:24:39,366 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 15:24:39,402 INFO L206 MainTranslator]: Completed translation [2023-08-03 15:24:39,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:24:39 WrapperNode [2023-08-03 15:24:39,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 15:24:39,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 15:24:39,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 15:24:39,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 15:24:39,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:24:39" (1/1) ... [2023-08-03 15:24:39,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:24:39" (1/1) ... [2023-08-03 15:24:39,446 INFO L138 Inliner]: procedures = 271, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 204 [2023-08-03 15:24:39,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 15:24:39,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 15:24:39,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 15:24:39,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 15:24:39,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:24:39" (1/1) ... [2023-08-03 15:24:39,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:24:39" (1/1) ... [2023-08-03 15:24:39,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:24:39" (1/1) ... [2023-08-03 15:24:39,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:24:39" (1/1) ... [2023-08-03 15:24:39,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:24:39" (1/1) ... [2023-08-03 15:24:39,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:24:39" (1/1) ... [2023-08-03 15:24:39,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:24:39" (1/1) ... [2023-08-03 15:24:39,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:24:39" (1/1) ... [2023-08-03 15:24:39,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 15:24:39,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 15:24:39,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 15:24:39,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 15:24:39,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:24:39" (1/1) ... [2023-08-03 15:24:39,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 15:24:39,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:24:39,501 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-03 15:24:39,516 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-03 15:24:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 15:24:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 15:24:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 15:24:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 15:24:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-03 15:24:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 15:24:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-03 15:24:39,526 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-03 15:24:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 15:24:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 15:24:39,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 15:24:39,527 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 15:24:39,651 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 15:24:39,653 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 15:24:39,880 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 15:24:39,885 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 15:24:39,885 INFO L302 CfgBuilder]: Removed 22 assume(true) statements. [2023-08-03 15:24:39,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 03:24:39 BoogieIcfgContainer [2023-08-03 15:24:39,887 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 15:24:39,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 15:24:39,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 15:24:39,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 15:24:39,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 03:24:38" (1/3) ... [2023-08-03 15:24:39,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71789aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 03:24:39, skipping insertion in model container [2023-08-03 15:24:39,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:24:39" (2/3) ... [2023-08-03 15:24:39,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71789aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 03:24:39, skipping insertion in model container [2023-08-03 15:24:39,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 03:24:39" (3/3) ... [2023-08-03 15:24:39,892 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_79-equ_racefree_bound2.i [2023-08-03 15:24:39,897 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 15:24:39,903 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 15:24:39,903 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 15:24:39,903 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 15:24:39,954 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-03 15:24:39,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 201 transitions, 410 flow [2023-08-03 15:24:40,058 INFO L124 PetriNetUnfolderBase]: 43/271 cut-off events. [2023-08-03 15:24:40,059 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-03 15:24:40,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 271 events. 43/271 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 823 event pairs, 0 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 132. Up to 8 conditions per place. [2023-08-03 15:24:40,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 201 transitions, 410 flow [2023-08-03 15:24:40,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 194 transitions, 393 flow [2023-08-03 15:24:40,069 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 15:24:40,075 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 194 transitions, 393 flow [2023-08-03 15:24:40,076 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 194 transitions, 393 flow [2023-08-03 15:24:40,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 194 transitions, 393 flow [2023-08-03 15:24:40,116 INFO L124 PetriNetUnfolderBase]: 41/264 cut-off events. [2023-08-03 15:24:40,117 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:24:40,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 264 events. 41/264 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 803 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 132. Up to 8 conditions per place. [2023-08-03 15:24:40,123 INFO L119 LiptonReduction]: Number of co-enabled transitions 8664 [2023-08-03 15:24:46,124 INFO L134 LiptonReduction]: Checked pairs total: 18412 [2023-08-03 15:24:46,125 INFO L136 LiptonReduction]: Total number of compositions: 166 [2023-08-03 15:24:46,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 15:24:46,138 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@1aae80e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 15:24:46,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 15:24:46,147 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 15:24:46,147 INFO L124 PetriNetUnfolderBase]: 7/29 cut-off events. [2023-08-03 15:24:46,147 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:24:46,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:24:46,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 15:24:46,148 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 15:24:46,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:24:46,152 INFO L85 PathProgramCache]: Analyzing trace with hash 733617857, now seen corresponding path program 1 times [2023-08-03 15:24:46,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:24:46,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857387731] [2023-08-03 15:24:46,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:24:46,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:24:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:24:46,412 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-03 15:24:46,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:24:46,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857387731] [2023-08-03 15:24:46,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857387731] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:24:46,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:24:46,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 15:24:46,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567734006] [2023-08-03 15:24:46,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:24:46,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 15:24:46,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:24:46,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 15:24:46,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 15:24:46,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 367 [2023-08-03 15:24:46,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 64 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 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-03 15:24:46,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:24:46,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 367 [2023-08-03 15:24:46,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:24:46,557 INFO L124 PetriNetUnfolderBase]: 274/651 cut-off events. [2023-08-03 15:24:46,557 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:24:46,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 651 events. 274/651 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3505 event pairs, 0 based on Foata normal form. 119/685 useless extension candidates. Maximal degree in co-relation 1175. Up to 529 conditions per place. [2023-08-03 15:24:46,563 INFO L140 encePairwiseOnDemand]: 342/367 looper letters, 49 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-03 15:24:46,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 59 transitions, 225 flow [2023-08-03 15:24:46,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:24:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:24:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2023-08-03 15:24:46,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5367847411444142 [2023-08-03 15:24:46,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 591 transitions. [2023-08-03 15:24:46,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions. [2023-08-03 15:24:46,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:24:46,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions. [2023-08-03 15:24:46,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 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-03 15:24:46,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 367.0) internal successors, (1468), 4 states have internal predecessors, (1468), 0 states have call successors, (0), 0 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-03 15:24:46,591 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 367.0) internal successors, (1468), 4 states have internal predecessors, (1468), 0 states have call successors, (0), 0 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-03 15:24:46,592 INFO L175 Difference]: Start difference. First operand has 44 places, 64 transitions, 133 flow. Second operand 3 states and 591 transitions. [2023-08-03 15:24:46,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 59 transitions, 225 flow [2023-08-03 15:24:46,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 225 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:24:46,596 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 97 flow [2023-08-03 15:24:46,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2023-08-03 15:24:46,600 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2023-08-03 15:24:46,600 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 97 flow [2023-08-03 15:24:46,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 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-03 15:24:46,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:24:46,600 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 15:24:46,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 15:24:46,601 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 15:24:46,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:24:46,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1260636167, now seen corresponding path program 1 times [2023-08-03 15:24:46,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:24:46,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806677776] [2023-08-03 15:24:46,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:24:46,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:24:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 15:24:46,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 15:24:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 15:24:46,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 15:24:46,657 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 15:24:46,658 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-08-03 15:24:46,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 15:24:46,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-03 15:24:46,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-03 15:24:46,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 15:24:46,660 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 15:24:46,662 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 15:24:46,662 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 15:24:46,685 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-03 15:24:46,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 260 transitions, 538 flow [2023-08-03 15:24:46,722 INFO L124 PetriNetUnfolderBase]: 72/424 cut-off events. [2023-08-03 15:24:46,722 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-03 15:24:46,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 72/424 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1596 event pairs, 0 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 273. Up to 12 conditions per place. [2023-08-03 15:24:46,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 260 transitions, 538 flow [2023-08-03 15:24:46,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 258 transitions, 534 flow [2023-08-03 15:24:46,726 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 15:24:46,727 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 258 transitions, 534 flow [2023-08-03 15:24:46,728 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 258 transitions, 534 flow [2023-08-03 15:24:46,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 258 transitions, 534 flow [2023-08-03 15:24:46,760 INFO L124 PetriNetUnfolderBase]: 71/422 cut-off events. [2023-08-03 15:24:46,760 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-03 15:24:46,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 422 events. 71/422 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1612 event pairs, 0 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 271. Up to 12 conditions per place. [2023-08-03 15:24:46,771 INFO L119 LiptonReduction]: Number of co-enabled transitions 25080 [2023-08-03 15:24:52,587 INFO L134 LiptonReduction]: Checked pairs total: 57220 [2023-08-03 15:24:52,587 INFO L136 LiptonReduction]: Total number of compositions: 206 [2023-08-03 15:24:52,589 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 15:24:52,590 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@1aae80e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 15:24:52,590 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-03 15:24:52,591 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 15:24:52,591 INFO L124 PetriNetUnfolderBase]: 6/21 cut-off events. [2023-08-03 15:24:52,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:24:52,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:24:52,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 15:24:52,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:24:52,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:24:52,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1234424057, now seen corresponding path program 1 times [2023-08-03 15:24:52,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:24:52,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715515709] [2023-08-03 15:24:52,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:24:52,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:24:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:24:52,642 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-03 15:24:52,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:24:52,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715515709] [2023-08-03 15:24:52,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715515709] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:24:52,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:24:52,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 15:24:52,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532260875] [2023-08-03 15:24:52,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:24:52,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 15:24:52,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:24:52,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 15:24:52,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 15:24:52,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 466 [2023-08-03 15:24:52,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 98 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 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-03 15:24:52,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:24:52,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 466 [2023-08-03 15:24:52,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:24:53,451 INFO L124 PetriNetUnfolderBase]: 8903/13936 cut-off events. [2023-08-03 15:24:53,451 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-08-03 15:24:53,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26898 conditions, 13936 events. 8903/13936 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 93141 event pairs, 6020 based on Foata normal form. 3325/15003 useless extension candidates. Maximal degree in co-relation 11579. Up to 12844 conditions per place. [2023-08-03 15:24:53,518 INFO L140 encePairwiseOnDemand]: 432/466 looper letters, 66 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-03 15:24:53,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 83 transitions, 320 flow [2023-08-03 15:24:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:24:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:24:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2023-08-03 15:24:53,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5379113018597997 [2023-08-03 15:24:53,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 752 transitions. [2023-08-03 15:24:53,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 752 transitions. [2023-08-03 15:24:53,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:24:53,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 752 transitions. [2023-08-03 15:24:53,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 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-03 15:24:53,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-03 15:24:53,525 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-03 15:24:53,525 INFO L175 Difference]: Start difference. First operand has 67 places, 98 transitions, 214 flow. Second operand 3 states and 752 transitions. [2023-08-03 15:24:53,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 83 transitions, 320 flow [2023-08-03 15:24:53,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 83 transitions, 320 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:24:53,527 INFO L231 Difference]: Finished difference. Result has 70 places, 68 transitions, 164 flow [2023-08-03 15:24:53,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=70, PETRI_TRANSITIONS=68} [2023-08-03 15:24:53,528 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 3 predicate places. [2023-08-03 15:24:53,528 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 164 flow [2023-08-03 15:24:53,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 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-03 15:24:53,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:24:53,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:24:53,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 15:24:53,529 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:24:53,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:24:53,529 INFO L85 PathProgramCache]: Analyzing trace with hash 705268624, now seen corresponding path program 1 times [2023-08-03 15:24:53,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:24:53,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292132761] [2023-08-03 15:24:53,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:24:53,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:24:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:24:53,705 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-03 15:24:53,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:24:53,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292132761] [2023-08-03 15:24:53,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292132761] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:24:53,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:24:53,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 15:24:53,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153979525] [2023-08-03 15:24:53,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:24:53,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 15:24:53,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:24:53,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 15:24:53,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 15:24:53,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 466 [2023-08-03 15:24:53,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 207.5) internal successors, (830), 4 states have internal predecessors, (830), 0 states have call successors, (0), 0 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-03 15:24:53,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:24:53,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 466 [2023-08-03 15:24:53,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:24:54,772 INFO L124 PetriNetUnfolderBase]: 10882/17631 cut-off events. [2023-08-03 15:24:54,772 INFO L125 PetriNetUnfolderBase]: For 749/749 co-relation queries the response was YES. [2023-08-03 15:24:54,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35061 conditions, 17631 events. 10882/17631 cut-off events. For 749/749 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 128419 event pairs, 3228 based on Foata normal form. 0/15427 useless extension candidates. Maximal degree in co-relation 34953. Up to 10910 conditions per place. [2023-08-03 15:24:54,812 INFO L140 encePairwiseOnDemand]: 453/466 looper letters, 114 selfloop transitions, 13 changer transitions 8/150 dead transitions. [2023-08-03 15:24:54,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 150 transitions, 626 flow [2023-08-03 15:24:54,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 15:24:54,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 15:24:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 961 transitions. [2023-08-03 15:24:54,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155579399141631 [2023-08-03 15:24:54,815 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 961 transitions. [2023-08-03 15:24:54,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 961 transitions. [2023-08-03 15:24:54,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:24:54,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 961 transitions. [2023-08-03 15:24:54,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 240.25) internal successors, (961), 4 states have internal predecessors, (961), 0 states have call successors, (0), 0 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-03 15:24:54,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 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-03 15:24:54,820 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 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-03 15:24:54,820 INFO L175 Difference]: Start difference. First operand has 70 places, 68 transitions, 164 flow. Second operand 4 states and 961 transitions. [2023-08-03 15:24:54,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 150 transitions, 626 flow [2023-08-03 15:24:54,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 150 transitions, 623 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 15:24:54,823 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 268 flow [2023-08-03 15:24:54,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=268, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2023-08-03 15:24:54,824 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 8 predicate places. [2023-08-03 15:24:54,824 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 268 flow [2023-08-03 15:24:54,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 207.5) internal successors, (830), 4 states have internal predecessors, (830), 0 states have call successors, (0), 0 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-03 15:24:54,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:24:54,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:24:54,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-03 15:24:54,825 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:24:54,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:24:54,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2087176397, now seen corresponding path program 1 times [2023-08-03 15:24:54,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:24:54,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182874503] [2023-08-03 15:24:54,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:24:54,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:24:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:24:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 15:24:54,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:24:54,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182874503] [2023-08-03 15:24:54,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182874503] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:24:54,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083505261] [2023-08-03 15:24:54,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:24:54,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:24:54,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:24:54,877 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-03 15:24:54,878 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-03 15:24:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:24:54,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 15:24:54,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:24:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 15:24:55,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:24:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 15:24:55,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083505261] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:24:55,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:24:55,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 15:24:55,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491356846] [2023-08-03 15:24:55,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:24:55,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 15:24:55,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:24:55,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 15:24:55,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 15:24:55,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 466 [2023-08-03 15:24:55,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 215.2) internal successors, (1076), 5 states have internal predecessors, (1076), 0 states have call successors, (0), 0 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-03 15:24:55,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:24:55,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 466 [2023-08-03 15:24:55,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:24:56,307 INFO L124 PetriNetUnfolderBase]: 10649/17960 cut-off events. [2023-08-03 15:24:56,307 INFO L125 PetriNetUnfolderBase]: For 5103/5103 co-relation queries the response was YES. [2023-08-03 15:24:56,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40476 conditions, 17960 events. 10649/17960 cut-off events. For 5103/5103 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 137910 event pairs, 813 based on Foata normal form. 15/16737 useless extension candidates. Maximal degree in co-relation 8387. Up to 14949 conditions per place. [2023-08-03 15:24:56,374 INFO L140 encePairwiseOnDemand]: 462/466 looper letters, 110 selfloop transitions, 5 changer transitions 0/130 dead transitions. [2023-08-03 15:24:56,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 130 transitions, 654 flow [2023-08-03 15:24:56,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 15:24:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 15:24:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 950 transitions. [2023-08-03 15:24:56,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509656652360515 [2023-08-03 15:24:56,377 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 950 transitions. [2023-08-03 15:24:56,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 950 transitions. [2023-08-03 15:24:56,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:24:56,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 950 transitions. [2023-08-03 15:24:56,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 237.5) internal successors, (950), 4 states have internal predecessors, (950), 0 states have call successors, (0), 0 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-03 15:24:56,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 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-03 15:24:56,382 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 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-03 15:24:56,382 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 268 flow. Second operand 4 states and 950 transitions. [2023-08-03 15:24:56,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 130 transitions, 654 flow [2023-08-03 15:24:56,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 130 transitions, 654 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:24:56,389 INFO L231 Difference]: Finished difference. Result has 80 places, 81 transitions, 294 flow [2023-08-03 15:24:56,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=294, PETRI_PLACES=80, PETRI_TRANSITIONS=81} [2023-08-03 15:24:56,390 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 13 predicate places. [2023-08-03 15:24:56,390 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 81 transitions, 294 flow [2023-08-03 15:24:56,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 215.2) internal successors, (1076), 5 states have internal predecessors, (1076), 0 states have call successors, (0), 0 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-03 15:24:56,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:24:56,391 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 15:24:56,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 15:24:56,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:24:56,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:24:56,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:24:56,597 INFO L85 PathProgramCache]: Analyzing trace with hash -147922955, now seen corresponding path program 1 times [2023-08-03 15:24:56,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:24:56,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924347877] [2023-08-03 15:24:56,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:24:56,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:24:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:24:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 15:24:56,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:24:56,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924347877] [2023-08-03 15:24:56,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924347877] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:24:56,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885568400] [2023-08-03 15:24:56,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:24:56,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:24:56,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:24:56,695 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-03 15:24:56,705 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-03 15:24:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:24:56,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 15:24:56,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:24:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 15:24:56,960 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:24:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 15:24:56,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885568400] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-03 15:24:56,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-03 15:24:56,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2023-08-03 15:24:56,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123424066] [2023-08-03 15:24:56,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:24:56,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 15:24:56,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:24:56,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 15:24:56,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 15:24:56,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 466 [2023-08-03 15:24:56,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 81 transitions, 294 flow. Second operand has 5 states, 5 states have (on average 214.6) internal successors, (1073), 5 states have internal predecessors, (1073), 0 states have call successors, (0), 0 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-03 15:24:56,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:24:56,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 466 [2023-08-03 15:24:56,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:24:57,842 INFO L124 PetriNetUnfolderBase]: 10096/17054 cut-off events. [2023-08-03 15:24:57,842 INFO L125 PetriNetUnfolderBase]: For 6448/6448 co-relation queries the response was YES. [2023-08-03 15:24:57,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39092 conditions, 17054 events. 10096/17054 cut-off events. For 6448/6448 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 130565 event pairs, 668 based on Foata normal form. 281/16128 useless extension candidates. Maximal degree in co-relation 16867. Up to 14922 conditions per place. [2023-08-03 15:24:57,889 INFO L140 encePairwiseOnDemand]: 463/466 looper letters, 110 selfloop transitions, 3 changer transitions 0/127 dead transitions. [2023-08-03 15:24:57,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 127 transitions, 650 flow [2023-08-03 15:24:57,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 15:24:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 15:24:57,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1162 transitions. [2023-08-03 15:24:57,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49871244635193135 [2023-08-03 15:24:57,892 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1162 transitions. [2023-08-03 15:24:57,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1162 transitions. [2023-08-03 15:24:57,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:24:57,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1162 transitions. [2023-08-03 15:24:57,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 232.4) internal successors, (1162), 5 states have internal predecessors, (1162), 0 states have call successors, (0), 0 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-03 15:24:57,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 0 states have call successors, (0), 0 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-03 15:24:57,898 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 0 states have call successors, (0), 0 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-03 15:24:57,898 INFO L175 Difference]: Start difference. First operand has 80 places, 81 transitions, 294 flow. Second operand 5 states and 1162 transitions. [2023-08-03 15:24:57,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 127 transitions, 650 flow [2023-08-03 15:24:57,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 127 transitions, 640 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-03 15:24:57,902 INFO L231 Difference]: Finished difference. Result has 79 places, 78 transitions, 266 flow [2023-08-03 15:24:57,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=79, PETRI_TRANSITIONS=78} [2023-08-03 15:24:57,902 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 12 predicate places. [2023-08-03 15:24:57,902 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 266 flow [2023-08-03 15:24:57,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 214.6) internal successors, (1073), 5 states have internal predecessors, (1073), 0 states have call successors, (0), 0 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-03 15:24:57,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:24:57,903 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:24:57,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 15:24:58,109 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,SelfDestructingSolverStorable5 [2023-08-03 15:24:58,111 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:24:58,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:24:58,112 INFO L85 PathProgramCache]: Analyzing trace with hash -419827230, now seen corresponding path program 1 times [2023-08-03 15:24:58,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:24:58,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917308438] [2023-08-03 15:24:58,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:24:58,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:24:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:24:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:24:58,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:24:58,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917308438] [2023-08-03 15:24:58,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917308438] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:24:58,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104335761] [2023-08-03 15:24:58,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:24:58,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:24:58,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:24:58,394 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-03 15:24:58,396 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-03 15:24:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:24:58,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-03 15:24:58,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:24:58,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:24:58,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:24:58,753 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:24:58,757 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:24:58,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:24:58,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:24:58,846 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:24:58,846 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:24:59,194 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:24:59,195 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 382 treesize of output 309 [2023-08-03 15:25:00,161 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:25:00,161 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 382 treesize of output 309 [2023-08-03 15:25:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:25:01,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:25:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:25:01,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104335761] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:25:01,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:25:01,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2023-08-03 15:25:01,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004830154] [2023-08-03 15:25:01,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:25:01,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-03 15:25:01,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:25:01,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-03 15:25:01,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=29, Unknown=3, NotChecked=0, Total=56 [2023-08-03 15:25:01,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 466 [2023-08-03 15:25:01,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 266 flow. Second operand has 8 states, 8 states have (on average 175.75) internal successors, (1406), 8 states have internal predecessors, (1406), 0 states have call successors, (0), 0 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-03 15:25:01,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:25:01,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 466 [2023-08-03 15:25:01,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:25:02,663 INFO L124 PetriNetUnfolderBase]: 11858/19525 cut-off events. [2023-08-03 15:25:02,663 INFO L125 PetriNetUnfolderBase]: For 7870/7878 co-relation queries the response was YES. [2023-08-03 15:25:02,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44971 conditions, 19525 events. 11858/19525 cut-off events. For 7870/7878 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 146365 event pairs, 4038 based on Foata normal form. 6/18290 useless extension candidates. Maximal degree in co-relation 20420. Up to 13047 conditions per place. [2023-08-03 15:25:02,709 INFO L140 encePairwiseOnDemand]: 457/466 looper letters, 114 selfloop transitions, 10 changer transitions 25/163 dead transitions. [2023-08-03 15:25:02,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 163 transitions, 814 flow [2023-08-03 15:25:02,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 15:25:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 15:25:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 999 transitions. [2023-08-03 15:25:02,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42875536480686693 [2023-08-03 15:25:02,712 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 999 transitions. [2023-08-03 15:25:02,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 999 transitions. [2023-08-03 15:25:02,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:25:02,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 999 transitions. [2023-08-03 15:25:02,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 199.8) internal successors, (999), 5 states have internal predecessors, (999), 0 states have call successors, (0), 0 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-03 15:25:02,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 0 states have call successors, (0), 0 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-03 15:25:02,716 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 0 states have call successors, (0), 0 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-03 15:25:02,716 INFO L175 Difference]: Start difference. First operand has 79 places, 78 transitions, 266 flow. Second operand 5 states and 999 transitions. [2023-08-03 15:25:02,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 163 transitions, 814 flow [2023-08-03 15:25:02,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 163 transitions, 806 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 15:25:02,721 INFO L231 Difference]: Finished difference. Result has 83 places, 81 transitions, 324 flow [2023-08-03 15:25:02,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=83, PETRI_TRANSITIONS=81} [2023-08-03 15:25:02,722 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 16 predicate places. [2023-08-03 15:25:02,722 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 81 transitions, 324 flow [2023-08-03 15:25:02,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 175.75) internal successors, (1406), 8 states have internal predecessors, (1406), 0 states have call successors, (0), 0 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-03 15:25:02,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:25:02,722 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:25:02,729 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-03 15:25:02,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:25:02,929 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:25:02,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:25:02,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1973066006, now seen corresponding path program 1 times [2023-08-03 15:25:02,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:25:02,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218350232] [2023-08-03 15:25:02,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:25:02,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:25:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:25:02,989 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-03 15:25:02,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:25:02,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218350232] [2023-08-03 15:25:02,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218350232] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:25:02,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:25:02,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 15:25:02,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708604344] [2023-08-03 15:25:02,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:25:02,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 15:25:02,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:25:02,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 15:25:02,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 15:25:03,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 466 [2023-08-03 15:25:03,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 81 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 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-03 15:25:03,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:25:03,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 466 [2023-08-03 15:25:03,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:25:04,205 INFO L124 PetriNetUnfolderBase]: 14097/24592 cut-off events. [2023-08-03 15:25:04,205 INFO L125 PetriNetUnfolderBase]: For 14371/14371 co-relation queries the response was YES. [2023-08-03 15:25:04,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59110 conditions, 24592 events. 14097/24592 cut-off events. For 14371/14371 co-relation queries the response was YES. Maximal size of possible extension queue 1262. Compared 210679 event pairs, 4633 based on Foata normal form. 265/23464 useless extension candidates. Maximal degree in co-relation 43813. Up to 15008 conditions per place. [2023-08-03 15:25:04,269 INFO L140 encePairwiseOnDemand]: 452/466 looper letters, 114 selfloop transitions, 14 changer transitions 2/144 dead transitions. [2023-08-03 15:25:04,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 144 transitions, 858 flow [2023-08-03 15:25:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:25:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:25:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2023-08-03 15:25:04,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042918454935622 [2023-08-03 15:25:04,271 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 705 transitions. [2023-08-03 15:25:04,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions. [2023-08-03 15:25:04,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:25:04,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions. [2023-08-03 15:25:04,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 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-03 15:25:04,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-03 15:25:04,274 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-03 15:25:04,274 INFO L175 Difference]: Start difference. First operand has 83 places, 81 transitions, 324 flow. Second operand 3 states and 705 transitions. [2023-08-03 15:25:04,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 144 transitions, 858 flow [2023-08-03 15:25:04,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 144 transitions, 849 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 15:25:04,285 INFO L231 Difference]: Finished difference. Result has 85 places, 93 transitions, 409 flow [2023-08-03 15:25:04,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=409, PETRI_PLACES=85, PETRI_TRANSITIONS=93} [2023-08-03 15:25:04,286 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 18 predicate places. [2023-08-03 15:25:04,286 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 93 transitions, 409 flow [2023-08-03 15:25:04,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 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-03 15:25:04,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:25:04,286 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:25:04,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 15:25:04,286 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:25:04,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:25:04,286 INFO L85 PathProgramCache]: Analyzing trace with hash 470397836, now seen corresponding path program 1 times [2023-08-03 15:25:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:25:04,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338779799] [2023-08-03 15:25:04,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:25:04,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:25:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:25:04,436 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-03 15:25:04,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:25:04,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338779799] [2023-08-03 15:25:04,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338779799] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:25:04,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:25:04,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 15:25:04,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857993060] [2023-08-03 15:25:04,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:25:04,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 15:25:04,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:25:04,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 15:25:04,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 15:25:04,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 466 [2023-08-03 15:25:04,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 93 transitions, 409 flow. Second operand has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 0 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-03 15:25:04,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:25:04,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 466 [2023-08-03 15:25:04,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:25:06,089 INFO L124 PetriNetUnfolderBase]: 16427/29079 cut-off events. [2023-08-03 15:25:06,090 INFO L125 PetriNetUnfolderBase]: For 19075/19175 co-relation queries the response was YES. [2023-08-03 15:25:06,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80306 conditions, 29079 events. 16427/29079 cut-off events. For 19075/19175 co-relation queries the response was YES. Maximal size of possible extension queue 1348. Compared 254316 event pairs, 4815 based on Foata normal form. 1173/28520 useless extension candidates. Maximal degree in co-relation 73271. Up to 16453 conditions per place. [2023-08-03 15:25:06,201 INFO L140 encePairwiseOnDemand]: 443/466 looper letters, 175 selfloop transitions, 22 changer transitions 9/214 dead transitions. [2023-08-03 15:25:06,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 214 transitions, 1376 flow [2023-08-03 15:25:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 15:25:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 15:25:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 927 transitions. [2023-08-03 15:25:06,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973175965665236 [2023-08-03 15:25:06,204 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 927 transitions. [2023-08-03 15:25:06,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 927 transitions. [2023-08-03 15:25:06,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:25:06,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 927 transitions. [2023-08-03 15:25:06,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 0 states have call successors, (0), 0 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-03 15:25:06,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 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-03 15:25:06,208 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 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-03 15:25:06,208 INFO L175 Difference]: Start difference. First operand has 85 places, 93 transitions, 409 flow. Second operand 4 states and 927 transitions. [2023-08-03 15:25:06,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 214 transitions, 1376 flow [2023-08-03 15:25:06,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 214 transitions, 1348 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 15:25:06,230 INFO L231 Difference]: Finished difference. Result has 89 places, 109 transitions, 577 flow [2023-08-03 15:25:06,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=577, PETRI_PLACES=89, PETRI_TRANSITIONS=109} [2023-08-03 15:25:06,231 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 22 predicate places. [2023-08-03 15:25:06,231 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 109 transitions, 577 flow [2023-08-03 15:25:06,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 0 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-03 15:25:06,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:25:06,231 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:25:06,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 15:25:06,231 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:25:06,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:25:06,232 INFO L85 PathProgramCache]: Analyzing trace with hash 464729511, now seen corresponding path program 1 times [2023-08-03 15:25:06,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:25:06,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535925154] [2023-08-03 15:25:06,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:25:06,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:25:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:25:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 15:25:06,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:25:06,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535925154] [2023-08-03 15:25:06,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535925154] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:25:06,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:25:06,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 15:25:06,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443305831] [2023-08-03 15:25:06,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:25:06,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 15:25:06,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:25:06,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 15:25:06,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 15:25:06,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 466 [2023-08-03 15:25:06,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 109 transitions, 577 flow. Second operand has 4 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 0 states have call successors, (0), 0 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-03 15:25:06,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:25:06,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 466 [2023-08-03 15:25:06,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:25:07,836 INFO L124 PetriNetUnfolderBase]: 14485/27035 cut-off events. [2023-08-03 15:25:07,837 INFO L125 PetriNetUnfolderBase]: For 29727/29907 co-relation queries the response was YES. [2023-08-03 15:25:07,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84133 conditions, 27035 events. 14485/27035 cut-off events. For 29727/29907 co-relation queries the response was YES. Maximal size of possible extension queue 1336. Compared 246977 event pairs, 4615 based on Foata normal form. 1672/26862 useless extension candidates. Maximal degree in co-relation 49563. Up to 13437 conditions per place. [2023-08-03 15:25:07,932 INFO L140 encePairwiseOnDemand]: 445/466 looper letters, 129 selfloop transitions, 48 changer transitions 5/190 dead transitions. [2023-08-03 15:25:07,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 190 transitions, 1377 flow [2023-08-03 15:25:07,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:25:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:25:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 687 transitions. [2023-08-03 15:25:07,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49141630901287553 [2023-08-03 15:25:07,935 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 687 transitions. [2023-08-03 15:25:07,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 687 transitions. [2023-08-03 15:25:07,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:25:07,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 687 transitions. [2023-08-03 15:25:07,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 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-03 15:25:07,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-03 15:25:07,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-03 15:25:07,938 INFO L175 Difference]: Start difference. First operand has 89 places, 109 transitions, 577 flow. Second operand 3 states and 687 transitions. [2023-08-03 15:25:07,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 190 transitions, 1377 flow [2023-08-03 15:25:07,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 190 transitions, 1377 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:25:07,961 INFO L231 Difference]: Finished difference. Result has 92 places, 137 transitions, 939 flow [2023-08-03 15:25:07,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=939, PETRI_PLACES=92, PETRI_TRANSITIONS=137} [2023-08-03 15:25:07,961 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 25 predicate places. [2023-08-03 15:25:07,961 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 137 transitions, 939 flow [2023-08-03 15:25:07,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 0 states have call successors, (0), 0 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-03 15:25:07,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:25:07,962 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:25:07,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-03 15:25:07,962 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:25:07,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:25:07,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1455571923, now seen corresponding path program 1 times [2023-08-03 15:25:07,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:25:07,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719822907] [2023-08-03 15:25:07,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:25:07,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:25:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:25:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:25:08,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:25:08,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719822907] [2023-08-03 15:25:08,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719822907] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:25:08,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776830486] [2023-08-03 15:25:08,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:25:08,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:25:08,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:25:08,261 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-03 15:25:08,263 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-03 15:25:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:25:08,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-03 15:25:08,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:25:08,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:25:08,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:25:08,651 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:25:08,651 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:25:08,691 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 9 treesize of output 11 [2023-08-03 15:25:08,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:25:08,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:25:08,769 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:25:08,769 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:25:08,811 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 9 treesize of output 11 [2023-08-03 15:25:09,189 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:25:09,190 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:25:10,309 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:25:10,309 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:25:11,260 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-03 15:25:11,950 INFO L322 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-08-03 15:25:11,950 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 370 treesize of output 375 [2023-08-03 15:25:12,402 INFO L322 Elim1Store]: treesize reduction 48, result has 37.7 percent of original size [2023-08-03 15:25:12,402 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 370 treesize of output 305 [2023-08-03 15:25:13,151 INFO L322 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-08-03 15:25:13,151 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 252 treesize of output 257 [2023-08-03 15:25:13,394 INFO L322 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-08-03 15:25:13,395 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 249 treesize of output 238 [2023-08-03 15:25:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:25:13,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:25:13,598 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_278 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_278) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (forall ((v_ArrVal_279 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_279) |c_~#A~0.base|) (+ |c_~#A~0.offset| 12)) 0)))) is different from false [2023-08-03 15:25:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:25:13,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776830486] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:25:13,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:25:13,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2023-08-03 15:25:13,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955296207] [2023-08-03 15:25:13,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:25:13,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-03 15:25:13,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:25:13,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-03 15:25:13,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=4, NotChecked=30, Total=306 [2023-08-03 15:25:13,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 466 [2023-08-03 15:25:13,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 137 transitions, 939 flow. Second operand has 18 states, 18 states have (on average 143.66666666666666) internal successors, (2586), 18 states have internal predecessors, (2586), 0 states have call successors, (0), 0 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-03 15:25:13,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:25:13,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 466 [2023-08-03 15:25:13,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:25:20,963 INFO L124 PetriNetUnfolderBase]: 18242/34388 cut-off events. [2023-08-03 15:25:20,964 INFO L125 PetriNetUnfolderBase]: For 60817/60998 co-relation queries the response was YES. [2023-08-03 15:25:21,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124177 conditions, 34388 events. 18242/34388 cut-off events. For 60817/60998 co-relation queries the response was YES. Maximal size of possible extension queue 1635. Compared 326824 event pairs, 3345 based on Foata normal form. 425/32477 useless extension candidates. Maximal degree in co-relation 115858. Up to 12764 conditions per place. [2023-08-03 15:25:21,077 INFO L140 encePairwiseOnDemand]: 439/466 looper letters, 457 selfloop transitions, 209 changer transitions 301/975 dead transitions. [2023-08-03 15:25:21,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 975 transitions, 8253 flow [2023-08-03 15:25:21,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-03 15:25:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-03 15:25:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4461 transitions. [2023-08-03 15:25:21,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.354554124940391 [2023-08-03 15:25:21,086 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4461 transitions. [2023-08-03 15:25:21,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4461 transitions. [2023-08-03 15:25:21,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:25:21,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4461 transitions. [2023-08-03 15:25:21,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 165.22222222222223) internal successors, (4461), 27 states have internal predecessors, (4461), 0 states have call successors, (0), 0 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-03 15:25:21,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 466.0) internal successors, (13048), 28 states have internal predecessors, (13048), 0 states have call successors, (0), 0 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-03 15:25:21,105 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 466.0) internal successors, (13048), 28 states have internal predecessors, (13048), 0 states have call successors, (0), 0 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-03 15:25:21,105 INFO L175 Difference]: Start difference. First operand has 92 places, 137 transitions, 939 flow. Second operand 27 states and 4461 transitions. [2023-08-03 15:25:21,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 975 transitions, 8253 flow [2023-08-03 15:25:21,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 975 transitions, 7893 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 15:25:21,148 INFO L231 Difference]: Finished difference. Result has 131 places, 348 transitions, 3374 flow [2023-08-03 15:25:21,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3374, PETRI_PLACES=131, PETRI_TRANSITIONS=348} [2023-08-03 15:25:21,148 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 64 predicate places. [2023-08-03 15:25:21,148 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 348 transitions, 3374 flow [2023-08-03 15:25:21,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 143.66666666666666) internal successors, (2586), 18 states have internal predecessors, (2586), 0 states have call successors, (0), 0 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-03 15:25:21,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:25:21,149 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:25:21,155 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-03 15:25:21,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:25:21,353 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:25:21,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:25:21,354 INFO L85 PathProgramCache]: Analyzing trace with hash -171555429, now seen corresponding path program 2 times [2023-08-03 15:25:21,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:25:21,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127379665] [2023-08-03 15:25:21,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:25:21,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:25:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:25:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:25:21,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:25:21,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127379665] [2023-08-03 15:25:21,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127379665] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:25:21,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075083517] [2023-08-03 15:25:21,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:25:21,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:25:21,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:25:21,604 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-03 15:25:21,606 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-03 15:25:21,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:25:21,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:25:21,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-03 15:25:21,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:25:21,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:25:21,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:25:21,902 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:25:21,902 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:25:21,926 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 9 treesize of output 11 [2023-08-03 15:25:21,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:25:21,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:25:21,993 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:25:21,993 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:25:22,021 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 9 treesize of output 11 [2023-08-03 15:25:22,312 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:25:22,313 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 15:25:23,290 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:25:23,291 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 15:25:24,169 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 15:25:24,876 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:25:24,882 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:25:24,882 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 17 treesize of output 11 [2023-08-03 15:25:25,445 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 15:25:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:25:25,550 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:25:25,556 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_336) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 15:25:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:25:25,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075083517] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:25:25,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:25:25,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-03 15:25:25,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575112655] [2023-08-03 15:25:25,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:25:25,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-03 15:25:25,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:25:25,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-03 15:25:25,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=144, Unknown=1, NotChecked=26, Total=240 [2023-08-03 15:25:25,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 466 [2023-08-03 15:25:25,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 348 transitions, 3374 flow. Second operand has 16 states, 16 states have (on average 145.0) internal successors, (2320), 16 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 15:25:25,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:25:25,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 466 [2023-08-03 15:25:25,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:25:32,882 INFO L124 PetriNetUnfolderBase]: 23198/45140 cut-off events. [2023-08-03 15:25:32,882 INFO L125 PetriNetUnfolderBase]: For 163771/164102 co-relation queries the response was YES. [2023-08-03 15:25:33,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183344 conditions, 45140 events. 23198/45140 cut-off events. For 163771/164102 co-relation queries the response was YES. Maximal size of possible extension queue 2244. Compared 461152 event pairs, 6152 based on Foata normal form. 351/42081 useless extension candidates. Maximal degree in co-relation 167444. Up to 16290 conditions per place. [2023-08-03 15:25:33,093 INFO L140 encePairwiseOnDemand]: 433/466 looper letters, 598 selfloop transitions, 352 changer transitions 459/1417 dead transitions. [2023-08-03 15:25:33,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 1417 transitions, 13904 flow [2023-08-03 15:25:33,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-08-03 15:25:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-08-03 15:25:33,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5194 transitions. [2023-08-03 15:25:33,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3595458950574554 [2023-08-03 15:25:33,103 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 5194 transitions. [2023-08-03 15:25:33,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 5194 transitions. [2023-08-03 15:25:33,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:25:33,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 5194 transitions. [2023-08-03 15:25:33,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 167.5483870967742) internal successors, (5194), 31 states have internal predecessors, (5194), 0 states have call successors, (0), 0 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-03 15:25:33,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 466.0) internal successors, (14912), 32 states have internal predecessors, (14912), 0 states have call successors, (0), 0 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-03 15:25:33,126 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 466.0) internal successors, (14912), 32 states have internal predecessors, (14912), 0 states have call successors, (0), 0 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-03 15:25:33,126 INFO L175 Difference]: Start difference. First operand has 131 places, 348 transitions, 3374 flow. Second operand 31 states and 5194 transitions. [2023-08-03 15:25:33,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 1417 transitions, 13904 flow [2023-08-03 15:25:34,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 1417 transitions, 13623 flow, removed 105 selfloop flow, removed 2 redundant places. [2023-08-03 15:25:34,542 INFO L231 Difference]: Finished difference. Result has 174 places, 573 transitions, 6637 flow [2023-08-03 15:25:34,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=3266, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=6637, PETRI_PLACES=174, PETRI_TRANSITIONS=573} [2023-08-03 15:25:34,542 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 107 predicate places. [2023-08-03 15:25:34,542 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 573 transitions, 6637 flow [2023-08-03 15:25:34,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 145.0) internal successors, (2320), 16 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 15:25:34,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:25:34,543 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:25:34,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-03 15:25:34,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-03 15:25:34,743 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:25:34,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:25:34,744 INFO L85 PathProgramCache]: Analyzing trace with hash -339243344, now seen corresponding path program 1 times [2023-08-03 15:25:34,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:25:34,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073734891] [2023-08-03 15:25:34,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:25:34,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:25:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:25:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:25:35,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:25:35,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073734891] [2023-08-03 15:25:35,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073734891] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:25:35,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238241920] [2023-08-03 15:25:35,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:25:35,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:25:35,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:25:35,162 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-03 15:25:35,164 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-03 15:25:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:25:35,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-03 15:25:35,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:25:35,546 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 9 treesize of output 11 [2023-08-03 15:25:35,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:25:35,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:25:35,569 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:25:35,569 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:25:35,648 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 9 treesize of output 11 [2023-08-03 15:25:35,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:25:35,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:25:35,673 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:25:35,673 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:25:36,039 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:25:36,039 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 412 treesize of output 339 [2023-08-03 15:25:37,064 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:25:37,065 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 412 treesize of output 339 [2023-08-03 15:25:38,084 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 15:25:38,804 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-03 15:25:38,805 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 382 treesize of output 382 [2023-08-03 15:25:39,339 INFO L322 Elim1Store]: treesize reduction 61, result has 20.8 percent of original size [2023-08-03 15:25:39,339 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 382 treesize of output 304 [2023-08-03 15:25:39,560 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-03 15:25:39,560 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 264 treesize of output 264 [2023-08-03 15:25:39,748 INFO L322 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-08-03 15:25:39,748 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 259 treesize of output 251 [2023-08-03 15:25:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:25:39,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:25:39,987 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_390 (Array Int Int)) (v_ArrVal_394 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_390) |c_~#A~0.base| v_ArrVal_394) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0)) (forall ((v_ArrVal_395 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_395) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) is different from false [2023-08-03 15:25:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-03 15:25:40,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238241920] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:25:40,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:25:40,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2023-08-03 15:25:40,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044137807] [2023-08-03 15:25:40,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:25:40,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-03 15:25:40,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:25:40,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-03 15:25:40,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=214, Unknown=6, NotChecked=32, Total=342 [2023-08-03 15:25:40,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 466 [2023-08-03 15:25:40,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 573 transitions, 6637 flow. Second operand has 19 states, 19 states have (on average 143.68421052631578) internal successors, (2730), 19 states have internal predecessors, (2730), 0 states have call successors, (0), 0 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-03 15:25:40,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:25:40,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 466 [2023-08-03 15:25:40,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:25:52,632 INFO L124 PetriNetUnfolderBase]: 26263/52109 cut-off events. [2023-08-03 15:25:52,633 INFO L125 PetriNetUnfolderBase]: For 335398/335716 co-relation queries the response was YES. [2023-08-03 15:25:52,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248204 conditions, 52109 events. 26263/52109 cut-off events. For 335398/335716 co-relation queries the response was YES. Maximal size of possible extension queue 2454. Compared 545901 event pairs, 8195 based on Foata normal form. 630/49243 useless extension candidates. Maximal degree in co-relation 243194. Up to 20242 conditions per place. [2023-08-03 15:25:53,004 INFO L140 encePairwiseOnDemand]: 448/466 looper letters, 871 selfloop transitions, 330 changer transitions 539/1748 dead transitions. [2023-08-03 15:25:53,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 1748 transitions, 21269 flow [2023-08-03 15:25:53,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-03 15:25:53,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-03 15:25:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 5484 transitions. [2023-08-03 15:25:53,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35661334373780723 [2023-08-03 15:25:53,012 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 5484 transitions. [2023-08-03 15:25:53,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 5484 transitions. [2023-08-03 15:25:53,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:25:53,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 5484 transitions. [2023-08-03 15:25:53,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 166.1818181818182) internal successors, (5484), 33 states have internal predecessors, (5484), 0 states have call successors, (0), 0 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-03 15:25:53,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 466.0) internal successors, (15844), 34 states have internal predecessors, (15844), 0 states have call successors, (0), 0 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-03 15:25:53,032 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 466.0) internal successors, (15844), 34 states have internal predecessors, (15844), 0 states have call successors, (0), 0 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-03 15:25:53,032 INFO L175 Difference]: Start difference. First operand has 174 places, 573 transitions, 6637 flow. Second operand 33 states and 5484 transitions. [2023-08-03 15:25:53,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 1748 transitions, 21269 flow [2023-08-03 15:25:56,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 1748 transitions, 20827 flow, removed 164 selfloop flow, removed 6 redundant places. [2023-08-03 15:25:56,592 INFO L231 Difference]: Finished difference. Result has 216 places, 738 transitions, 9856 flow [2023-08-03 15:25:56,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=6078, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=9856, PETRI_PLACES=216, PETRI_TRANSITIONS=738} [2023-08-03 15:25:56,593 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 149 predicate places. [2023-08-03 15:25:56,593 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 738 transitions, 9856 flow [2023-08-03 15:25:56,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 143.68421052631578) internal successors, (2730), 19 states have internal predecessors, (2730), 0 states have call successors, (0), 0 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-03 15:25:56,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:25:56,594 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] [2023-08-03 15:25:56,598 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-03 15:25:56,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:25:56,794 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:25:56,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:25:56,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1326491046, now seen corresponding path program 1 times [2023-08-03 15:25:56,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:25:56,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110631895] [2023-08-03 15:25:56,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:25:56,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:25:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:25:56,955 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-03 15:25:56,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:25:56,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110631895] [2023-08-03 15:25:56,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110631895] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:25:56,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:25:56,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 15:25:56,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994239945] [2023-08-03 15:25:56,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:25:56,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 15:25:56,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:25:56,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 15:25:56,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 15:25:57,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 466 [2023-08-03 15:25:57,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 738 transitions, 9856 flow. Second operand has 4 states, 4 states have (on average 195.75) internal successors, (783), 4 states have internal predecessors, (783), 0 states have call successors, (0), 0 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-03 15:25:57,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:25:57,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 466 [2023-08-03 15:25:57,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:26:02,503 INFO L124 PetriNetUnfolderBase]: 13939/29943 cut-off events. [2023-08-03 15:26:02,503 INFO L125 PetriNetUnfolderBase]: For 287625/288033 co-relation queries the response was YES. [2023-08-03 15:26:02,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153098 conditions, 29943 events. 13939/29943 cut-off events. For 287625/288033 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 308909 event pairs, 3768 based on Foata normal form. 593/28607 useless extension candidates. Maximal degree in co-relation 147956. Up to 12855 conditions per place. [2023-08-03 15:26:02,683 INFO L140 encePairwiseOnDemand]: 443/466 looper letters, 408 selfloop transitions, 310 changer transitions 90/816 dead transitions. [2023-08-03 15:26:02,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 816 transitions, 11868 flow [2023-08-03 15:26:02,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 15:26:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 15:26:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 934 transitions. [2023-08-03 15:26:02,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010729613733905 [2023-08-03 15:26:02,684 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 934 transitions. [2023-08-03 15:26:02,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 934 transitions. [2023-08-03 15:26:02,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:26:02,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 934 transitions. [2023-08-03 15:26:02,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 233.5) internal successors, (934), 4 states have internal predecessors, (934), 0 states have call successors, (0), 0 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-03 15:26:02,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 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-03 15:26:02,687 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 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-03 15:26:02,687 INFO L175 Difference]: Start difference. First operand has 216 places, 738 transitions, 9856 flow. Second operand 4 states and 934 transitions. [2023-08-03 15:26:02,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 816 transitions, 11868 flow [2023-08-03 15:26:05,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 816 transitions, 11378 flow, removed 194 selfloop flow, removed 5 redundant places. [2023-08-03 15:26:05,504 INFO L231 Difference]: Finished difference. Result has 210 places, 647 transitions, 9186 flow [2023-08-03 15:26:05,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=7925, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=270, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9186, PETRI_PLACES=210, PETRI_TRANSITIONS=647} [2023-08-03 15:26:05,505 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 143 predicate places. [2023-08-03 15:26:05,505 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 647 transitions, 9186 flow [2023-08-03 15:26:05,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.75) internal successors, (783), 4 states have internal predecessors, (783), 0 states have call successors, (0), 0 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-03 15:26:05,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:26:05,505 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] [2023-08-03 15:26:05,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-03 15:26:05,506 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:26:05,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:26:05,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1360279598, now seen corresponding path program 1 times [2023-08-03 15:26:05,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:26:05,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500402914] [2023-08-03 15:26:05,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:26:05,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:26:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:26:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:26:06,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:26:06,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500402914] [2023-08-03 15:26:06,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500402914] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:26:06,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390693523] [2023-08-03 15:26:06,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:26:06,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:26:06,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:26:06,028 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-03 15:26:06,029 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-03 15:26:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:26:06,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-03 15:26:06,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:26:06,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:26:06,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:26:06,300 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:26:06,301 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:26:06,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:26:06,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:26:06,380 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:26:06,380 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:26:06,716 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:26:06,716 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 394 treesize of output 321 [2023-08-03 15:26:07,542 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:26:07,542 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 394 treesize of output 321 [2023-08-03 15:26:09,517 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:26:09,517 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 367 treesize of output 332 [2023-08-03 15:26:11,031 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:26:11,031 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 367 treesize of output 332 [2023-08-03 15:26:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:26:11,480 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:26:11,567 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0)) is different from false [2023-08-03 15:26:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-03 15:26:11,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390693523] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:26:11,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:26:11,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 17 [2023-08-03 15:26:11,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185247469] [2023-08-03 15:26:11,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:26:11,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-03 15:26:11,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:26:11,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-03 15:26:11,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=244, Unknown=1, NotChecked=32, Total=342 [2023-08-03 15:26:11,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 15:26:11,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 647 transitions, 9186 flow. Second operand has 19 states, 19 states have (on average 140.31578947368422) internal successors, (2666), 19 states have internal predecessors, (2666), 0 states have call successors, (0), 0 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-03 15:26:11,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:26:11,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 15:26:11,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:26:24,807 INFO L124 PetriNetUnfolderBase]: 14936/33300 cut-off events. [2023-08-03 15:26:24,807 INFO L125 PetriNetUnfolderBase]: For 357113/357338 co-relation queries the response was YES. [2023-08-03 15:26:24,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176363 conditions, 33300 events. 14936/33300 cut-off events. For 357113/357338 co-relation queries the response was YES. Maximal size of possible extension queue 1381. Compared 360110 event pairs, 6331 based on Foata normal form. 412/31533 useless extension candidates. Maximal degree in co-relation 172831. Up to 11561 conditions per place. [2023-08-03 15:26:25,018 INFO L140 encePairwiseOnDemand]: 445/466 looper letters, 827 selfloop transitions, 272 changer transitions 488/1595 dead transitions. [2023-08-03 15:26:25,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 1595 transitions, 23184 flow [2023-08-03 15:26:25,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-08-03 15:26:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-08-03 15:26:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 6308 transitions. [2023-08-03 15:26:25,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33015806552915317 [2023-08-03 15:26:25,023 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 6308 transitions. [2023-08-03 15:26:25,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 6308 transitions. [2023-08-03 15:26:25,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:26:25,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 6308 transitions. [2023-08-03 15:26:25,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 153.85365853658536) internal successors, (6308), 41 states have internal predecessors, (6308), 0 states have call successors, (0), 0 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-03 15:26:25,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 466.0) internal successors, (19572), 42 states have internal predecessors, (19572), 0 states have call successors, (0), 0 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-03 15:26:25,039 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 466.0) internal successors, (19572), 42 states have internal predecessors, (19572), 0 states have call successors, (0), 0 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-03 15:26:25,039 INFO L175 Difference]: Start difference. First operand has 210 places, 647 transitions, 9186 flow. Second operand 41 states and 6308 transitions. [2023-08-03 15:26:25,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 1595 transitions, 23184 flow [2023-08-03 15:26:27,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 1595 transitions, 22607 flow, removed 109 selfloop flow, removed 2 redundant places. [2023-08-03 15:26:27,119 INFO L231 Difference]: Finished difference. Result has 268 places, 738 transitions, 11349 flow [2023-08-03 15:26:27,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=8887, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=11349, PETRI_PLACES=268, PETRI_TRANSITIONS=738} [2023-08-03 15:26:27,120 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 201 predicate places. [2023-08-03 15:26:27,120 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 738 transitions, 11349 flow [2023-08-03 15:26:27,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 140.31578947368422) internal successors, (2666), 19 states have internal predecessors, (2666), 0 states have call successors, (0), 0 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-03 15:26:27,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:26:27,121 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] [2023-08-03 15:26:27,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-03 15:26:27,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:26:27,321 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:26:27,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:26:27,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1337839369, now seen corresponding path program 1 times [2023-08-03 15:26:27,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:26:27,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803733203] [2023-08-03 15:26:27,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:26:27,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:26:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:26:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:26:27,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:26:27,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803733203] [2023-08-03 15:26:27,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803733203] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:26:27,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929542393] [2023-08-03 15:26:27,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:26:27,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:26:27,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:26:27,628 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-03 15:26:27,631 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-03 15:26:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:26:27,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-03 15:26:27,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:26:27,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:26:27,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:26:27,951 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:26:27,952 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:26:28,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:26:28,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:26:28,034 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:26:28,034 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:26:28,310 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:26:28,310 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 394 treesize of output 321 [2023-08-03 15:26:29,185 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:26:29,186 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 394 treesize of output 321 [2023-08-03 15:26:31,254 INFO L322 Elim1Store]: treesize reduction 863, result has 16.7 percent of original size [2023-08-03 15:26:31,255 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 367 treesize of output 347 [2023-08-03 15:26:33,015 INFO L322 Elim1Store]: treesize reduction 850, result has 18.0 percent of original size [2023-08-03 15:26:33,016 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 377 treesize of output 366 [2023-08-03 15:26:33,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:26:33,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:26:33,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:26:33,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929542393] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:26:33,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:26:33,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 11 [2023-08-03 15:26:33,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356399034] [2023-08-03 15:26:33,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:26:33,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 15:26:33,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:26:33,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 15:26:33,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-08-03 15:26:34,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 466 [2023-08-03 15:26:34,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 738 transitions, 11349 flow. Second operand has 13 states, 13 states have (on average 202.76923076923077) internal successors, (2636), 13 states have internal predecessors, (2636), 0 states have call successors, (0), 0 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-03 15:26:34,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:26:34,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 466 [2023-08-03 15:26:34,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:26:41,535 INFO L124 PetriNetUnfolderBase]: 11666/27191 cut-off events. [2023-08-03 15:26:41,535 INFO L125 PetriNetUnfolderBase]: For 393301/393925 co-relation queries the response was YES. [2023-08-03 15:26:41,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151683 conditions, 27191 events. 11666/27191 cut-off events. For 393301/393925 co-relation queries the response was YES. Maximal size of possible extension queue 1249. Compared 297293 event pairs, 5410 based on Foata normal form. 270/25462 useless extension candidates. Maximal degree in co-relation 149945. Up to 15833 conditions per place. [2023-08-03 15:26:41,785 INFO L140 encePairwiseOnDemand]: 453/466 looper letters, 647 selfloop transitions, 80 changer transitions 238/990 dead transitions. [2023-08-03 15:26:41,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 990 transitions, 15895 flow [2023-08-03 15:26:41,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-03 15:26:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-03 15:26:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2853 transitions. [2023-08-03 15:26:41,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47094750742819413 [2023-08-03 15:26:41,787 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2853 transitions. [2023-08-03 15:26:41,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2853 transitions. [2023-08-03 15:26:41,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:26:41,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2853 transitions. [2023-08-03 15:26:41,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 219.46153846153845) internal successors, (2853), 13 states have internal predecessors, (2853), 0 states have call successors, (0), 0 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-03 15:26:41,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 466.0) internal successors, (6524), 14 states have internal predecessors, (6524), 0 states have call successors, (0), 0 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-03 15:26:41,793 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 466.0) internal successors, (6524), 14 states have internal predecessors, (6524), 0 states have call successors, (0), 0 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-03 15:26:41,793 INFO L175 Difference]: Start difference. First operand has 268 places, 738 transitions, 11349 flow. Second operand 13 states and 2853 transitions. [2023-08-03 15:26:41,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 990 transitions, 15895 flow [2023-08-03 15:26:44,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 990 transitions, 15590 flow, removed 137 selfloop flow, removed 7 redundant places. [2023-08-03 15:26:44,464 INFO L231 Difference]: Finished difference. Result has 273 places, 683 transitions, 10538 flow [2023-08-03 15:26:44,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=11018, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10538, PETRI_PLACES=273, PETRI_TRANSITIONS=683} [2023-08-03 15:26:44,464 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 206 predicate places. [2023-08-03 15:26:44,464 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 683 transitions, 10538 flow [2023-08-03 15:26:44,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 202.76923076923077) internal successors, (2636), 13 states have internal predecessors, (2636), 0 states have call successors, (0), 0 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-03 15:26:44,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:26:44,465 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-03 15:26:44,468 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-03 15:26:44,665 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,SelfDestructingSolverStorable15 [2023-08-03 15:26:44,665 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:26:44,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:26:44,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1589092094, now seen corresponding path program 1 times [2023-08-03 15:26:44,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:26:44,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909883749] [2023-08-03 15:26:44,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:26:44,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:26:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:26:44,812 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-03 15:26:44,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:26:44,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909883749] [2023-08-03 15:26:44,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909883749] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:26:44,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:26:44,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-03 15:26:44,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866456556] [2023-08-03 15:26:44,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:26:44,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 15:26:44,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:26:44,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 15:26:44,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 15:26:44,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 466 [2023-08-03 15:26:44,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 683 transitions, 10538 flow. Second operand has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 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-03 15:26:44,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:26:44,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 466 [2023-08-03 15:26:44,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:26:49,647 INFO L124 PetriNetUnfolderBase]: 11039/24455 cut-off events. [2023-08-03 15:26:49,647 INFO L125 PetriNetUnfolderBase]: For 330958/331190 co-relation queries the response was YES. [2023-08-03 15:26:49,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138014 conditions, 24455 events. 11039/24455 cut-off events. For 330958/331190 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 251351 event pairs, 2268 based on Foata normal form. 158/22870 useless extension candidates. Maximal degree in co-relation 136428. Up to 9461 conditions per place. [2023-08-03 15:26:49,809 INFO L140 encePairwiseOnDemand]: 445/466 looper letters, 553 selfloop transitions, 275 changer transitions 39/875 dead transitions. [2023-08-03 15:26:49,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 875 transitions, 14388 flow [2023-08-03 15:26:49,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 15:26:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 15:26:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 925 transitions. [2023-08-03 15:26:49,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49624463519313305 [2023-08-03 15:26:49,810 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 925 transitions. [2023-08-03 15:26:49,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 925 transitions. [2023-08-03 15:26:49,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:26:49,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 925 transitions. [2023-08-03 15:26:49,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 231.25) internal successors, (925), 4 states have internal predecessors, (925), 0 states have call successors, (0), 0 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-03 15:26:49,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 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-03 15:26:49,812 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 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-03 15:26:49,812 INFO L175 Difference]: Start difference. First operand has 273 places, 683 transitions, 10538 flow. Second operand 4 states and 925 transitions. [2023-08-03 15:26:49,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 875 transitions, 14388 flow [2023-08-03 15:26:51,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 875 transitions, 14235 flow, removed 36 selfloop flow, removed 7 redundant places. [2023-08-03 15:26:51,981 INFO L231 Difference]: Finished difference. Result has 259 places, 685 transitions, 11318 flow [2023-08-03 15:26:51,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=9536, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=11318, PETRI_PLACES=259, PETRI_TRANSITIONS=685} [2023-08-03 15:26:51,982 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 192 predicate places. [2023-08-03 15:26:51,982 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 685 transitions, 11318 flow [2023-08-03 15:26:51,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 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-03 15:26:51,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:26:51,983 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-03 15:26:51,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-03 15:26:51,983 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:26:51,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:26:51,983 INFO L85 PathProgramCache]: Analyzing trace with hash 494463870, now seen corresponding path program 2 times [2023-08-03 15:26:51,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:26:51,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115374219] [2023-08-03 15:26:51,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:26:51,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:26:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:26:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:26:52,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:26:52,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115374219] [2023-08-03 15:26:52,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115374219] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:26:52,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739164800] [2023-08-03 15:26:52,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:26:52,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:26:52,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:26:52,124 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-03 15:26:52,126 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-03 15:26:52,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:26:52,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:26:52,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-03 15:26:52,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:26:52,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:26:52,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:26:52,517 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:26:52,517 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:26:52,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:26:52,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:26:52,588 INFO L322 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-08-03 15:26:52,588 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 1 [2023-08-03 15:26:52,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:26:52,699 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 141 [2023-08-03 15:26:52,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:26:52,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 141 [2023-08-03 15:26:53,433 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 15:26:53,811 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 15:26:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:26:54,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:26:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:26:54,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739164800] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:26:54,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:26:54,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-03 15:26:54,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574892848] [2023-08-03 15:26:54,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:26:54,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-03 15:26:54,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:26:54,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-03 15:26:54,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-08-03 15:26:54,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 466 [2023-08-03 15:26:54,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 685 transitions, 11318 flow. Second operand has 12 states, 12 states have (on average 205.33333333333334) internal successors, (2464), 12 states have internal predecessors, (2464), 0 states have call successors, (0), 0 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-03 15:26:54,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:26:54,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 466 [2023-08-03 15:26:54,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:26:59,349 INFO L124 PetriNetUnfolderBase]: 9254/21585 cut-off events. [2023-08-03 15:26:59,349 INFO L125 PetriNetUnfolderBase]: For 311481/312173 co-relation queries the response was YES. [2023-08-03 15:26:59,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122782 conditions, 21585 events. 9254/21585 cut-off events. For 311481/312173 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 225974 event pairs, 4491 based on Foata normal form. 334/20189 useless extension candidates. Maximal degree in co-relation 122006. Up to 13698 conditions per place. [2023-08-03 15:26:59,492 INFO L140 encePairwiseOnDemand]: 454/466 looper letters, 617 selfloop transitions, 62 changer transitions 248/958 dead transitions. [2023-08-03 15:26:59,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 958 transitions, 16377 flow [2023-08-03 15:26:59,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-03 15:26:59,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-03 15:26:59,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3066 transitions. [2023-08-03 15:26:59,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4699570815450644 [2023-08-03 15:26:59,495 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3066 transitions. [2023-08-03 15:26:59,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3066 transitions. [2023-08-03 15:26:59,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:26:59,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3066 transitions. [2023-08-03 15:26:59,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 219.0) internal successors, (3066), 14 states have internal predecessors, (3066), 0 states have call successors, (0), 0 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-03 15:26:59,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 466.0) internal successors, (6990), 15 states have internal predecessors, (6990), 0 states have call successors, (0), 0 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-03 15:26:59,501 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 466.0) internal successors, (6990), 15 states have internal predecessors, (6990), 0 states have call successors, (0), 0 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-03 15:26:59,501 INFO L175 Difference]: Start difference. First operand has 259 places, 685 transitions, 11318 flow. Second operand 14 states and 3066 transitions. [2023-08-03 15:26:59,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 958 transitions, 16377 flow [2023-08-03 15:27:01,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 958 transitions, 16217 flow, removed 66 selfloop flow, removed 3 redundant places. [2023-08-03 15:27:01,291 INFO L231 Difference]: Finished difference. Result has 278 places, 622 transitions, 10214 flow [2023-08-03 15:27:01,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=11177, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10214, PETRI_PLACES=278, PETRI_TRANSITIONS=622} [2023-08-03 15:27:01,292 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 211 predicate places. [2023-08-03 15:27:01,292 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 622 transitions, 10214 flow [2023-08-03 15:27:01,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 205.33333333333334) internal successors, (2464), 12 states have internal predecessors, (2464), 0 states have call successors, (0), 0 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-03 15:27:01,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:27:01,292 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] [2023-08-03 15:27:01,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-03 15:27:01,497 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,SelfDestructingSolverStorable17 [2023-08-03 15:27:01,497 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:27:01,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:27:01,498 INFO L85 PathProgramCache]: Analyzing trace with hash 884266030, now seen corresponding path program 2 times [2023-08-03 15:27:01,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:27:01,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219387033] [2023-08-03 15:27:01,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:27:01,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:27:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:27:01,913 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-03 15:27:01,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:27:01,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219387033] [2023-08-03 15:27:01,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219387033] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:27:01,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293683100] [2023-08-03 15:27:01,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:27:01,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:27:01,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:27:01,915 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-03 15:27:01,927 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-03 15:27:02,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:27:02,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:27:02,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-03 15:27:02,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:27:02,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:27:02,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:27:02,216 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:27:02,216 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:27:02,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:27:02,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:27:02,310 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:27:02,311 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:27:02,720 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:27:02,721 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 394 treesize of output 321 [2023-08-03 15:27:05,075 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:27:05,076 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 405 treesize of output 370 [2023-08-03 15:27:05,910 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:27:05,911 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 394 treesize of output 321 [2023-08-03 15:27:07,604 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:27:07,604 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 367 treesize of output 332 [2023-08-03 15:27:08,158 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-03 15:27:08,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:27:08,256 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_739 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_739))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (- 1) (select .cse1 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0)) is different from false [2023-08-03 15:27:08,263 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_739 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse2 |c_~#A~0.offset| (+ (select .cse2 |c_~#A~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_739))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (- 1) (select .cse1 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0)) is different from false [2023-08-03 15:27:08,293 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_736))) (store .cse2 |c_~#A~0.base| (let ((.cse3 (select .cse2 |c_~#A~0.base|))) (store .cse3 |c_~#A~0.offset| (+ (select .cse3 |c_~#A~0.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_739))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (- 1) (select .cse1 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0)) is different from false [2023-08-03 15:27:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-08-03 15:27:08,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293683100] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:27:08,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:27:08,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 19 [2023-08-03 15:27:08,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146329959] [2023-08-03 15:27:08,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:27:08,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-03 15:27:08,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:27:08,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-03 15:27:08,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=245, Unknown=7, NotChecked=102, Total=420 [2023-08-03 15:27:10,495 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-03 15:27:10,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 15:27:10,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 622 transitions, 10214 flow. Second operand has 21 states, 21 states have (on average 140.0) internal successors, (2940), 21 states have internal predecessors, (2940), 0 states have call successors, (0), 0 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-03 15:27:10,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:27:10,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 15:27:10,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:27:19,789 WARN L233 SmtUtils]: Spent 9.15s on a formula simplification. DAG size of input: 127 DAG size of output: 118 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:27:29,909 WARN L233 SmtUtils]: Spent 7.63s on a formula simplification. DAG size of input: 131 DAG size of output: 122 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:27:38,618 INFO L124 PetriNetUnfolderBase]: 9696/21937 cut-off events. [2023-08-03 15:27:38,618 INFO L125 PetriNetUnfolderBase]: For 285270/285414 co-relation queries the response was YES. [2023-08-03 15:27:38,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123543 conditions, 21937 events. 9696/21937 cut-off events. For 285270/285414 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 223742 event pairs, 4553 based on Foata normal form. 184/20349 useless extension candidates. Maximal degree in co-relation 123107. Up to 9726 conditions per place. [2023-08-03 15:27:38,750 INFO L140 encePairwiseOnDemand]: 443/466 looper letters, 729 selfloop transitions, 213 changer transitions 178/1128 dead transitions. [2023-08-03 15:27:38,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 1128 transitions, 18724 flow [2023-08-03 15:27:38,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-03 15:27:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-03 15:27:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 4363 transitions. [2023-08-03 15:27:38,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3228503773864141 [2023-08-03 15:27:38,754 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 4363 transitions. [2023-08-03 15:27:38,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 4363 transitions. [2023-08-03 15:27:38,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:27:38,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 4363 transitions. [2023-08-03 15:27:38,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 150.44827586206895) internal successors, (4363), 29 states have internal predecessors, (4363), 0 states have call successors, (0), 0 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-03 15:27:38,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 466.0) internal successors, (13980), 30 states have internal predecessors, (13980), 0 states have call successors, (0), 0 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-03 15:27:38,764 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 466.0) internal successors, (13980), 30 states have internal predecessors, (13980), 0 states have call successors, (0), 0 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-03 15:27:38,764 INFO L175 Difference]: Start difference. First operand has 278 places, 622 transitions, 10214 flow. Second operand 29 states and 4363 transitions. [2023-08-03 15:27:38,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 1128 transitions, 18724 flow [2023-08-03 15:27:40,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 1128 transitions, 18325 flow, removed 160 selfloop flow, removed 12 redundant places. [2023-08-03 15:27:40,310 INFO L231 Difference]: Finished difference. Result has 303 places, 676 transitions, 11432 flow [2023-08-03 15:27:40,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=9694, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=11432, PETRI_PLACES=303, PETRI_TRANSITIONS=676} [2023-08-03 15:27:40,310 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 236 predicate places. [2023-08-03 15:27:40,310 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 676 transitions, 11432 flow [2023-08-03 15:27:40,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 140.0) internal successors, (2940), 21 states have internal predecessors, (2940), 0 states have call successors, (0), 0 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-03 15:27:40,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:27:40,311 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] [2023-08-03 15:27:40,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-03 15:27:40,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:27:40,511 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:27:40,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:27:40,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1693468904, now seen corresponding path program 1 times [2023-08-03 15:27:40,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:27:40,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968439375] [2023-08-03 15:27:40,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:27:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:27:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:27:40,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 15:27:40,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:27:40,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968439375] [2023-08-03 15:27:40,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968439375] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:27:40,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:27:40,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 15:27:40,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251105854] [2023-08-03 15:27:40,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:27:40,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 15:27:40,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:27:40,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 15:27:40,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 15:27:40,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 466 [2023-08-03 15:27:40,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 676 transitions, 11432 flow. Second operand has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 15:27:40,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:27:40,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 466 [2023-08-03 15:27:40,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:27:44,999 INFO L124 PetriNetUnfolderBase]: 8724/19633 cut-off events. [2023-08-03 15:27:44,999 INFO L125 PetriNetUnfolderBase]: For 218644/218872 co-relation queries the response was YES. [2023-08-03 15:27:45,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108822 conditions, 19633 events. 8724/19633 cut-off events. For 218644/218872 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 198339 event pairs, 2387 based on Foata normal form. 313/18754 useless extension candidates. Maximal degree in co-relation 108533. Up to 10750 conditions per place. [2023-08-03 15:27:45,113 INFO L140 encePairwiseOnDemand]: 446/466 looper letters, 692 selfloop transitions, 136 changer transitions 32/868 dead transitions. [2023-08-03 15:27:45,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 868 transitions, 16104 flow [2023-08-03 15:27:45,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 15:27:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 15:27:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 882 transitions. [2023-08-03 15:27:45,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47317596566523606 [2023-08-03 15:27:45,114 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 882 transitions. [2023-08-03 15:27:45,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 882 transitions. [2023-08-03 15:27:45,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:27:45,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 882 transitions. [2023-08-03 15:27:45,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 220.5) internal successors, (882), 4 states have internal predecessors, (882), 0 states have call successors, (0), 0 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-03 15:27:45,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 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-03 15:27:45,116 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 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-03 15:27:45,117 INFO L175 Difference]: Start difference. First operand has 303 places, 676 transitions, 11432 flow. Second operand 4 states and 882 transitions. [2023-08-03 15:27:45,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 868 transitions, 16104 flow [2023-08-03 15:27:46,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 868 transitions, 15381 flow, removed 237 selfloop flow, removed 9 redundant places. [2023-08-03 15:27:46,083 INFO L231 Difference]: Finished difference. Result has 294 places, 671 transitions, 11178 flow [2023-08-03 15:27:46,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=10812, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=11178, PETRI_PLACES=294, PETRI_TRANSITIONS=671} [2023-08-03 15:27:46,084 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 227 predicate places. [2023-08-03 15:27:46,084 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 671 transitions, 11178 flow [2023-08-03 15:27:46,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 15:27:46,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:27:46,084 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] [2023-08-03 15:27:46,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-03 15:27:46,084 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:27:46,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:27:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1597450992, now seen corresponding path program 1 times [2023-08-03 15:27:46,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:27:46,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487170572] [2023-08-03 15:27:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:27:46,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:27:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:27:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:27:46,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:27:46,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487170572] [2023-08-03 15:27:46,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487170572] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:27:46,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:27:46,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-03 15:27:46,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855296813] [2023-08-03 15:27:46,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:27:46,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 15:27:46,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:27:46,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 15:27:46,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-03 15:27:46,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 466 [2023-08-03 15:27:46,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 671 transitions, 11178 flow. Second operand has 7 states, 7 states have (on average 190.0) internal successors, (1330), 7 states have internal predecessors, (1330), 0 states have call successors, (0), 0 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-03 15:27:46,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:27:46,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 466 [2023-08-03 15:27:46,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:27:52,323 INFO L124 PetriNetUnfolderBase]: 11304/25134 cut-off events. [2023-08-03 15:27:52,323 INFO L125 PetriNetUnfolderBase]: For 290719/291001 co-relation queries the response was YES. [2023-08-03 15:27:52,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140981 conditions, 25134 events. 11304/25134 cut-off events. For 290719/291001 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 259756 event pairs, 1273 based on Foata normal form. 468/24056 useless extension candidates. Maximal degree in co-relation 140727. Up to 6544 conditions per place. [2023-08-03 15:27:52,506 INFO L140 encePairwiseOnDemand]: 442/466 looper letters, 699 selfloop transitions, 535 changer transitions 120/1362 dead transitions. [2023-08-03 15:27:52,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 1362 transitions, 23270 flow [2023-08-03 15:27:52,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-03 15:27:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-03 15:27:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2401 transitions. [2023-08-03 15:27:52,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46839641045649627 [2023-08-03 15:27:52,509 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2401 transitions. [2023-08-03 15:27:52,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2401 transitions. [2023-08-03 15:27:52,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:27:52,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2401 transitions. [2023-08-03 15:27:52,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 218.27272727272728) internal successors, (2401), 11 states have internal predecessors, (2401), 0 states have call successors, (0), 0 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-03 15:27:52,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 466.0) internal successors, (5592), 12 states have internal predecessors, (5592), 0 states have call successors, (0), 0 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-03 15:27:52,514 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 466.0) internal successors, (5592), 12 states have internal predecessors, (5592), 0 states have call successors, (0), 0 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-03 15:27:52,514 INFO L175 Difference]: Start difference. First operand has 294 places, 671 transitions, 11178 flow. Second operand 11 states and 2401 transitions. [2023-08-03 15:27:52,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 1362 transitions, 23270 flow [2023-08-03 15:27:53,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 1362 transitions, 23019 flow, removed 25 selfloop flow, removed 2 redundant places. [2023-08-03 15:27:53,973 INFO L231 Difference]: Finished difference. Result has 304 places, 865 transitions, 16114 flow [2023-08-03 15:27:53,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=10920, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=342, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=16114, PETRI_PLACES=304, PETRI_TRANSITIONS=865} [2023-08-03 15:27:53,974 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 237 predicate places. [2023-08-03 15:27:53,974 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 865 transitions, 16114 flow [2023-08-03 15:27:53,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 190.0) internal successors, (1330), 7 states have internal predecessors, (1330), 0 states have call successors, (0), 0 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-03 15:27:53,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:27:53,975 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] [2023-08-03 15:27:53,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-03 15:27:53,975 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:27:53,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:27:53,975 INFO L85 PathProgramCache]: Analyzing trace with hash 799031408, now seen corresponding path program 2 times [2023-08-03 15:27:53,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:27:53,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144658631] [2023-08-03 15:27:53,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:27:53,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:27:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:27:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 15:27:54,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:27:54,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144658631] [2023-08-03 15:27:54,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144658631] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:27:54,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:27:54,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-03 15:27:54,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514784671] [2023-08-03 15:27:54,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:27:54,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 15:27:54,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:27:54,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 15:27:54,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-08-03 15:27:54,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 466 [2023-08-03 15:27:54,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 865 transitions, 16114 flow. Second operand has 7 states, 7 states have (on average 190.85714285714286) internal successors, (1336), 7 states have internal predecessors, (1336), 0 states have call successors, (0), 0 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-03 15:27:54,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:27:54,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 466 [2023-08-03 15:27:54,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:27:59,838 INFO L124 PetriNetUnfolderBase]: 10130/23139 cut-off events. [2023-08-03 15:27:59,838 INFO L125 PetriNetUnfolderBase]: For 296312/296516 co-relation queries the response was YES. [2023-08-03 15:27:59,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132558 conditions, 23139 events. 10130/23139 cut-off events. For 296312/296516 co-relation queries the response was YES. Maximal size of possible extension queue 1101. Compared 239837 event pairs, 1623 based on Foata normal form. 442/22054 useless extension candidates. Maximal degree in co-relation 132297. Up to 12615 conditions per place. [2023-08-03 15:27:59,996 INFO L140 encePairwiseOnDemand]: 442/466 looper letters, 513 selfloop transitions, 527 changer transitions 48/1096 dead transitions. [2023-08-03 15:27:59,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 1096 transitions, 21123 flow [2023-08-03 15:27:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-03 15:27:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-03 15:27:59,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1689 transitions. [2023-08-03 15:27:59,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4530579399141631 [2023-08-03 15:27:59,998 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1689 transitions. [2023-08-03 15:27:59,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1689 transitions. [2023-08-03 15:27:59,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:27:59,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1689 transitions. [2023-08-03 15:28:00,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 211.125) internal successors, (1689), 8 states have internal predecessors, (1689), 0 states have call successors, (0), 0 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-03 15:28:00,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 466.0) internal successors, (4194), 9 states have internal predecessors, (4194), 0 states have call successors, (0), 0 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-03 15:28:00,001 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 466.0) internal successors, (4194), 9 states have internal predecessors, (4194), 0 states have call successors, (0), 0 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-03 15:28:00,001 INFO L175 Difference]: Start difference. First operand has 304 places, 865 transitions, 16114 flow. Second operand 8 states and 1689 transitions. [2023-08-03 15:28:00,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 1096 transitions, 21123 flow [2023-08-03 15:28:01,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 1096 transitions, 20596 flow, removed 258 selfloop flow, removed 1 redundant places. [2023-08-03 15:28:01,720 INFO L231 Difference]: Finished difference. Result has 311 places, 888 transitions, 17456 flow [2023-08-03 15:28:01,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=15508, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=477, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17456, PETRI_PLACES=311, PETRI_TRANSITIONS=888} [2023-08-03 15:28:01,721 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 244 predicate places. [2023-08-03 15:28:01,721 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 888 transitions, 17456 flow [2023-08-03 15:28:01,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 190.85714285714286) internal successors, (1336), 7 states have internal predecessors, (1336), 0 states have call successors, (0), 0 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-03 15:28:01,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:28:01,721 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-03 15:28:01,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-03 15:28:01,721 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:28:01,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:28:01,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2029081871, now seen corresponding path program 1 times [2023-08-03 15:28:01,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:28:01,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71844705] [2023-08-03 15:28:01,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:28:01,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:28:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:28:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:28:01,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:28:01,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71844705] [2023-08-03 15:28:01,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71844705] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:28:01,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:28:01,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-03 15:28:01,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342341870] [2023-08-03 15:28:01,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:28:01,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-03 15:28:01,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:28:01,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-03 15:28:01,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-03 15:28:02,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 466 [2023-08-03 15:28:02,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 888 transitions, 17456 flow. Second operand has 6 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 0 states have call successors, (0), 0 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-03 15:28:02,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:28:02,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 466 [2023-08-03 15:28:02,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:28:06,215 INFO L124 PetriNetUnfolderBase]: 6111/15741 cut-off events. [2023-08-03 15:28:06,215 INFO L125 PetriNetUnfolderBase]: For 219416/219538 co-relation queries the response was YES. [2023-08-03 15:28:06,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90454 conditions, 15741 events. 6111/15741 cut-off events. For 219416/219538 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 165848 event pairs, 2011 based on Foata normal form. 284/14856 useless extension candidates. Maximal degree in co-relation 90316. Up to 7396 conditions per place. [2023-08-03 15:28:06,314 INFO L140 encePairwiseOnDemand]: 459/466 looper letters, 480 selfloop transitions, 302 changer transitions 38/865 dead transitions. [2023-08-03 15:28:06,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 865 transitions, 17196 flow [2023-08-03 15:28:06,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 15:28:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 15:28:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1167 transitions. [2023-08-03 15:28:06,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008583690987124 [2023-08-03 15:28:06,318 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1167 transitions. [2023-08-03 15:28:06,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1167 transitions. [2023-08-03 15:28:06,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:28:06,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1167 transitions. [2023-08-03 15:28:06,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 233.4) internal successors, (1167), 5 states have internal predecessors, (1167), 0 states have call successors, (0), 0 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-03 15:28:06,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 0 states have call successors, (0), 0 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-03 15:28:06,320 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 0 states have call successors, (0), 0 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-03 15:28:06,320 INFO L175 Difference]: Start difference. First operand has 311 places, 888 transitions, 17456 flow. Second operand 5 states and 1167 transitions. [2023-08-03 15:28:06,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 865 transitions, 17196 flow [2023-08-03 15:28:07,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 865 transitions, 15513 flow, removed 108 selfloop flow, removed 13 redundant places. [2023-08-03 15:28:07,387 INFO L231 Difference]: Finished difference. Result has 299 places, 735 transitions, 13107 flow [2023-08-03 15:28:07,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=12674, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=302, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=13107, PETRI_PLACES=299, PETRI_TRANSITIONS=735} [2023-08-03 15:28:07,388 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 232 predicate places. [2023-08-03 15:28:07,388 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 735 transitions, 13107 flow [2023-08-03 15:28:07,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 0 states have call successors, (0), 0 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-03 15:28:07,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:28:07,388 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-03 15:28:07,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-03 15:28:07,389 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:28:07,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:28:07,389 INFO L85 PathProgramCache]: Analyzing trace with hash 200111486, now seen corresponding path program 1 times [2023-08-03 15:28:07,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:28:07,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219134760] [2023-08-03 15:28:07,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:28:07,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:28:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:28:07,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:28:07,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:28:07,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219134760] [2023-08-03 15:28:07,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219134760] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:28:07,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700361230] [2023-08-03 15:28:07,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:28:07,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:28:07,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:28:07,680 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-03 15:28:07,681 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-03 15:28:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:28:07,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-03 15:28:07,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:28:07,996 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 9 treesize of output 11 [2023-08-03 15:28:08,012 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 9 treesize of output 11 [2023-08-03 15:28:08,149 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 15:28:08,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:28:08,218 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 16 treesize of output 18 [2023-08-03 15:28:08,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:28:08,360 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 16 treesize of output 18 [2023-08-03 15:28:08,410 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:28:08,413 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:28:08,413 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 17 treesize of output 11 [2023-08-03 15:28:08,466 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-03 15:28:08,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:28:08,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:28:08,570 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 8 treesize of output 4 [2023-08-03 15:28:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:28:08,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700361230] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:28:08,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:28:08,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-08-03 15:28:08,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749448164] [2023-08-03 15:28:08,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:28:08,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-03 15:28:08,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:28:08,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-03 15:28:08,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=219, Unknown=2, NotChecked=0, Total=306 [2023-08-03 15:28:09,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 466 [2023-08-03 15:28:09,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 735 transitions, 13107 flow. Second operand has 18 states, 18 states have (on average 156.16666666666666) internal successors, (2811), 18 states have internal predecessors, (2811), 0 states have call successors, (0), 0 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-03 15:28:09,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:28:09,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 466 [2023-08-03 15:28:09,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:28:14,308 INFO L124 PetriNetUnfolderBase]: 5784/15010 cut-off events. [2023-08-03 15:28:14,308 INFO L125 PetriNetUnfolderBase]: For 162574/162694 co-relation queries the response was YES. [2023-08-03 15:28:14,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80993 conditions, 15010 events. 5784/15010 cut-off events. For 162574/162694 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 155044 event pairs, 2465 based on Foata normal form. 262/14264 useless extension candidates. Maximal degree in co-relation 80787. Up to 5515 conditions per place. [2023-08-03 15:28:14,384 INFO L140 encePairwiseOnDemand]: 448/466 looper letters, 491 selfloop transitions, 327 changer transitions 188/1014 dead transitions. [2023-08-03 15:28:14,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 1014 transitions, 17678 flow [2023-08-03 15:28:14,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-03 15:28:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-03 15:28:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3561 transitions. [2023-08-03 15:28:14,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3638871857755978 [2023-08-03 15:28:14,387 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3561 transitions. [2023-08-03 15:28:14,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3561 transitions. [2023-08-03 15:28:14,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:28:14,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3561 transitions. [2023-08-03 15:28:14,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 169.57142857142858) internal successors, (3561), 21 states have internal predecessors, (3561), 0 states have call successors, (0), 0 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-03 15:28:14,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 466.0) internal successors, (10252), 22 states have internal predecessors, (10252), 0 states have call successors, (0), 0 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-03 15:28:14,395 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 466.0) internal successors, (10252), 22 states have internal predecessors, (10252), 0 states have call successors, (0), 0 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-03 15:28:14,395 INFO L175 Difference]: Start difference. First operand has 299 places, 735 transitions, 13107 flow. Second operand 21 states and 3561 transitions. [2023-08-03 15:28:14,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 1014 transitions, 17678 flow [2023-08-03 15:28:15,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 1014 transitions, 17158 flow, removed 56 selfloop flow, removed 8 redundant places. [2023-08-03 15:28:15,045 INFO L231 Difference]: Finished difference. Result has 318 places, 660 transitions, 12369 flow [2023-08-03 15:28:15,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=11575, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=290, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=12369, PETRI_PLACES=318, PETRI_TRANSITIONS=660} [2023-08-03 15:28:15,046 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 251 predicate places. [2023-08-03 15:28:15,046 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 660 transitions, 12369 flow [2023-08-03 15:28:15,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 156.16666666666666) internal successors, (2811), 18 states have internal predecessors, (2811), 0 states have call successors, (0), 0 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-03 15:28:15,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:28:15,046 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-03 15:28:15,050 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-03 15:28:15,247 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,SelfDestructingSolverStorable23 [2023-08-03 15:28:15,248 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:28:15,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:28:15,248 INFO L85 PathProgramCache]: Analyzing trace with hash -499678267, now seen corresponding path program 2 times [2023-08-03 15:28:15,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:28:15,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432029571] [2023-08-03 15:28:15,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:28:15,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:28:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:28:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 15:28:15,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:28:15,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432029571] [2023-08-03 15:28:15,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432029571] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:28:15,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:28:15,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-03 15:28:15,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74551169] [2023-08-03 15:28:15,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:28:15,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-03 15:28:15,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:28:15,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-03 15:28:15,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-03 15:28:15,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 466 [2023-08-03 15:28:15,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 660 transitions, 12369 flow. Second operand has 6 states, 6 states have (on average 190.5) internal successors, (1143), 6 states have internal predecessors, (1143), 0 states have call successors, (0), 0 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-03 15:28:15,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:28:15,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 466 [2023-08-03 15:28:15,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:28:19,016 INFO L124 PetriNetUnfolderBase]: 5147/13708 cut-off events. [2023-08-03 15:28:19,017 INFO L125 PetriNetUnfolderBase]: For 149321/149449 co-relation queries the response was YES. [2023-08-03 15:28:19,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75480 conditions, 13708 events. 5147/13708 cut-off events. For 149321/149449 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 141817 event pairs, 2387 based on Foata normal form. 116/12855 useless extension candidates. Maximal degree in co-relation 75272. Up to 4889 conditions per place. [2023-08-03 15:28:19,092 INFO L140 encePairwiseOnDemand]: 450/466 looper letters, 570 selfloop transitions, 238 changer transitions 29/845 dead transitions. [2023-08-03 15:28:19,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 845 transitions, 16174 flow [2023-08-03 15:28:19,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 15:28:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 15:28:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1329 transitions. [2023-08-03 15:28:19,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47532188841201717 [2023-08-03 15:28:19,094 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1329 transitions. [2023-08-03 15:28:19,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1329 transitions. [2023-08-03 15:28:19,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:28:19,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1329 transitions. [2023-08-03 15:28:19,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 221.5) internal successors, (1329), 6 states have internal predecessors, (1329), 0 states have call successors, (0), 0 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-03 15:28:19,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 466.0) internal successors, (3262), 7 states have internal predecessors, (3262), 0 states have call successors, (0), 0 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-03 15:28:19,097 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 466.0) internal successors, (3262), 7 states have internal predecessors, (3262), 0 states have call successors, (0), 0 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-03 15:28:19,097 INFO L175 Difference]: Start difference. First operand has 318 places, 660 transitions, 12369 flow. Second operand 6 states and 1329 transitions. [2023-08-03 15:28:19,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 845 transitions, 16174 flow [2023-08-03 15:28:19,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 845 transitions, 15901 flow, removed 59 selfloop flow, removed 13 redundant places. [2023-08-03 15:28:19,706 INFO L231 Difference]: Finished difference. Result has 303 places, 665 transitions, 13099 flow [2023-08-03 15:28:19,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=12044, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=217, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13099, PETRI_PLACES=303, PETRI_TRANSITIONS=665} [2023-08-03 15:28:19,706 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 236 predicate places. [2023-08-03 15:28:19,706 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 665 transitions, 13099 flow [2023-08-03 15:28:19,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 190.5) internal successors, (1143), 6 states have internal predecessors, (1143), 0 states have call successors, (0), 0 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-03 15:28:19,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:28:19,707 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-03 15:28:19,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-03 15:28:19,707 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:28:19,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:28:19,707 INFO L85 PathProgramCache]: Analyzing trace with hash 299819849, now seen corresponding path program 3 times [2023-08-03 15:28:19,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:28:19,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836193721] [2023-08-03 15:28:19,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:28:19,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:28:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:28:19,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 15:28:19,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:28:19,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836193721] [2023-08-03 15:28:19,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836193721] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:28:19,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:28:19,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-03 15:28:19,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205760605] [2023-08-03 15:28:19,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:28:19,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-03 15:28:19,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:28:19,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-03 15:28:19,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-03 15:28:20,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 466 [2023-08-03 15:28:20,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 665 transitions, 13099 flow. Second operand has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 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-03 15:28:20,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:28:20,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 466 [2023-08-03 15:28:20,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:28:22,639 INFO L124 PetriNetUnfolderBase]: 3795/11029 cut-off events. [2023-08-03 15:28:22,640 INFO L125 PetriNetUnfolderBase]: For 136704/136761 co-relation queries the response was YES. [2023-08-03 15:28:22,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62593 conditions, 11029 events. 3795/11029 cut-off events. For 136704/136761 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 115860 event pairs, 1720 based on Foata normal form. 85/10215 useless extension candidates. Maximal degree in co-relation 62445. Up to 3644 conditions per place. [2023-08-03 15:28:22,698 INFO L140 encePairwiseOnDemand]: 459/466 looper letters, 485 selfloop transitions, 214 changer transitions 23/764 dead transitions. [2023-08-03 15:28:22,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 764 transitions, 15249 flow [2023-08-03 15:28:22,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 15:28:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 15:28:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1384 transitions. [2023-08-03 15:28:22,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4949928469241774 [2023-08-03 15:28:22,699 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1384 transitions. [2023-08-03 15:28:22,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1384 transitions. [2023-08-03 15:28:22,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:28:22,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1384 transitions. [2023-08-03 15:28:22,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 230.66666666666666) internal successors, (1384), 6 states have internal predecessors, (1384), 0 states have call successors, (0), 0 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-03 15:28:22,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 466.0) internal successors, (3262), 7 states have internal predecessors, (3262), 0 states have call successors, (0), 0 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-03 15:28:22,702 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 466.0) internal successors, (3262), 7 states have internal predecessors, (3262), 0 states have call successors, (0), 0 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-03 15:28:22,702 INFO L175 Difference]: Start difference. First operand has 303 places, 665 transitions, 13099 flow. Second operand 6 states and 1384 transitions. [2023-08-03 15:28:22,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 764 transitions, 15249 flow [2023-08-03 15:28:23,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 764 transitions, 14684 flow, removed 82 selfloop flow, removed 4 redundant places. [2023-08-03 15:28:23,150 INFO L231 Difference]: Finished difference. Result has 302 places, 619 transitions, 12063 flow [2023-08-03 15:28:23,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=11935, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12063, PETRI_PLACES=302, PETRI_TRANSITIONS=619} [2023-08-03 15:28:23,150 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 235 predicate places. [2023-08-03 15:28:23,150 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 619 transitions, 12063 flow [2023-08-03 15:28:23,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 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-03 15:28:23,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:28:23,151 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-03 15:28:23,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-03 15:28:23,151 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:28:23,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:28:23,151 INFO L85 PathProgramCache]: Analyzing trace with hash -640583123, now seen corresponding path program 1 times [2023-08-03 15:28:23,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:28:23,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891021263] [2023-08-03 15:28:23,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:28:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:28:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:28:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:28:23,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:28:23,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891021263] [2023-08-03 15:28:23,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891021263] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:28:23,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544732873] [2023-08-03 15:28:23,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:28:23,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:28:23,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:28:23,613 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:28:23,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-03 15:28:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:28:23,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-03 15:28:23,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:28:23,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:28:23,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:28:23,983 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:28:23,984 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:28:24,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:28:24,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:28:24,079 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:28:24,079 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:28:24,396 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:28:24,396 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 394 treesize of output 321 [2023-08-03 15:28:25,266 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:28:25,268 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 394 treesize of output 321 [2023-08-03 15:28:27,353 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:28:27,353 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 367 treesize of output 332 [2023-08-03 15:28:28,619 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:28:28,619 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 367 treesize of output 332 [2023-08-03 15:28:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:28:29,856 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:28:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:28:29,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544732873] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:28:29,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:28:29,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 17 [2023-08-03 15:28:29,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329337332] [2023-08-03 15:28:29,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:28:29,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-03 15:28:29,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:28:29,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-03 15:28:29,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=266, Unknown=3, NotChecked=0, Total=342 [2023-08-03 15:28:31,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 466 [2023-08-03 15:28:31,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 619 transitions, 12063 flow. Second operand has 19 states, 19 states have (on average 175.31578947368422) internal successors, (3331), 19 states have internal predecessors, (3331), 0 states have call successors, (0), 0 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-03 15:28:31,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:28:31,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 466 [2023-08-03 15:28:31,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:28:34,808 INFO L124 PetriNetUnfolderBase]: 3695/10653 cut-off events. [2023-08-03 15:28:34,808 INFO L125 PetriNetUnfolderBase]: For 122172/122222 co-relation queries the response was YES. [2023-08-03 15:28:34,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59080 conditions, 10653 events. 3695/10653 cut-off events. For 122172/122222 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 110585 event pairs, 1851 based on Foata normal form. 9/9804 useless extension candidates. Maximal degree in co-relation 58985. Up to 6512 conditions per place. [2023-08-03 15:28:34,864 INFO L140 encePairwiseOnDemand]: 454/466 looper letters, 557 selfloop transitions, 47 changer transitions 98/744 dead transitions. [2023-08-03 15:28:34,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 744 transitions, 15242 flow [2023-08-03 15:28:34,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-03 15:28:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-03 15:28:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2380 transitions. [2023-08-03 15:28:34,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39286893364146586 [2023-08-03 15:28:34,867 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2380 transitions. [2023-08-03 15:28:34,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2380 transitions. [2023-08-03 15:28:34,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:28:34,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2380 transitions. [2023-08-03 15:28:34,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 0 states have call successors, (0), 0 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-03 15:28:34,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 466.0) internal successors, (6524), 14 states have internal predecessors, (6524), 0 states have call successors, (0), 0 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-03 15:28:34,872 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 466.0) internal successors, (6524), 14 states have internal predecessors, (6524), 0 states have call successors, (0), 0 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-03 15:28:34,872 INFO L175 Difference]: Start difference. First operand has 302 places, 619 transitions, 12063 flow. Second operand 13 states and 2380 transitions. [2023-08-03 15:28:34,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 744 transitions, 15242 flow [2023-08-03 15:28:35,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 744 transitions, 14849 flow, removed 12 selfloop flow, removed 11 redundant places. [2023-08-03 15:28:35,264 INFO L231 Difference]: Finished difference. Result has 299 places, 607 transitions, 11617 flow [2023-08-03 15:28:35,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=11692, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=11617, PETRI_PLACES=299, PETRI_TRANSITIONS=607} [2023-08-03 15:28:35,264 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 232 predicate places. [2023-08-03 15:28:35,264 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 607 transitions, 11617 flow [2023-08-03 15:28:35,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 175.31578947368422) internal successors, (3331), 19 states have internal predecessors, (3331), 0 states have call successors, (0), 0 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-03 15:28:35,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:28:35,265 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:28:35,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-03 15:28:35,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-03 15:28:35,465 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:28:35,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:28:35,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1215222717, now seen corresponding path program 1 times [2023-08-03 15:28:35,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:28:35,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507817689] [2023-08-03 15:28:35,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:28:35,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:28:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:28:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:28:36,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:28:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507817689] [2023-08-03 15:28:36,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507817689] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:28:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720984532] [2023-08-03 15:28:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:28:36,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:28:36,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:28:36,020 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:28:36,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-03 15:28:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:28:36,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-03 15:28:36,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:28:36,355 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 9 treesize of output 11 [2023-08-03 15:28:36,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:28:36,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:28:36,399 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:28:36,399 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:28:36,462 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 9 treesize of output 11 [2023-08-03 15:28:36,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:28:36,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:28:36,511 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:28:36,512 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:28:36,837 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:28:36,838 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:28:37,831 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:28:37,832 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:28:38,369 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 15:28:39,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:28:39,460 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 16 treesize of output 18 [2023-08-03 15:28:41,291 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:28:41,291 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 379 treesize of output 344 [2023-08-03 15:28:41,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:28:41,822 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 16 treesize of output 18 [2023-08-03 15:28:41,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:28:41,910 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 16 treesize of output 18 [2023-08-03 15:28:42,975 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:28:42,975 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 373 treesize of output 338 [2023-08-03 15:28:43,452 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:28:43,457 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:28:43,457 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 17 treesize of output 11 [2023-08-03 15:28:44,305 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 15:28:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:28:44,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:28:44,491 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1170) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 15:28:44,579 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1170 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1170) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (forall ((v_ArrVal_1167 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1167) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) is different from false [2023-08-03 15:28:44,741 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1160))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (select .cse1 |c_~#A~0.offset|))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1170) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (forall ((v_ArrVal_1167 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_1167) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) is different from false [2023-08-03 15:28:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-03 15:28:44,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720984532] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:28:44,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:28:44,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2023-08-03 15:28:44,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039665020] [2023-08-03 15:28:44,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:28:44,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-03 15:28:44,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:28:44,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-03 15:28:44,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=618, Unknown=14, NotChecked=162, Total=930 [2023-08-03 15:28:44,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 15:28:44,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 607 transitions, 11617 flow. Second operand has 31 states, 31 states have (on average 139.5483870967742) internal successors, (4326), 31 states have internal predecessors, (4326), 0 states have call successors, (0), 0 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-03 15:28:44,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:28:44,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 15:28:44,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:28:45,656 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1170 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1170) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (forall ((v_ArrVal_1167 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1167) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (let ((.cse29 (select |c_#memory_int| 1)) (.cse28 (select |c_#memory_int| 4)) (.cse31 (select |c_#memory_int| 3)) (.cse30 (select |c_#memory_int| 5))) (let ((.cse1 (= (select .cse30 16) 0)) (.cse2 (= (select .cse30 8) 0)) (.cse3 (= (select .cse31 4) 0)) (.cse4 (= (select .cse28 12) 0)) (.cse5 (= (select .cse31 16) 0)) (.cse6 (= (select .cse31 8) 0)) (.cse7 (= (select .cse28 4) 0)) (.cse8 (= |c_ULTIMATE.start_main_~m~0#1.offset| 12)) (.cse9 (= (select .cse31 0) 0)) (.cse10 (= (select .cse28 20) 0)) (.cse11 (= 0 (select .cse30 20))) (.cse12 (= |c_~#A~0.offset| 0)) (.cse13 (= (select .cse30 4) 0)) (.cse14 (= (select .cse28 0) 1)) (.cse15 (= (select .cse29 1) 0)) (.cse16 (= (select .cse28 16) 0)) (.cse17 (= (select .cse28 8) 0)) (.cse18 (= (select .cse31 12) 0)) (.cse19 (= (select .cse30 12) 0)) (.cse20 (= 3 |c_~#__global_lock~0.base|)) (.cse21 (= (select .cse30 0) 0)) (.cse22 (= |c_~#A~0.base| 4)) (.cse23 (= (select .cse30 28) 0)) (.cse24 (= (select .cse30 24) 0)) (.cse25 (= (select .cse28 28) 0)) (.cse26 (= 48 (select .cse29 0))) (.cse27 (= (select .cse28 24) 0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |c_ULTIMATE.start_main_~m~0#1.base| 4) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= |c_ULTIMATE.start_main_~d~0#1.base| 4) .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |c_ULTIMATE.start_main_~m~0#1.base| 5) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |c_ULTIMATE.start_main_~d~0#1.base| 5) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27)))) (= (select (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12)) 1)) is different from false [2023-08-03 15:28:49,527 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (.cse1 (select |c_#memory_int| 3)) (.cse5 (select |c_#memory_int| 1)) (.cse2 (select |c_#memory_int| 4)) (.cse4 (= (select .cse3 |c_~#A~0.offset|) 0))) (and .cse0 (= (select .cse1 4) 0) (= (select .cse2 12) 0) (or (forall ((v_ArrVal_1167 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1167) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_1170 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse3 |c_~#A~0.offset| |c_t_funThread1of2ForFork0_#t~mem6#1|)) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1170) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (= (select .cse1 16) 0) (= (select .cse1 8) 0) (= (select .cse2 4) 0) (= (select .cse1 0) 0) (= (select .cse2 0) 0) (= (select .cse2 20) 0) (or (and .cse0 (not (= |c_~#A~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) .cse4) (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) (<= (+ |c_~#A~0.offset| 12) |c_ULTIMATE.start_main_~m~0#1.offset|) (< |c_ULTIMATE.start_main_~m~0#1.offset| (+ |c_~#A~0.offset| 13)) (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|))) (= |c_~#A~0.offset| 0) (= (select .cse5 1) 0) (= (select .cse2 16) 0) (= (select .cse2 8) 0) (= (select .cse1 12) 0) (= |c_~#A~0.base| 4) (= (select .cse2 28) 0) (= 48 (select .cse5 0)) (= (select .cse2 24) 0) .cse4))) is different from false [2023-08-03 15:28:59,172 INFO L124 PetriNetUnfolderBase]: 4704/13079 cut-off events. [2023-08-03 15:28:59,172 INFO L125 PetriNetUnfolderBase]: For 157688/157754 co-relation queries the response was YES. [2023-08-03 15:28:59,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72567 conditions, 13079 events. 4704/13079 cut-off events. For 157688/157754 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 138120 event pairs, 2220 based on Foata normal form. 81/11939 useless extension candidates. Maximal degree in co-relation 72355. Up to 6169 conditions per place. [2023-08-03 15:28:59,269 INFO L140 encePairwiseOnDemand]: 426/466 looper letters, 712 selfloop transitions, 341 changer transitions 336/1397 dead transitions. [2023-08-03 15:28:59,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 1397 transitions, 24800 flow [2023-08-03 15:28:59,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-08-03 15:28:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2023-08-03 15:28:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 9306 transitions. [2023-08-03 15:28:59,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31203057939914164 [2023-08-03 15:28:59,276 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 9306 transitions. [2023-08-03 15:28:59,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 9306 transitions. [2023-08-03 15:28:59,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:28:59,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 9306 transitions. [2023-08-03 15:28:59,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 65 states, 64 states have (on average 145.40625) internal successors, (9306), 64 states have internal predecessors, (9306), 0 states have call successors, (0), 0 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-03 15:28:59,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 65 states, 65 states have (on average 466.0) internal successors, (30290), 65 states have internal predecessors, (30290), 0 states have call successors, (0), 0 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-03 15:28:59,299 INFO L81 ComplementDD]: Finished complementDD. Result has 65 states, 65 states have (on average 466.0) internal successors, (30290), 65 states have internal predecessors, (30290), 0 states have call successors, (0), 0 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-03 15:28:59,299 INFO L175 Difference]: Start difference. First operand has 299 places, 607 transitions, 11617 flow. Second operand 64 states and 9306 transitions. [2023-08-03 15:28:59,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 1397 transitions, 24800 flow [2023-08-03 15:29:00,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 1397 transitions, 24578 flow, removed 47 selfloop flow, removed 13 redundant places. [2023-08-03 15:29:00,018 INFO L231 Difference]: Finished difference. Result has 375 places, 826 transitions, 16746 flow [2023-08-03 15:29:00,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=11462, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=16746, PETRI_PLACES=375, PETRI_TRANSITIONS=826} [2023-08-03 15:29:00,018 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 308 predicate places. [2023-08-03 15:29:00,018 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 826 transitions, 16746 flow [2023-08-03 15:29:00,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 139.5483870967742) internal successors, (4326), 31 states have internal predecessors, (4326), 0 states have call successors, (0), 0 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-03 15:29:00,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:29:00,019 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:29:00,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-03 15:29:00,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-03 15:29:00,220 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:29:00,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:29:00,220 INFO L85 PathProgramCache]: Analyzing trace with hash -794364459, now seen corresponding path program 2 times [2023-08-03 15:29:00,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:29:00,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244050489] [2023-08-03 15:29:00,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:29:00,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:29:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:29:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:29:00,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:29:00,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244050489] [2023-08-03 15:29:00,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244050489] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:29:00,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763990669] [2023-08-03 15:29:00,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:29:00,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:29:00,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:29:00,837 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:29:00,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-03 15:29:00,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:29:00,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:29:00,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-03 15:29:00,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:29:01,167 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 9 treesize of output 11 [2023-08-03 15:29:01,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:29:01,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:29:01,211 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:29:01,211 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:29:01,263 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 9 treesize of output 11 [2023-08-03 15:29:01,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:29:01,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:29:01,313 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:29:01,313 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:29:01,673 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:29:01,673 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:29:02,812 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:29:02,813 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:29:03,241 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 15:29:04,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:29:04,560 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 16 treesize of output 18 [2023-08-03 15:29:08,213 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:29:08,214 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 379 treesize of output 344 [2023-08-03 15:29:09,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:29:09,915 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 16 treesize of output 18 [2023-08-03 15:29:10,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:29:10,022 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 16 treesize of output 18 [2023-08-03 15:29:12,002 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:29:12,018 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:29:12,019 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 17 treesize of output 11 [2023-08-03 15:29:12,802 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 15:29:13,382 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 15:29:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:29:13,514 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:29:13,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:29:13,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763990669] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:29:13,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:29:13,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2023-08-03 15:29:13,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579137691] [2023-08-03 15:29:13,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:29:13,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-03 15:29:13,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:29:13,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-03 15:29:13,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=686, Unknown=3, NotChecked=0, Total=812 [2023-08-03 15:29:14,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 15:29:14,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 826 transitions, 16746 flow. Second operand has 29 states, 29 states have (on average 139.48275862068965) internal successors, (4045), 29 states have internal predecessors, (4045), 0 states have call successors, (0), 0 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-03 15:29:14,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:29:14,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 15:29:14,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:29:18,421 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#A~0.offset| 12))) (let ((.cse2 (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1263) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse1 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (.cse3 (select (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse4 (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#__global_lock~0.base|)) (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse0) (= (select (select |c_#pthreadsMutex| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 1)))) (and (or (forall ((v_ArrVal_1263 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) .cse0 1)) |c_~#__global_lock~0.base| v_ArrVal_1263) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (and .cse1 (forall ((v_ArrVal_1256 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1256) |c_~#A~0.base|) |c_~#A~0.offset|) 0)))) (or (and .cse1 (= |c_t_funThread1of2ForFork0_#t~mem6#1| 0)) .cse2) (or .cse2 (and .cse1 (= .cse3 0))) (or (and .cse1 (= |c_t_funThread1of2ForFork0_#t~post10#1| 1)) .cse4) (or (and .cse1 (= .cse3 1)) .cse4)))) is different from false [2023-08-03 15:29:37,162 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-03 15:29:39,173 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-03 15:29:40,993 INFO L124 PetriNetUnfolderBase]: 5412/14982 cut-off events. [2023-08-03 15:29:40,993 INFO L125 PetriNetUnfolderBase]: For 195735/195801 co-relation queries the response was YES. [2023-08-03 15:29:41,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90880 conditions, 14982 events. 5412/14982 cut-off events. For 195735/195801 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 161325 event pairs, 2165 based on Foata normal form. 133/13743 useless extension candidates. Maximal degree in co-relation 90626. Up to 5692 conditions per place. [2023-08-03 15:29:41,109 INFO L140 encePairwiseOnDemand]: 433/466 looper letters, 691 selfloop transitions, 480 changer transitions 575/1754 dead transitions. [2023-08-03 15:29:41,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 1754 transitions, 34621 flow [2023-08-03 15:29:41,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-08-03 15:29:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2023-08-03 15:29:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 12146 transitions. [2023-08-03 15:29:41,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31029021050480277 [2023-08-03 15:29:41,119 INFO L72 ComplementDD]: Start complementDD. Operand 84 states and 12146 transitions. [2023-08-03 15:29:41,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 12146 transitions. [2023-08-03 15:29:41,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:29:41,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 84 states and 12146 transitions. [2023-08-03 15:29:41,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 85 states, 84 states have (on average 144.5952380952381) internal successors, (12146), 84 states have internal predecessors, (12146), 0 states have call successors, (0), 0 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-03 15:29:41,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 85 states, 85 states have (on average 466.0) internal successors, (39610), 85 states have internal predecessors, (39610), 0 states have call successors, (0), 0 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-03 15:29:41,163 INFO L81 ComplementDD]: Finished complementDD. Result has 85 states, 85 states have (on average 466.0) internal successors, (39610), 85 states have internal predecessors, (39610), 0 states have call successors, (0), 0 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-03 15:29:41,163 INFO L175 Difference]: Start difference. First operand has 375 places, 826 transitions, 16746 flow. Second operand 84 states and 12146 transitions. [2023-08-03 15:29:41,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 1754 transitions, 34621 flow [2023-08-03 15:29:42,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 1754 transitions, 33820 flow, removed 319 selfloop flow, removed 15 redundant places. [2023-08-03 15:29:42,272 INFO L231 Difference]: Finished difference. Result has 475 places, 954 transitions, 20442 flow [2023-08-03 15:29:42,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=16185, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=826, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=347, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=84, PETRI_FLOW=20442, PETRI_PLACES=475, PETRI_TRANSITIONS=954} [2023-08-03 15:29:42,273 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 408 predicate places. [2023-08-03 15:29:42,273 INFO L495 AbstractCegarLoop]: Abstraction has has 475 places, 954 transitions, 20442 flow [2023-08-03 15:29:42,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 139.48275862068965) internal successors, (4045), 29 states have internal predecessors, (4045), 0 states have call successors, (0), 0 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-03 15:29:42,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:29:42,274 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:29:42,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-03 15:29:42,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:29:42,478 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:29:42,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:29:42,478 INFO L85 PathProgramCache]: Analyzing trace with hash 450493123, now seen corresponding path program 3 times [2023-08-03 15:29:42,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:29:42,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297904440] [2023-08-03 15:29:42,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:29:42,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:29:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:29:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:29:42,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:29:42,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297904440] [2023-08-03 15:29:42,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297904440] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:29:42,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656966687] [2023-08-03 15:29:42,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 15:29:42,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:29:42,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:29:42,949 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:29:42,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-03 15:29:43,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-03 15:29:43,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:29:43,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-03 15:29:43,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:29:43,274 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 9 treesize of output 11 [2023-08-03 15:29:43,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:29:43,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:29:43,334 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:29:43,335 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:29:43,374 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 9 treesize of output 11 [2023-08-03 15:29:43,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:29:43,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:29:43,438 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:29:43,438 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:29:43,793 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:29:43,794 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:29:44,957 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:29:44,957 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:29:45,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 15:29:46,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:29:46,733 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 16 treesize of output 18 [2023-08-03 15:29:48,587 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:29:48,588 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 379 treesize of output 344 [2023-08-03 15:29:49,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:29:49,179 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 16 treesize of output 18 [2023-08-03 15:29:49,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:29:49,267 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 16 treesize of output 18 [2023-08-03 15:29:49,679 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:29:49,684 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:29:49,685 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 17 treesize of output 11 [2023-08-03 15:29:50,189 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 15:29:50,755 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 15:29:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:29:51,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:29:51,109 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1362 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1362) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 15:29:51,119 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1362 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post10#1|))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1362) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 15:29:51,308 WARN L839 $PredicateComparison]: unable to prove that (or (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) (forall ((v_ArrVal_1352 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1352) |c_~#A~0.base|) |c_~#A~0.offset|)))) (forall ((v_ArrVal_1359 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_1359) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) is different from false [2023-08-03 15:29:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-03 15:29:51,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656966687] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:29:51,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:29:51,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2023-08-03 15:29:51,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274640972] [2023-08-03 15:29:51,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:29:51,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-03 15:29:51,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:29:51,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-03 15:29:51,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=574, Unknown=9, NotChecked=156, Total=870 [2023-08-03 15:29:51,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 15:29:51,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 954 transitions, 20442 flow. Second operand has 30 states, 30 states have (on average 139.56666666666666) internal successors, (4187), 30 states have internal predecessors, (4187), 0 states have call successors, (0), 0 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-03 15:29:51,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:29:51,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 15:29:51,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:29:56,377 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (.cse3 (select (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse1 (forall ((v_ArrVal_1359 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1359) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse2 (and .cse0 (= .cse3 0)))) (and .cse0 (or (and .cse0 (= |c_t_funThread1of2ForFork0_#t~mem6#1| 0)) .cse1) (or .cse2 .cse1) (or .cse2 (forall ((v_ArrVal_1359 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_1359) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (= .cse3 1)))) is different from false [2023-08-03 15:29:57,315 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| 3)) (.cse4 (select |c_#memory_int| 1)) (.cse3 (select |c_#memory_int| 4)) (.cse0 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (.cse2 (forall ((v_ArrVal_1359 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1359) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse5 (select (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset|))) (and .cse0 (= (select .cse1 4) 0) (or (and .cse0 (= |c_t_funThread1of2ForFork0_#t~mem6#1| 0)) .cse2) (= (select .cse3 12) 0) (= (select .cse1 16) 0) (= (select .cse1 8) 0) (= (select .cse3 4) 0) (= (select .cse1 0) 0) (= (select .cse3 0) 0) (= (select .cse3 20) 0) (= |c_~#A~0.offset| 0) (= (select .cse4 1) 0) (= (select .cse3 16) 0) (= (select .cse3 8) 0) (= (select .cse1 12) 0) (= |c_~#A~0.base| 4) (= (select .cse3 28) 0) (= 48 (select .cse4 0)) (= (select .cse3 24) 0) (or (and .cse0 (= .cse5 1)) .cse2) (= .cse5 0))) is different from false [2023-08-03 15:30:00,311 INFO L124 PetriNetUnfolderBase]: 3865/10886 cut-off events. [2023-08-03 15:30:00,311 INFO L125 PetriNetUnfolderBase]: For 171324/171376 co-relation queries the response was YES. [2023-08-03 15:30:00,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72039 conditions, 10886 events. 3865/10886 cut-off events. For 171324/171376 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 110992 event pairs, 1664 based on Foata normal form. 32/10058 useless extension candidates. Maximal degree in co-relation 71744. Up to 6415 conditions per place. [2023-08-03 15:30:00,416 INFO L140 encePairwiseOnDemand]: 433/466 looper letters, 763 selfloop transitions, 391 changer transitions 91/1253 dead transitions. [2023-08-03 15:30:00,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 1253 transitions, 26530 flow [2023-08-03 15:30:00,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-08-03 15:30:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-08-03 15:30:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 5975 transitions. [2023-08-03 15:30:00,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3127289856589553 [2023-08-03 15:30:00,422 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 5975 transitions. [2023-08-03 15:30:00,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 5975 transitions. [2023-08-03 15:30:00,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:30:00,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 5975 transitions. [2023-08-03 15:30:00,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 145.73170731707316) internal successors, (5975), 41 states have internal predecessors, (5975), 0 states have call successors, (0), 0 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-03 15:30:00,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 466.0) internal successors, (19572), 42 states have internal predecessors, (19572), 0 states have call successors, (0), 0 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-03 15:30:00,434 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 466.0) internal successors, (19572), 42 states have internal predecessors, (19572), 0 states have call successors, (0), 0 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-03 15:30:00,434 INFO L175 Difference]: Start difference. First operand has 475 places, 954 transitions, 20442 flow. Second operand 41 states and 5975 transitions. [2023-08-03 15:30:00,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 1253 transitions, 26530 flow [2023-08-03 15:30:01,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 1253 transitions, 25485 flow, removed 402 selfloop flow, removed 30 redundant places. [2023-08-03 15:30:01,580 INFO L231 Difference]: Finished difference. Result has 464 places, 999 transitions, 21240 flow [2023-08-03 15:30:01,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=19536, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=954, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=347, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=21240, PETRI_PLACES=464, PETRI_TRANSITIONS=999} [2023-08-03 15:30:01,581 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 397 predicate places. [2023-08-03 15:30:01,581 INFO L495 AbstractCegarLoop]: Abstraction has has 464 places, 999 transitions, 21240 flow [2023-08-03 15:30:01,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 139.56666666666666) internal successors, (4187), 30 states have internal predecessors, (4187), 0 states have call successors, (0), 0 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-03 15:30:01,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:30:01,581 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:30:01,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-03 15:30:01,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:30:01,786 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:30:01,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:30:01,786 INFO L85 PathProgramCache]: Analyzing trace with hash -921070713, now seen corresponding path program 4 times [2023-08-03 15:30:01,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:30:01,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935838483] [2023-08-03 15:30:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:30:01,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:30:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:30:02,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:30:02,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:30:02,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935838483] [2023-08-03 15:30:02,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935838483] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:30:02,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606452610] [2023-08-03 15:30:02,194 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-03 15:30:02,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:30:02,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:30:02,195 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:30:02,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-03 15:30:02,326 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-03 15:30:02,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:30:02,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-03 15:30:02,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:30:02,534 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 9 treesize of output 11 [2023-08-03 15:30:02,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:30:02,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:30:02,577 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:30:02,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:30:02,641 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 9 treesize of output 11 [2023-08-03 15:30:02,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:30:02,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:30:02,682 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:30:02,682 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:30:03,027 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:30:03,028 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:30:04,169 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:30:04,169 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:30:04,595 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 15:30:06,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:30:06,326 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 16 treesize of output 18 [2023-08-03 15:30:07,748 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:30:07,748 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 379 treesize of output 344 [2023-08-03 15:30:08,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:30:08,184 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 16 treesize of output 18 [2023-08-03 15:30:08,594 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:30:08,599 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:30:08,599 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 17 treesize of output 11 [2023-08-03 15:30:09,172 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 15:30:09,444 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 32 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 151 [2023-08-03 15:30:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:30:09,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:30:09,796 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1455) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) is different from false [2023-08-03 15:30:09,828 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1454 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1455) |c_~#A~0.base|) |c_~#A~0.offset|) 1))) is different from false [2023-08-03 15:30:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:30:10,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606452610] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:30:10,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:30:10,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2023-08-03 15:30:10,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680060991] [2023-08-03 15:30:10,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:30:10,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-03 15:30:10,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:30:10,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-03 15:30:10,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=578, Unknown=11, NotChecked=102, Total=812 [2023-08-03 15:30:10,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 15:30:10,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 999 transitions, 21240 flow. Second operand has 29 states, 29 states have (on average 139.55172413793105) internal successors, (4047), 29 states have internal predecessors, (4047), 0 states have call successors, (0), 0 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-03 15:30:10,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:30:10,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 15:30:10,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:30:13,606 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse35 (select |c_#memory_int| |c_~#A~0.base|)) (.cse36 (forall ((v_ArrVal_1454 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse2 (select |c_#pthreadsMutex| |c_~#A~0.base|)) (.cse3 (+ |c_~#A~0.offset| 12))) (and (or (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1455 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1448))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (select .cse1 |c_~#A~0.offset|) 1))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1455) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) (forall ((v_ArrVal_1454 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store .cse2 .cse3 1)) |c_~#__global_lock~0.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (let ((.cse32 (select |c_#memory_int| 1)) (.cse31 (select |c_#memory_int| 4)) (.cse34 (select |c_#memory_int| 3)) (.cse33 (select |c_#memory_int| 5))) (let ((.cse4 (= (select .cse33 16) 0)) (.cse5 (= (select .cse33 8) 0)) (.cse6 (= (select .cse34 4) 0)) (.cse7 (= (select .cse31 12) 0)) (.cse8 (= (select .cse34 16) 0)) (.cse9 (= (select .cse34 8) 0)) (.cse10 (= (select .cse31 4) 0)) (.cse11 (= |c_ULTIMATE.start_main_~m~0#1.offset| 12)) (.cse12 (= (select .cse34 0) 0)) (.cse13 (= (select .cse31 20) 0)) (.cse14 (= 0 (select .cse33 20))) (.cse15 (= |c_~#A~0.offset| 0)) (.cse16 (= (select .cse33 4) 0)) (.cse17 (= (select .cse31 0) 1)) (.cse18 (= (select .cse32 1) 0)) (.cse19 (= (select .cse31 16) 0)) (.cse20 (= (select .cse31 8) 0)) (.cse21 (= (select .cse34 12) 0)) (.cse22 (= (select .cse33 12) 0)) (.cse23 (= 3 |c_~#__global_lock~0.base|)) (.cse24 (= (select .cse33 0) 0)) (.cse25 (= |c_~#A~0.base| 4)) (.cse26 (= (select .cse33 28) 0)) (.cse27 (= (select .cse33 24) 0)) (.cse28 (= (select .cse31 28) 0)) (.cse29 (= 48 (select .cse32 0))) (.cse30 (= (select .cse31 24) 0))) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |c_ULTIMATE.start_main_~m~0#1.base| 4) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (= |c_ULTIMATE.start_main_~d~0#1.base| 4) .cse26 .cse27 .cse28 .cse29 .cse30) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |c_ULTIMATE.start_main_~m~0#1.base| 5) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= |c_ULTIMATE.start_main_~d~0#1.base| 5) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30)))) (or (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse35 |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1455) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) .cse36) (or .cse36 (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1455) |c_~#A~0.base|) |c_~#A~0.offset|) 1))) (or (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse35 |c_~#A~0.offset| (+ (select .cse35 |c_~#A~0.offset|) 1))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1455) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) .cse36) (= (select .cse2 .cse3) 1))) is different from false [2023-08-03 15:30:13,646 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse4 (forall ((v_ArrVal_1454 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse5 (select .cse3 |c_~#A~0.offset|)) (.cse2 (+ |c_~#A~0.offset| 12))) (and (or (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1455 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1448))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (select .cse1 |c_~#A~0.offset|) 1))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1455) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) (forall ((v_ArrVal_1454 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) .cse2 1)) |c_~#__global_lock~0.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (or (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse3 |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1455) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) .cse4) (or (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse3 |c_~#A~0.offset| (+ .cse5 1))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1455) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) .cse4) (or (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) (= .cse5 1)) (and (not (= (select (select |c_#pthreadsMutex| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse2)))))) is different from false [2023-08-03 15:30:19,825 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-03 15:30:20,678 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse0 (select |c_#memory_int| 3)) (.cse5 (forall ((v_ArrVal_1454 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse6 (select |c_#memory_int| 1)) (.cse1 (select |c_#memory_int| 4)) (.cse7 (select .cse4 |c_~#A~0.offset|))) (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) (= (select .cse0 4) 0) (= (select .cse1 12) 0) (= (select .cse0 16) 0) (= (select .cse0 8) 0) (= (select .cse1 4) 0) (= (select .cse0 0) 0) (or (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1455 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1448))) (store .cse2 |c_~#A~0.base| (let ((.cse3 (select .cse2 |c_~#A~0.base|))) (store .cse3 |c_~#A~0.offset| (+ (select .cse3 |c_~#A~0.offset|) 1))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1455) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) (forall ((v_ArrVal_1454 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (= (select .cse1 20) 0) (or (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse4 |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1455) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) .cse5) (= |c_~#A~0.offset| 0) (= (select .cse1 0) 1) (= (select .cse6 1) 0) (= (select .cse1 16) 0) (= (select .cse1 8) 0) (= (select .cse0 12) 0) (or (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse4 |c_~#A~0.offset| (+ .cse7 1))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1455) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) .cse5) (= |c_~#A~0.base| 4) (= (select .cse1 28) 0) (= 48 (select .cse6 0)) (= (select .cse1 24) 0) (= .cse7 1)))) is different from false [2023-08-03 15:30:22,368 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#A~0.offset| 12)) (.cse4 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse2 (select |c_#pthreadsMutex| |c_~#A~0.base|)) (.cse6 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (.cse7 (select .cse4 |c_~#A~0.offset|)) (.cse5 (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse3))) (and (or (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1455 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1448))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (select .cse1 |c_~#A~0.offset|) 1))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1455) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) (forall ((v_ArrVal_1454 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store .cse2 .cse3 1)) |c_~#__global_lock~0.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (or (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse4 |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1455) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) (forall ((v_ArrVal_1454 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (or (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) .cse5 (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|) (not (= (select .cse2 |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (and .cse6 (= .cse7 0))) (or (and .cse6 (= .cse7 1)) (and (not (= (select (select |c_#pthreadsMutex| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)) .cse5))))) is different from false [2023-08-03 15:30:26,154 INFO L124 PetriNetUnfolderBase]: 4565/12924 cut-off events. [2023-08-03 15:30:26,154 INFO L125 PetriNetUnfolderBase]: For 192827/192855 co-relation queries the response was YES. [2023-08-03 15:30:26,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85638 conditions, 12924 events. 4565/12924 cut-off events. For 192827/192855 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 136627 event pairs, 2065 based on Foata normal form. 21/11872 useless extension candidates. Maximal degree in co-relation 85258. Up to 7129 conditions per place. [2023-08-03 15:30:26,281 INFO L140 encePairwiseOnDemand]: 437/466 looper letters, 877 selfloop transitions, 466 changer transitions 177/1528 dead transitions. [2023-08-03 15:30:26,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 1528 transitions, 31867 flow [2023-08-03 15:30:26,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-08-03 15:30:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-08-03 15:30:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 7886 transitions. [2023-08-03 15:30:26,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31338419965029407 [2023-08-03 15:30:26,286 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 7886 transitions. [2023-08-03 15:30:26,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 7886 transitions. [2023-08-03 15:30:26,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:30:26,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 7886 transitions. [2023-08-03 15:30:26,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 146.03703703703704) internal successors, (7886), 54 states have internal predecessors, (7886), 0 states have call successors, (0), 0 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-03 15:30:26,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 466.0) internal successors, (25630), 55 states have internal predecessors, (25630), 0 states have call successors, (0), 0 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-03 15:30:26,302 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 466.0) internal successors, (25630), 55 states have internal predecessors, (25630), 0 states have call successors, (0), 0 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-03 15:30:26,302 INFO L175 Difference]: Start difference. First operand has 464 places, 999 transitions, 21240 flow. Second operand 54 states and 7886 transitions. [2023-08-03 15:30:26,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 1528 transitions, 31867 flow [2023-08-03 15:30:27,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 1528 transitions, 31408 flow, removed 110 selfloop flow, removed 22 redundant places. [2023-08-03 15:30:27,662 INFO L231 Difference]: Finished difference. Result has 512 places, 1105 transitions, 24696 flow [2023-08-03 15:30:27,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=20889, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=363, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=24696, PETRI_PLACES=512, PETRI_TRANSITIONS=1105} [2023-08-03 15:30:27,663 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 445 predicate places. [2023-08-03 15:30:27,663 INFO L495 AbstractCegarLoop]: Abstraction has has 512 places, 1105 transitions, 24696 flow [2023-08-03 15:30:27,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 139.55172413793105) internal successors, (4047), 29 states have internal predecessors, (4047), 0 states have call successors, (0), 0 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-03 15:30:27,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:30:27,664 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:30:27,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-03 15:30:27,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:30:27,870 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:30:27,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:30:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1815078855, now seen corresponding path program 5 times [2023-08-03 15:30:27,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:30:27,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306364658] [2023-08-03 15:30:27,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:30:27,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:30:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:30:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:30:28,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:30:28,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306364658] [2023-08-03 15:30:28,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306364658] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:30:28,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848868684] [2023-08-03 15:30:28,245 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-03 15:30:28,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:30:28,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:30:28,246 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:30:28,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-03 15:30:28,369 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-03 15:30:28,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:30:28,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-03 15:30:28,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:30:28,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:30:28,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:30:28,598 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:30:28,599 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:30:28,616 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 9 treesize of output 11 [2023-08-03 15:30:28,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:30:28,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:30:28,703 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:30:28,703 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:30:28,723 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 9 treesize of output 11 [2023-08-03 15:30:29,075 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:30:29,076 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 412 treesize of output 339 [2023-08-03 15:30:30,253 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:30:30,254 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 412 treesize of output 339 [2023-08-03 15:30:30,709 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 15:30:31,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:30:31,899 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 16 treesize of output 18 [2023-08-03 15:30:33,409 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:30:33,415 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:30:33,415 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 17 treesize of output 11 [2023-08-03 15:30:33,775 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 15:30:34,410 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 15:30:34,965 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 15:30:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:30:35,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:30:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:30:36,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848868684] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:30:36,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:30:36,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 28 [2023-08-03 15:30:36,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108019916] [2023-08-03 15:30:36,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:30:36,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-03 15:30:36,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:30:36,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-03 15:30:36,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=734, Unknown=12, NotChecked=0, Total=870 [2023-08-03 15:30:39,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 466 [2023-08-03 15:30:39,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 1105 transitions, 24696 flow. Second operand has 30 states, 30 states have (on average 137.46666666666667) internal successors, (4124), 30 states have internal predecessors, (4124), 0 states have call successors, (0), 0 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-03 15:30:39,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:30:39,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 466 [2023-08-03 15:30:39,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:30:50,335 INFO L124 PetriNetUnfolderBase]: 4891/13734 cut-off events. [2023-08-03 15:30:50,336 INFO L125 PetriNetUnfolderBase]: For 220136/220177 co-relation queries the response was YES. [2023-08-03 15:30:50,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93002 conditions, 13734 events. 4891/13734 cut-off events. For 220136/220177 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 146147 event pairs, 2178 based on Foata normal form. 31/12600 useless extension candidates. Maximal degree in co-relation 92694. Up to 7692 conditions per place. [2023-08-03 15:30:50,494 INFO L140 encePairwiseOnDemand]: 440/466 looper letters, 986 selfloop transitions, 435 changer transitions 176/1605 dead transitions. [2023-08-03 15:30:50,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 1605 transitions, 34968 flow [2023-08-03 15:30:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-08-03 15:30:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-08-03 15:30:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 6814 transitions. [2023-08-03 15:30:50,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3111131403524792 [2023-08-03 15:30:50,498 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 6814 transitions. [2023-08-03 15:30:50,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 6814 transitions. [2023-08-03 15:30:50,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:30:50,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 6814 transitions. [2023-08-03 15:30:50,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 144.9787234042553) internal successors, (6814), 47 states have internal predecessors, (6814), 0 states have call successors, (0), 0 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-03 15:30:50,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 466.0) internal successors, (22368), 48 states have internal predecessors, (22368), 0 states have call successors, (0), 0 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-03 15:30:50,511 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 466.0) internal successors, (22368), 48 states have internal predecessors, (22368), 0 states have call successors, (0), 0 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-03 15:30:50,511 INFO L175 Difference]: Start difference. First operand has 512 places, 1105 transitions, 24696 flow. Second operand 47 states and 6814 transitions. [2023-08-03 15:30:50,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 1605 transitions, 34968 flow [2023-08-03 15:30:52,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 1605 transitions, 34287 flow, removed 103 selfloop flow, removed 29 redundant places. [2023-08-03 15:30:52,413 INFO L231 Difference]: Finished difference. Result has 547 places, 1196 transitions, 27809 flow [2023-08-03 15:30:52,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=24107, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=353, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=27809, PETRI_PLACES=547, PETRI_TRANSITIONS=1196} [2023-08-03 15:30:52,414 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 480 predicate places. [2023-08-03 15:30:52,414 INFO L495 AbstractCegarLoop]: Abstraction has has 547 places, 1196 transitions, 27809 flow [2023-08-03 15:30:52,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 137.46666666666667) internal successors, (4124), 30 states have internal predecessors, (4124), 0 states have call successors, (0), 0 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-03 15:30:52,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:30:52,414 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:30:52,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-03 15:30:52,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:30:52,621 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:30:52,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:30:52,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1517895617, now seen corresponding path program 6 times [2023-08-03 15:30:52,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:30:52,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623982801] [2023-08-03 15:30:52,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:30:52,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:30:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:30:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:30:53,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:30:53,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623982801] [2023-08-03 15:30:53,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623982801] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:30:53,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074654088] [2023-08-03 15:30:53,253 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-03 15:30:53,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:30:53,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:30:53,254 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:30:53,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-03 15:30:53,420 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-03 15:30:53,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:30:53,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-03 15:30:53,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:30:53,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:30:53,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:30:53,652 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:30:53,653 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:30:53,668 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 9 treesize of output 11 [2023-08-03 15:30:53,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:30:53,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:30:53,753 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:30:53,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:30:53,771 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 9 treesize of output 11 [2023-08-03 15:30:54,106 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:30:54,107 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:30:55,097 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:30:55,097 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:30:55,461 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 15:30:56,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:30:56,438 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 16 treesize of output 18 [2023-08-03 15:30:58,058 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:30:58,065 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:30:58,065 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 17 treesize of output 11 [2023-08-03 15:30:58,748 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 15:30:59,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 15:30:59,946 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 32 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 151 [2023-08-03 15:31:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:31:00,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:31:00,774 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1641 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1638))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (select .cse1 |c_~#A~0.offset|) 1))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1644) |c_~#A~0.base|) |c_~#A~0.offset|) 1))) is different from false [2023-08-03 15:31:00,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-03 15:31:00,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074654088] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:31:00,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:31:00,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2023-08-03 15:31:00,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584830472] [2023-08-03 15:31:00,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:31:00,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-03 15:31:00,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:31:00,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-03 15:31:00,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=657, Unknown=24, NotChecked=54, Total=870 [2023-08-03 15:31:01,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 466 [2023-08-03 15:31:01,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 1196 transitions, 27809 flow. Second operand has 30 states, 30 states have (on average 137.46666666666667) internal successors, (4124), 30 states have internal predecessors, (4124), 0 states have call successors, (0), 0 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-03 15:31:01,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:31:01,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 466 [2023-08-03 15:31:01,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:31:01,589 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse36 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse8 (= |c_ULTIMATE.start_main_~m~0#1.offset| 12)) (.cse14 (= |c_~#A~0.offset| 0)) (.cse37 (select .cse36 |c_~#A~0.offset|))) (and (let ((.cse33 (select |c_#memory_int| 1)) (.cse32 (select |c_#memory_int| 4)) (.cse35 (select |c_#memory_int| 3)) (.cse34 (select |c_#memory_int| 5))) (let ((.cse0 (= (select .cse34 16) 0)) (.cse1 (= (select .cse34 8) 0)) (.cse2 (= (select .cse35 4) 0)) (.cse3 (= (select .cse32 12) 0)) (.cse4 (= (select .cse35 16) 0)) (.cse5 (= (select .cse35 8) 0)) (.cse6 (= (select .cse32 4) 0)) (.cse7 (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4))) (.cse9 (= (select .cse35 0) 0)) (.cse10 (= (select .cse32 0) 0)) (.cse11 (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (.cse12 (= (select .cse32 20) 0)) (.cse13 (= 0 (select .cse34 20))) (.cse15 (= (select .cse34 4) 0)) (.cse16 (= (select .cse33 1) 0)) (.cse17 (= (select .cse32 16) 0)) (.cse18 (= (select .cse32 8) 0)) (.cse19 (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (.cse20 (= (select .cse35 12) 0)) (.cse21 (not (= 5 |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (.cse22 (= (select .cse34 12) 0)) (.cse23 (= 3 |c_~#__global_lock~0.base|)) (.cse24 (= (select .cse34 0) 0)) (.cse25 (= |c_~#A~0.base| 4)) (.cse26 (= (select .cse34 28) 0)) (.cse27 (= (select .cse34 24) 0)) (.cse28 (= (select .cse32 28) 0)) (.cse29 (= 48 (select .cse33 0))) (.cse30 (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse31 (= (select .cse32 24) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |c_ULTIMATE.start_main_~m~0#1.base| 4) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (= |c_ULTIMATE.start_main_~d~0#1.base| 4) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |c_ULTIMATE.start_main_~m~0#1.base| 5) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= |c_ULTIMATE.start_main_~d~0#1.base| 5) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31)))) (or (forall ((v_ArrVal_1641 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1641) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_1644 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse36 |c_~#A~0.offset| (+ .cse37 1))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1644) |c_~#A~0.base|) |c_~#A~0.offset|) 1))) (let ((.cse38 (= .cse37 0))) (or (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) .cse38) (and (or (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) .cse8 .cse14 (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|) (= (select (select |c_#pthreadsMutex| |c_~#A~0.base|) 12) 1)) (not (= |c_~#A~0.offset| |c_ULTIMATE.start_main_~d~0#1.offset|))) .cse38)))))) is different from false [2023-08-03 15:31:17,393 INFO L124 PetriNetUnfolderBase]: 5318/14987 cut-off events. [2023-08-03 15:31:17,394 INFO L125 PetriNetUnfolderBase]: For 257805/257912 co-relation queries the response was YES. [2023-08-03 15:31:17,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102695 conditions, 14987 events. 5318/14987 cut-off events. For 257805/257912 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 162195 event pairs, 2815 based on Foata normal form. 123/13848 useless extension candidates. Maximal degree in co-relation 102373. Up to 10847 conditions per place. [2023-08-03 15:31:17,577 INFO L140 encePairwiseOnDemand]: 436/466 looper letters, 1089 selfloop transitions, 119 changer transitions 402/1618 dead transitions. [2023-08-03 15:31:17,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 1618 transitions, 37451 flow [2023-08-03 15:31:17,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-08-03 15:31:17,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-08-03 15:31:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 6583 transitions. [2023-08-03 15:31:17,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3071002052621758 [2023-08-03 15:31:17,582 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 6583 transitions. [2023-08-03 15:31:17,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 6583 transitions. [2023-08-03 15:31:17,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:31:17,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 6583 transitions. [2023-08-03 15:31:17,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 143.1086956521739) internal successors, (6583), 46 states have internal predecessors, (6583), 0 states have call successors, (0), 0 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-03 15:31:17,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 466.0) internal successors, (21902), 47 states have internal predecessors, (21902), 0 states have call successors, (0), 0 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-03 15:31:17,594 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 466.0) internal successors, (21902), 47 states have internal predecessors, (21902), 0 states have call successors, (0), 0 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-03 15:31:17,595 INFO L175 Difference]: Start difference. First operand has 547 places, 1196 transitions, 27809 flow. Second operand 46 states and 6583 transitions. [2023-08-03 15:31:17,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 1618 transitions, 37451 flow [2023-08-03 15:31:20,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 1618 transitions, 36988 flow, removed 106 selfloop flow, removed 18 redundant places. [2023-08-03 15:31:20,113 INFO L231 Difference]: Finished difference. Result has 606 places, 1153 transitions, 26945 flow [2023-08-03 15:31:20,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=27400, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1081, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=26945, PETRI_PLACES=606, PETRI_TRANSITIONS=1153} [2023-08-03 15:31:20,114 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 539 predicate places. [2023-08-03 15:31:20,114 INFO L495 AbstractCegarLoop]: Abstraction has has 606 places, 1153 transitions, 26945 flow [2023-08-03 15:31:20,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 137.46666666666667) internal successors, (4124), 30 states have internal predecessors, (4124), 0 states have call successors, (0), 0 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-03 15:31:20,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:31:20,114 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:31:20,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-08-03 15:31:20,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:31:20,315 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:31:20,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:31:20,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1671468132, now seen corresponding path program 1 times [2023-08-03 15:31:20,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:31:20,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447392052] [2023-08-03 15:31:20,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:31:20,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:31:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:31:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 15:31:20,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:31:20,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447392052] [2023-08-03 15:31:20,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447392052] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:31:20,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:31:20,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 15:31:20,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62748833] [2023-08-03 15:31:20,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:31:20,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 15:31:20,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:31:20,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 15:31:20,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 15:31:20,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 466 [2023-08-03 15:31:20,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 1153 transitions, 26945 flow. Second operand has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 0 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-03 15:31:20,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:31:20,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 466 [2023-08-03 15:31:20,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:31:25,013 INFO L124 PetriNetUnfolderBase]: 3721/11212 cut-off events. [2023-08-03 15:31:25,013 INFO L125 PetriNetUnfolderBase]: For 232270/232335 co-relation queries the response was YES. [2023-08-03 15:31:25,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81446 conditions, 11212 events. 3721/11212 cut-off events. For 232270/232335 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 119787 event pairs, 2078 based on Foata normal form. 492/10617 useless extension candidates. Maximal degree in co-relation 81233. Up to 7129 conditions per place. [2023-08-03 15:31:25,156 INFO L140 encePairwiseOnDemand]: 463/466 looper letters, 886 selfloop transitions, 219 changer transitions 9/1177 dead transitions. [2023-08-03 15:31:25,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 1177 transitions, 29639 flow [2023-08-03 15:31:25,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:31:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:31:25,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2023-08-03 15:31:25,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5150214592274678 [2023-08-03 15:31:25,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 720 transitions. [2023-08-03 15:31:25,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 720 transitions. [2023-08-03 15:31:25,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:31:25,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 720 transitions. [2023-08-03 15:31:25,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 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-03 15:31:25,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-03 15:31:25,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-03 15:31:25,159 INFO L175 Difference]: Start difference. First operand has 606 places, 1153 transitions, 26945 flow. Second operand 3 states and 720 transitions. [2023-08-03 15:31:25,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 1177 transitions, 29639 flow [2023-08-03 15:31:27,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 1177 transitions, 29065 flow, removed 262 selfloop flow, removed 33 redundant places. [2023-08-03 15:31:27,096 INFO L231 Difference]: Finished difference. Result has 531 places, 1114 transitions, 26419 flow [2023-08-03 15:31:27,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=25708, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=895, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=26419, PETRI_PLACES=531, PETRI_TRANSITIONS=1114} [2023-08-03 15:31:27,096 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 464 predicate places. [2023-08-03 15:31:27,097 INFO L495 AbstractCegarLoop]: Abstraction has has 531 places, 1114 transitions, 26419 flow [2023-08-03 15:31:27,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 0 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-03 15:31:27,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:31:27,097 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:31:27,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-03 15:31:27,097 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:31:27,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:31:27,097 INFO L85 PathProgramCache]: Analyzing trace with hash 373148515, now seen corresponding path program 7 times [2023-08-03 15:31:27,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:31:27,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101725696] [2023-08-03 15:31:27,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:31:27,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:31:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:31:27,667 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-03 15:31:27,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:31:27,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101725696] [2023-08-03 15:31:27,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101725696] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:31:27,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015931462] [2023-08-03 15:31:27,668 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-03 15:31:27,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:31:27,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:31:27,669 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:31:27,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-03 15:31:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:31:27,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-03 15:31:27,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:31:27,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:31:27,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:31:28,013 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:31:28,013 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:31:28,032 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 9 treesize of output 11 [2023-08-03 15:31:28,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:31:28,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:31:28,114 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:31:28,114 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:31:28,134 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 9 treesize of output 11 [2023-08-03 15:31:28,492 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:31:28,492 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:31:29,823 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 15:31:31,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:31:31,060 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 16 treesize of output 18 [2023-08-03 15:31:32,132 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:31:32,133 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 417 treesize of output 382 [2023-08-03 15:31:32,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:31:32,933 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 16 treesize of output 18 [2023-08-03 15:31:33,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:31:33,599 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 16 treesize of output 18 [2023-08-03 15:31:35,683 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:31:35,683 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 411 treesize of output 376 [2023-08-03 15:31:36,841 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:31:36,842 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 15:31:38,723 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:31:38,727 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:31:38,727 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 17 treesize of output 11 [2023-08-03 15:31:39,368 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 15:31:39,571 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-03 15:31:39,571 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:31:39,579 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1783 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1783) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 15:31:39,718 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1782 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1782) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1783) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (forall ((v_ArrVal_1779 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1779) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) is different from false [2023-08-03 15:31:39,781 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1779 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1779) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1782 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (select .cse0 |c_~#A~0.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1782) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1783) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) is different from false [2023-08-03 15:31:39,797 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1779 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_1779) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1782 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (select .cse0 |c_~#A~0.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1782) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1783) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) is different from false [2023-08-03 15:31:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-03 15:31:39,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015931462] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:31:39,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:31:39,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 30 [2023-08-03 15:31:39,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923145943] [2023-08-03 15:31:39,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:31:39,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-03 15:31:39,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:31:39,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-03 15:31:39,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=622, Unknown=21, NotChecked=220, Total=992 [2023-08-03 15:31:40,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 15:31:40,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 1114 transitions, 26419 flow. Second operand has 32 states, 32 states have (on average 139.46875) internal successors, (4463), 32 states have internal predecessors, (4463), 0 states have call successors, (0), 0 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-03 15:31:40,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:31:40,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 15:31:40,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:31:43,741 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_~#A~0.offset| 12)) (.cse8 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse2 (select .cse8 |c_~#A~0.offset|)) (.cse0 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (.cse1 (not (= |c_~#A~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (.cse3 (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) (<= .cse7 |c_ULTIMATE.start_main_~m~0#1.offset|) (< |c_ULTIMATE.start_main_~m~0#1.offset| (+ |c_~#A~0.offset| 13)) (= (select (select |c_#pthreadsMutex| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 1))) (.cse9 (forall ((v_ArrVal_1779 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1779) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse6 (select |c_#pthreadsMutex| |c_~#A~0.base|))) (and (or (and .cse0 .cse1 (= .cse2 0)) .cse3) (or (forall ((v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1782 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1772))) (store .cse4 |c_~#A~0.base| (let ((.cse5 (select .cse4 |c_~#A~0.base|))) (store .cse5 |c_~#A~0.offset| (select .cse5 |c_~#A~0.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1782) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1783) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (forall ((v_ArrVal_1779 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store .cse6 .cse7 1)) |c_~#__global_lock~0.base| v_ArrVal_1779) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (or (forall ((v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1782 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_~#A~0.base| (store .cse8 |c_~#A~0.offset| (+ .cse2 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1782) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1783) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) .cse9) (or (and .cse0 .cse1 (= |c_t_funThread1of2ForFork0_#t~post10#1| 1)) .cse3) (or (forall ((v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1782 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_~#A~0.base| (store .cse8 |c_~#A~0.offset| |c_t_funThread1of2ForFork0_#t~mem6#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1782) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1783) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) .cse9) (= (select .cse6 .cse7) 1) (let ((.cse43 (select |c_#memory_int| 1)) (.cse42 (select |c_#memory_int| 4)) (.cse45 (select |c_#memory_int| 3)) (.cse44 (select |c_#memory_int| 5))) (let ((.cse10 (= (select .cse44 16) 0)) (.cse11 (= (select .cse44 8) 0)) (.cse12 (= (select .cse45 4) 0)) (.cse13 (= (select .cse42 12) 0)) (.cse14 (= (select .cse45 16) 0)) (.cse15 (= (select .cse45 8) 0)) (.cse16 (= (select .cse42 4) 0)) (.cse17 (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4))) (.cse18 (= |c_ULTIMATE.start_main_~m~0#1.offset| 12)) (.cse19 (= (select .cse45 0) 0)) (.cse20 (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (.cse21 (= (select .cse42 20) 0)) (.cse22 (= 0 (select .cse44 20))) (.cse23 (= |c_~#A~0.offset| 0)) (.cse24 (= (select .cse44 4) 0)) (.cse25 (= (select .cse42 0) 1)) (.cse26 (= (select .cse43 1) 0)) (.cse27 (= (select .cse42 16) 0)) (.cse28 (= (select .cse42 8) 0)) (.cse29 (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (.cse30 (= (select .cse45 12) 0)) (.cse31 (not (= 5 |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (.cse32 (= (select .cse44 12) 0)) (.cse33 (= 3 |c_~#__global_lock~0.base|)) (.cse34 (= (select .cse44 0) 0)) (.cse35 (= |c_~#A~0.base| 4)) (.cse36 (= (select .cse44 28) 0)) (.cse37 (= (select .cse44 24) 0)) (.cse38 (= (select .cse42 28) 0)) (.cse39 (= 48 (select .cse43 0))) (.cse40 (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse41 (= (select .cse42 24) 0))) (or (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= |c_ULTIMATE.start_main_~m~0#1.base| 4) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |c_ULTIMATE.start_main_~d~0#1.base| 4) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= |c_ULTIMATE.start_main_~m~0#1.base| 5) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (= |c_ULTIMATE.start_main_~d~0#1.base| 5) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41))))))) is different from false [2023-08-03 15:31:49,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:32:06,554 INFO L124 PetriNetUnfolderBase]: 5079/14347 cut-off events. [2023-08-03 15:32:06,555 INFO L125 PetriNetUnfolderBase]: For 266094/266124 co-relation queries the response was YES. [2023-08-03 15:32:06,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101238 conditions, 14347 events. 5079/14347 cut-off events. For 266094/266124 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 154836 event pairs, 2060 based on Foata normal form. 105/13155 useless extension candidates. Maximal degree in co-relation 101054. Up to 5575 conditions per place. [2023-08-03 15:32:06,735 INFO L140 encePairwiseOnDemand]: 437/466 looper letters, 745 selfloop transitions, 568 changer transitions 472/1793 dead transitions. [2023-08-03 15:32:06,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 1793 transitions, 41685 flow [2023-08-03 15:32:06,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-08-03 15:32:06,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2023-08-03 15:32:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 8597 transitions. [2023-08-03 15:32:06,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3126864043063941 [2023-08-03 15:32:06,741 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 8597 transitions. [2023-08-03 15:32:06,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 8597 transitions. [2023-08-03 15:32:06,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:32:06,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 8597 transitions. [2023-08-03 15:32:06,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 145.71186440677965) internal successors, (8597), 59 states have internal predecessors, (8597), 0 states have call successors, (0), 0 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-03 15:32:06,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 466.0) internal successors, (27960), 60 states have internal predecessors, (27960), 0 states have call successors, (0), 0 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-03 15:32:06,762 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 466.0) internal successors, (27960), 60 states have internal predecessors, (27960), 0 states have call successors, (0), 0 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-03 15:32:06,762 INFO L175 Difference]: Start difference. First operand has 531 places, 1114 transitions, 26419 flow. Second operand 59 states and 8597 transitions. [2023-08-03 15:32:06,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 1793 transitions, 41685 flow [2023-08-03 15:32:09,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 1793 transitions, 41218 flow, removed 24 selfloop flow, removed 7 redundant places. [2023-08-03 15:32:09,101 INFO L231 Difference]: Finished difference. Result has 610 places, 1142 transitions, 29013 flow [2023-08-03 15:32:09,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=26054, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=414, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=29013, PETRI_PLACES=610, PETRI_TRANSITIONS=1142} [2023-08-03 15:32:09,101 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 543 predicate places. [2023-08-03 15:32:09,102 INFO L495 AbstractCegarLoop]: Abstraction has has 610 places, 1142 transitions, 29013 flow [2023-08-03 15:32:09,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 139.46875) internal successors, (4463), 32 states have internal predecessors, (4463), 0 states have call successors, (0), 0 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-03 15:32:09,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:32:09,102 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:32:09,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-03 15:32:09,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:32:09,303 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:32:09,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:32:09,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1830895675, now seen corresponding path program 8 times [2023-08-03 15:32:09,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:32:09,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291371407] [2023-08-03 15:32:09,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:32:09,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:32:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:32:10,413 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-03 15:32:10,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:32:10,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291371407] [2023-08-03 15:32:10,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291371407] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:32:10,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669319881] [2023-08-03 15:32:10,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:32:10,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:32:10,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:32:10,415 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:32:10,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-03 15:32:10,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:32:10,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:32:10,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-03 15:32:10,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:32:10,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:32:10,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:32:10,807 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:32:10,807 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:32:10,825 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 9 treesize of output 11 [2023-08-03 15:32:10,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:32:10,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:32:10,911 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:32:10,912 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:32:10,932 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 9 treesize of output 11 [2023-08-03 15:32:11,252 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:32:11,252 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:32:12,352 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 15:32:13,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:32:13,732 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 16 treesize of output 18 [2023-08-03 15:32:14,807 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:32:14,807 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 417 treesize of output 382 [2023-08-03 15:32:15,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:32:15,651 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 16 treesize of output 18 [2023-08-03 15:32:15,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:32:15,763 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 16 treesize of output 18 [2023-08-03 15:32:16,426 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:32:16,426 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 15:32:18,421 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:32:18,426 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:32:18,426 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 17 treesize of output 11 [2023-08-03 15:32:18,721 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 15:32:19,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 15:32:19,518 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-03 15:32:19,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:32:19,569 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1879 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post10#1|))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1879) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 15:32:19,958 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-03 15:32:19,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669319881] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:32:19,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:32:19,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2023-08-03 15:32:19,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583310889] [2023-08-03 15:32:19,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:32:19,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-03 15:32:19,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:32:19,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-03 15:32:19,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=850, Unknown=14, NotChecked=60, Total=1056 [2023-08-03 15:32:20,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 15:32:20,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 1142 transitions, 29013 flow. Second operand has 33 states, 33 states have (on average 139.45454545454547) internal successors, (4602), 33 states have internal predecessors, (4602), 0 states have call successors, (0), 0 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-03 15:32:20,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:32:20,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 15:32:20,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:32:37,905 WARN L233 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 77 DAG size of output: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:32:43,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:32:51,966 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-03 15:32:56,403 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-03 15:32:57,858 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse0 (not (= |c_~#A~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (.cse1 (select (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset|))) (or (and (or (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| (store (select |c_#pthreadsMutex| |c_~#__global_lock~0.base|) |c_~#__global_lock~0.offset| 1)) |c_~#A~0.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~m~0#1.offset| (+ |c_~#A~0.offset| 12)) (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|)) (not (= |c_~#A~0.offset| |c_ULTIMATE.start_main_~d~0#1.offset|))) .cse0 (= .cse1 1)) (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) .cse0 (<= .cse1 1) (<= 1 .cse1)))) (or (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1876 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1876))) (store .cse2 |c_~#A~0.base| (let ((.cse3 (select .cse2 |c_~#A~0.base|))) (store .cse3 |c_~#A~0.offset| (+ (- 1) (select .cse3 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1879) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (forall ((v_ArrVal_1875 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1875) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))))) is different from false [2023-08-03 15:33:00,891 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse0 (not (= |c_~#A~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (.cse1 (select (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset|))) (or (and .cse0 (= .cse1 1) (or (not (= |c_~#A~0.offset| |c_ULTIMATE.start_main_~d~0#1.offset|)) (let ((.cse2 (select |c_#pthreadsMutex| |c_~#__global_lock~0.base|))) (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| .cse2) |c_~#A~0.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~m~0#1.offset| (+ |c_~#A~0.offset| 12)) (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|) (= (select .cse2 |c_~#__global_lock~0.offset|) 1))))) (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) .cse0 (<= .cse1 1) (<= 1 .cse1)))) (or (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1876 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1876))) (store .cse3 |c_~#A~0.base| (let ((.cse4 (select .cse3 |c_~#A~0.base|))) (store .cse4 |c_~#A~0.offset| (+ (- 1) (select .cse4 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1879) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (forall ((v_ArrVal_1875 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1875) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))))) is different from false [2023-08-03 15:33:06,818 INFO L124 PetriNetUnfolderBase]: 4523/12933 cut-off events. [2023-08-03 15:33:06,818 INFO L125 PetriNetUnfolderBase]: For 307911/308000 co-relation queries the response was YES. [2023-08-03 15:33:06,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98967 conditions, 12933 events. 4523/12933 cut-off events. For 307911/308000 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 137862 event pairs, 1709 based on Foata normal form. 108/11922 useless extension candidates. Maximal degree in co-relation 98755. Up to 6197 conditions per place. [2023-08-03 15:33:06,973 INFO L140 encePairwiseOnDemand]: 426/466 looper letters, 775 selfloop transitions, 736 changer transitions 308/1827 dead transitions. [2023-08-03 15:33:06,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 1827 transitions, 45462 flow [2023-08-03 15:33:06,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-08-03 15:33:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2023-08-03 15:33:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 10548 transitions. [2023-08-03 15:33:06,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3100711388088659 [2023-08-03 15:33:06,979 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 10548 transitions. [2023-08-03 15:33:06,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 10548 transitions. [2023-08-03 15:33:06,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:33:06,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 10548 transitions. [2023-08-03 15:33:06,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 74 states, 73 states have (on average 144.4931506849315) internal successors, (10548), 73 states have internal predecessors, (10548), 0 states have call successors, (0), 0 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-03 15:33:07,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 74 states, 74 states have (on average 466.0) internal successors, (34484), 74 states have internal predecessors, (34484), 0 states have call successors, (0), 0 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-03 15:33:07,003 INFO L81 ComplementDD]: Finished complementDD. Result has 74 states, 74 states have (on average 466.0) internal successors, (34484), 74 states have internal predecessors, (34484), 0 states have call successors, (0), 0 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-03 15:33:07,003 INFO L175 Difference]: Start difference. First operand has 610 places, 1142 transitions, 29013 flow. Second operand 73 states and 10548 transitions. [2023-08-03 15:33:07,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 1827 transitions, 45462 flow [2023-08-03 15:33:09,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 1827 transitions, 43451 flow, removed 597 selfloop flow, removed 37 redundant places. [2023-08-03 15:33:09,482 INFO L231 Difference]: Finished difference. Result has 656 places, 1376 transitions, 35955 flow [2023-08-03 15:33:09,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=27705, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=533, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=35955, PETRI_PLACES=656, PETRI_TRANSITIONS=1376} [2023-08-03 15:33:09,483 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 589 predicate places. [2023-08-03 15:33:09,483 INFO L495 AbstractCegarLoop]: Abstraction has has 656 places, 1376 transitions, 35955 flow [2023-08-03 15:33:09,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 139.45454545454547) internal successors, (4602), 33 states have internal predecessors, (4602), 0 states have call successors, (0), 0 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-03 15:33:09,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:33:09,484 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:33:09,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-03 15:33:09,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-08-03 15:33:09,684 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:33:09,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:33:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash 228227197, now seen corresponding path program 9 times [2023-08-03 15:33:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:33:09,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393819138] [2023-08-03 15:33:09,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:33:09,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:33:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:33:10,972 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-03 15:33:10,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:33:10,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393819138] [2023-08-03 15:33:10,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393819138] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:33:10,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541160137] [2023-08-03 15:33:10,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 15:33:10,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:33:10,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:33:10,973 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:33:10,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-03 15:33:11,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-03 15:33:11,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:33:11,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-03 15:33:11,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:33:11,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:33:11,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:33:11,341 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:33:11,341 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:33:11,383 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 9 treesize of output 11 [2023-08-03 15:33:11,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:33:11,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:33:11,444 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:33:11,444 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:33:11,491 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 9 treesize of output 11 [2023-08-03 15:33:11,830 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:33:11,830 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:33:12,359 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 15:33:14,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:33:14,945 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 16 treesize of output 18 [2023-08-03 15:33:15,974 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:33:15,975 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 417 treesize of output 382 [2023-08-03 15:33:16,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:33:16,691 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 16 treesize of output 18 [2023-08-03 15:33:16,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:33:16,799 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 16 treesize of output 18 [2023-08-03 15:33:17,379 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:33:17,379 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 15:33:18,902 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:33:18,910 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:33:18,910 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 17 treesize of output 11 [2023-08-03 15:33:19,584 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 15:33:21,067 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 15:33:21,305 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-03 15:33:21,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:33:21,312 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1975 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1975) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 15:33:21,816 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1964))) (store .cse2 |c_~#A~0.base| (let ((.cse3 (select .cse2 |c_~#A~0.base|))) (store .cse3 |c_~#A~0.offset| (+ (select .cse3 |c_~#A~0.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1972))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (- 1) (select .cse1 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1975) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (forall ((v_ArrVal_1971 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_1971) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) is different from false [2023-08-03 15:33:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-03 15:33:21,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541160137] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:33:21,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:33:21,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 32 [2023-08-03 15:33:21,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509492437] [2023-08-03 15:33:21,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:33:21,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-03 15:33:21,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:33:21,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-03 15:33:21,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=837, Unknown=35, NotChecked=122, Total=1122 [2023-08-03 15:33:22,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 15:33:22,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 1376 transitions, 35955 flow. Second operand has 34 states, 34 states have (on average 139.38235294117646) internal successors, (4739), 34 states have internal predecessors, (4739), 0 states have call successors, (0), 0 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-03 15:33:22,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:33:22,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 15:33:22,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:33:28,516 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#A~0.base|)) (.cse3 (forall ((v_ArrVal_1971 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1971) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))))) (and (or (forall ((v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_~#A~0.base| (store .cse2 |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1972))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (- 1) (select .cse1 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1975) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) .cse3) (or (forall ((v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store |c_#memory_int| |c_~#A~0.base| (store .cse2 |c_~#A~0.offset| (+ (select .cse2 |c_~#A~0.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1972))) (store .cse4 |c_~#A~0.base| (let ((.cse5 (select .cse4 |c_~#A~0.base|))) (store .cse5 |c_~#A~0.offset| (+ (- 1) (select .cse5 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1975) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) .cse3) (or (forall ((v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (= (select (select (store (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1972))) (store .cse6 |c_~#A~0.base| (let ((.cse7 (select .cse6 |c_~#A~0.base|))) (store .cse7 |c_~#A~0.offset| (+ (- 1) (select .cse7 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1975) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) .cse3))) is different from false [2023-08-03 15:33:28,681 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse6 |c_~#A~0.offset| (+ (select .cse6 |c_~#A~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1972))) (store .cse4 |c_~#A~0.base| (let ((.cse5 (select .cse4 |c_~#A~0.base|))) (store .cse5 |c_~#A~0.offset| (+ (- 1) (select .cse5 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1975) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (.cse1 (forall ((v_ArrVal_1971 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1971) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))))) (and (or .cse0 (forall ((v_ArrVal_1971 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_1971) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (or .cse0 .cse1) (or (forall ((v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1972))) (store .cse2 |c_~#A~0.base| (let ((.cse3 (select .cse2 |c_~#A~0.base|))) (store .cse3 |c_~#A~0.offset| (+ (- 1) (select .cse3 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1975) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) .cse1))) is different from false [2023-08-03 15:33:38,624 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse1 (select .cse4 |c_~#A~0.offset|))) (let ((.cse6 (forall ((v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (= (select (select (store (let ((.cse9 (store (store |c_#memory_int| |c_~#A~0.base| (store .cse4 |c_~#A~0.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1972))) (store .cse9 |c_~#A~0.base| (let ((.cse10 (select .cse9 |c_~#A~0.base|))) (store .cse10 |c_~#A~0.offset| (+ (- 1) (select .cse10 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1975) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (.cse5 (forall ((v_ArrVal_1971 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1971) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))))) (and (let ((.cse0 (= .cse1 1))) (or (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) .cse0) (and (not (= |c_~#A~0.offset| |c_ULTIMATE.start_main_~d~0#1.offset|)) .cse0))) (or (forall ((v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (= (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_~#A~0.base| (store .cse4 |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1972))) (store .cse2 |c_~#A~0.base| (let ((.cse3 (select .cse2 |c_~#A~0.base|))) (store .cse3 |c_~#A~0.offset| (+ (- 1) (select .cse3 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1975) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) .cse5) (or .cse6 (forall ((v_ArrVal_1971 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_1971) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (forall ((v_ArrVal_1975 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse4 |c_~#A~0.offset| (+ .cse1 (- 1)))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1975) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (or .cse6 .cse5) (or (forall ((v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (= (select (select (store (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1972))) (store .cse7 |c_~#A~0.base| (let ((.cse8 (select .cse7 |c_~#A~0.base|))) (store .cse8 |c_~#A~0.offset| (+ (- 1) (select .cse8 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1975) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) .cse5))))) is different from false [2023-08-03 15:33:38,815 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse2 |c_~#A~0.offset| (+ (select .cse2 |c_~#A~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1972))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (- 1) (select .cse1 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1975) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (forall ((v_ArrVal_1971 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_1971) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (or (forall ((v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1972))) (store .cse3 |c_~#A~0.base| (let ((.cse4 (select .cse3 |c_~#A~0.base|))) (store .cse4 |c_~#A~0.offset| (+ (- 1) (select .cse4 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1975) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (forall ((v_ArrVal_1971 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1971) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))))) is different from false [2023-08-03 15:33:50,915 INFO L124 PetriNetUnfolderBase]: 4205/12063 cut-off events. [2023-08-03 15:33:50,915 INFO L125 PetriNetUnfolderBase]: For 357208/357302 co-relation queries the response was YES. [2023-08-03 15:33:51,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109315 conditions, 12063 events. 4205/12063 cut-off events. For 357208/357302 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 126363 event pairs, 1680 based on Foata normal form. 296/11283 useless extension candidates. Maximal degree in co-relation 109084. Up to 3808 conditions per place. [2023-08-03 15:33:51,079 INFO L140 encePairwiseOnDemand]: 430/466 looper letters, 647 selfloop transitions, 228 changer transitions 786/1669 dead transitions. [2023-08-03 15:33:51,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 1669 transitions, 45000 flow [2023-08-03 15:33:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-08-03 15:33:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-08-03 15:33:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 7766 transitions. [2023-08-03 15:33:51,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3086154824352249 [2023-08-03 15:33:51,084 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 7766 transitions. [2023-08-03 15:33:51,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 7766 transitions. [2023-08-03 15:33:51,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:33:51,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 7766 transitions. [2023-08-03 15:33:51,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 143.8148148148148) internal successors, (7766), 54 states have internal predecessors, (7766), 0 states have call successors, (0), 0 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-03 15:33:51,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 466.0) internal successors, (25630), 55 states have internal predecessors, (25630), 0 states have call successors, (0), 0 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-03 15:33:51,099 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 466.0) internal successors, (25630), 55 states have internal predecessors, (25630), 0 states have call successors, (0), 0 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-03 15:33:51,100 INFO L175 Difference]: Start difference. First operand has 656 places, 1376 transitions, 35955 flow. Second operand 54 states and 7766 transitions. [2023-08-03 15:33:51,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 1669 transitions, 45000 flow [2023-08-03 15:33:55,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 1669 transitions, 43470 flow, removed 552 selfloop flow, removed 35 redundant places. [2023-08-03 15:33:55,149 INFO L231 Difference]: Finished difference. Result has 687 places, 826 transitions, 19458 flow [2023-08-03 15:33:55,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=32093, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1050, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=19458, PETRI_PLACES=687, PETRI_TRANSITIONS=826} [2023-08-03 15:33:55,150 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 620 predicate places. [2023-08-03 15:33:55,150 INFO L495 AbstractCegarLoop]: Abstraction has has 687 places, 826 transitions, 19458 flow [2023-08-03 15:33:55,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 139.38235294117646) internal successors, (4739), 34 states have internal predecessors, (4739), 0 states have call successors, (0), 0 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-03 15:33:55,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:33:55,151 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:33:55,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-03 15:33:55,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-08-03 15:33:55,351 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:33:55,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:33:55,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1062078483, now seen corresponding path program 10 times [2023-08-03 15:33:55,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:33:55,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903194868] [2023-08-03 15:33:55,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:33:55,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:33:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:33:56,047 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-03 15:33:56,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:33:56,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903194868] [2023-08-03 15:33:56,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903194868] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:33:56,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210641719] [2023-08-03 15:33:56,047 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-03 15:33:56,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:33:56,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:33:56,049 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:33:56,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-03 15:33:56,200 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-03 15:33:56,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:33:56,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-03 15:33:56,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:33:56,396 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 9 treesize of output 11 [2023-08-03 15:33:56,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:33:56,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:33:56,441 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:33:56,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:33:56,500 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 9 treesize of output 11 [2023-08-03 15:33:56,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:33:56,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:33:56,554 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:33:56,555 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:33:56,932 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:33:56,932 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 412 treesize of output 339 [2023-08-03 15:33:58,287 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 15:33:59,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:33:59,871 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 16 treesize of output 18 [2023-08-03 15:34:01,292 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:34:01,292 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 423 treesize of output 388 [2023-08-03 15:34:01,877 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:34:01,877 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 412 treesize of output 339 [2023-08-03 15:34:03,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:34:03,262 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 16 treesize of output 18 [2023-08-03 15:34:03,636 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:34:03,640 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:34:03,640 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 17 treesize of output 11 [2023-08-03 15:34:04,196 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 15:34:04,624 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 15:34:05,207 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-03 15:34:05,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:34:05,766 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-03 15:34:05,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210641719] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:34:05,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:34:05,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2023-08-03 15:34:05,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169244124] [2023-08-03 15:34:05,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:34:05,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-03 15:34:05,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:34:05,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-03 15:34:05,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=777, Unknown=10, NotChecked=0, Total=930 [2023-08-03 15:34:09,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 466 [2023-08-03 15:34:09,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 687 places, 826 transitions, 19458 flow. Second operand has 31 states, 31 states have (on average 137.38709677419354) internal successors, (4259), 31 states have internal predecessors, (4259), 0 states have call successors, (0), 0 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-03 15:34:09,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:34:09,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 466 [2023-08-03 15:34:09,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:34:24,628 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 134 DAG size of output: 104 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:34:29,832 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-03 15:34:36,424 INFO L124 PetriNetUnfolderBase]: 1933/5703 cut-off events. [2023-08-03 15:34:36,424 INFO L125 PetriNetUnfolderBase]: For 158152/158176 co-relation queries the response was YES. [2023-08-03 15:34:36,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51336 conditions, 5703 events. 1933/5703 cut-off events. For 158152/158176 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 51492 event pairs, 910 based on Foata normal form. 27/5407 useless extension candidates. Maximal degree in co-relation 51096. Up to 3536 conditions per place. [2023-08-03 15:34:36,509 INFO L140 encePairwiseOnDemand]: 441/466 looper letters, 687 selfloop transitions, 189 changer transitions 67/951 dead transitions. [2023-08-03 15:34:36,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 951 transitions, 23282 flow [2023-08-03 15:34:36,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-03 15:34:36,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-03 15:34:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4819 transitions. [2023-08-03 15:34:36,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3041529916687705 [2023-08-03 15:34:36,512 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 4819 transitions. [2023-08-03 15:34:36,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 4819 transitions. [2023-08-03 15:34:36,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:34:36,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 4819 transitions. [2023-08-03 15:34:36,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 141.73529411764707) internal successors, (4819), 34 states have internal predecessors, (4819), 0 states have call successors, (0), 0 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-03 15:34:36,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 466.0) internal successors, (16310), 35 states have internal predecessors, (16310), 0 states have call successors, (0), 0 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-03 15:34:36,522 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 466.0) internal successors, (16310), 35 states have internal predecessors, (16310), 0 states have call successors, (0), 0 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-03 15:34:36,522 INFO L175 Difference]: Start difference. First operand has 687 places, 826 transitions, 19458 flow. Second operand 34 states and 4819 transitions. [2023-08-03 15:34:36,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 951 transitions, 23282 flow [2023-08-03 15:34:37,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 951 transitions, 21913 flow, removed 351 selfloop flow, removed 75 redundant places. [2023-08-03 15:34:37,679 INFO L231 Difference]: Finished difference. Result has 563 places, 815 transitions, 18515 flow [2023-08-03 15:34:37,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=18281, PETRI_DIFFERENCE_MINUEND_PLACES=520, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=826, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=18515, PETRI_PLACES=563, PETRI_TRANSITIONS=815} [2023-08-03 15:34:37,679 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 496 predicate places. [2023-08-03 15:34:37,679 INFO L495 AbstractCegarLoop]: Abstraction has has 563 places, 815 transitions, 18515 flow [2023-08-03 15:34:37,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 137.38709677419354) internal successors, (4259), 31 states have internal predecessors, (4259), 0 states have call successors, (0), 0 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-03 15:34:37,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:34:37,680 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:34:37,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-03 15:34:37,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-08-03 15:34:37,880 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:34:37,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:34:37,881 INFO L85 PathProgramCache]: Analyzing trace with hash -6116161, now seen corresponding path program 11 times [2023-08-03 15:34:37,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:34:37,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338569609] [2023-08-03 15:34:37,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:34:37,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:34:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:34:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:34:38,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:34:38,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338569609] [2023-08-03 15:34:38,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338569609] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:34:38,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842006139] [2023-08-03 15:34:38,188 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-03 15:34:38,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:34:38,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:34:38,189 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:34:38,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-03 15:34:38,343 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-03 15:34:38,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:34:38,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-03 15:34:38,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:34:38,524 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 9 treesize of output 11 [2023-08-03 15:34:38,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:34:38,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:34:38,575 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:34:38,576 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:34:38,621 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 9 treesize of output 11 [2023-08-03 15:34:38,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:34:38,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:34:38,676 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:34:38,676 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:34:39,014 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:34:39,015 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 15:34:40,165 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:34:40,166 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 15:34:41,030 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-03 15:34:41,392 INFO L322 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-08-03 15:34:41,392 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 367 treesize of output 356 [2023-08-03 15:34:42,009 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 15:34:42,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 15:34:42,869 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 32 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 151 [2023-08-03 15:34:43,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:34:43,300 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:34:43,329 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2162 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2162) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) (forall ((v_ArrVal_2162 (Array Int Int))) (<= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2162) |c_~#A~0.base|) |c_~#A~0.offset|)))) is different from false [2023-08-03 15:34:43,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:34:43,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842006139] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:34:43,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:34:43,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-08-03 15:34:43,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951547531] [2023-08-03 15:34:43,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:34:43,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-03 15:34:43,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:34:43,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-03 15:34:43,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=410, Unknown=2, NotChecked=42, Total=552 [2023-08-03 15:34:43,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 466 [2023-08-03 15:34:43,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 815 transitions, 18515 flow. Second operand has 24 states, 24 states have (on average 140.91666666666666) internal successors, (3382), 24 states have internal predecessors, (3382), 0 states have call successors, (0), 0 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-03 15:34:43,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:34:43,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 466 [2023-08-03 15:34:43,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:34:48,700 INFO L124 PetriNetUnfolderBase]: 2182/6466 cut-off events. [2023-08-03 15:34:48,700 INFO L125 PetriNetUnfolderBase]: For 144348/144377 co-relation queries the response was YES. [2023-08-03 15:34:48,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54073 conditions, 6466 events. 2182/6466 cut-off events. For 144348/144377 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 60347 event pairs, 474 based on Foata normal form. 55/6147 useless extension candidates. Maximal degree in co-relation 53874. Up to 2326 conditions per place. [2023-08-03 15:34:48,781 INFO L140 encePairwiseOnDemand]: 446/466 looper letters, 627 selfloop transitions, 197 changer transitions 249/1081 dead transitions. [2023-08-03 15:34:48,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 1081 transitions, 24800 flow [2023-08-03 15:34:48,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-03 15:34:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-03 15:34:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4177 transitions. [2023-08-03 15:34:48,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3201256897608829 [2023-08-03 15:34:48,784 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4177 transitions. [2023-08-03 15:34:48,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4177 transitions. [2023-08-03 15:34:48,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:34:48,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4177 transitions. [2023-08-03 15:34:48,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 149.17857142857142) internal successors, (4177), 28 states have internal predecessors, (4177), 0 states have call successors, (0), 0 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-03 15:34:48,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 466.0) internal successors, (13514), 29 states have internal predecessors, (13514), 0 states have call successors, (0), 0 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-03 15:34:48,792 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 466.0) internal successors, (13514), 29 states have internal predecessors, (13514), 0 states have call successors, (0), 0 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-03 15:34:48,792 INFO L175 Difference]: Start difference. First operand has 563 places, 815 transitions, 18515 flow. Second operand 28 states and 4177 transitions. [2023-08-03 15:34:48,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 1081 transitions, 24800 flow [2023-08-03 15:34:49,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 1081 transitions, 24427 flow, removed 45 selfloop flow, removed 26 redundant places. [2023-08-03 15:34:49,731 INFO L231 Difference]: Finished difference. Result has 566 places, 760 transitions, 17317 flow [2023-08-03 15:34:49,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=18145, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=814, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=17317, PETRI_PLACES=566, PETRI_TRANSITIONS=760} [2023-08-03 15:34:49,732 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 499 predicate places. [2023-08-03 15:34:49,732 INFO L495 AbstractCegarLoop]: Abstraction has has 566 places, 760 transitions, 17317 flow [2023-08-03 15:34:49,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 140.91666666666666) internal successors, (3382), 24 states have internal predecessors, (3382), 0 states have call successors, (0), 0 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-03 15:34:49,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:34:49,732 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:34:49,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-03 15:34:49,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:34:49,937 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:34:49,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:34:49,937 INFO L85 PathProgramCache]: Analyzing trace with hash 639717499, now seen corresponding path program 12 times [2023-08-03 15:34:49,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:34:49,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203401380] [2023-08-03 15:34:49,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:34:49,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:34:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:34:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:34:50,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:34:50,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203401380] [2023-08-03 15:34:50,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203401380] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:34:50,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120105276] [2023-08-03 15:34:50,417 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-03 15:34:50,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:34:50,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:34:50,418 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:34:50,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-03 15:34:50,591 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-03 15:34:50,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:34:50,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-03 15:34:50,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:34:50,786 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 9 treesize of output 11 [2023-08-03 15:34:50,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:34:50,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:34:50,823 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:34:50,824 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:34:50,889 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 9 treesize of output 11 [2023-08-03 15:34:50,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:34:50,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:34:50,938 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:34:50,938 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:34:51,305 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:34:51,305 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:34:52,341 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:34:52,341 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:34:53,614 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-03 15:34:54,921 INFO L322 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-08-03 15:34:54,922 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 370 treesize of output 375 [2023-08-03 15:34:55,987 INFO L322 Elim1Store]: treesize reduction 48, result has 37.7 percent of original size [2023-08-03 15:34:55,987 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 370 treesize of output 305 [2023-08-03 15:34:56,736 INFO L322 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-08-03 15:34:56,736 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 252 treesize of output 257 [2023-08-03 15:34:57,095 INFO L322 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-08-03 15:34:57,096 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 249 treesize of output 238 [2023-08-03 15:34:57,612 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 32 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 151 [2023-08-03 15:34:57,826 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 32 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 151 [2023-08-03 15:34:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:34:58,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:34:58,183 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2255 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_ULTIMATE.start_main_~m~0#1.base| (store (select |c_#pthreadsMutex| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset| 1)) |c_~#__global_lock~0.base| v_ArrVal_2255) |c_~#A~0.base|) (+ |c_~#A~0.offset| 12)) 0))) (forall ((v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2250) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2254) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) is different from false [2023-08-03 15:34:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-03 15:34:58,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120105276] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:34:58,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:34:58,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2023-08-03 15:34:58,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185206740] [2023-08-03 15:34:58,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:34:58,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-03 15:34:58,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:34:58,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-03 15:34:58,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=405, Unknown=5, NotChecked=42, Total=552 [2023-08-03 15:34:58,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 15:34:58,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 760 transitions, 17317 flow. Second operand has 24 states, 24 states have (on average 139.91666666666666) internal successors, (3358), 24 states have internal predecessors, (3358), 0 states have call successors, (0), 0 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-03 15:34:58,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:34:58,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 15:34:58,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:35:04,063 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-03 15:35:08,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:35:16,668 INFO L124 PetriNetUnfolderBase]: 1992/5904 cut-off events. [2023-08-03 15:35:16,669 INFO L125 PetriNetUnfolderBase]: For 145403/145415 co-relation queries the response was YES. [2023-08-03 15:35:16,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50559 conditions, 5904 events. 1992/5904 cut-off events. For 145403/145415 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 53951 event pairs, 552 based on Foata normal form. 38/5607 useless extension candidates. Maximal degree in co-relation 50354. Up to 2683 conditions per place. [2023-08-03 15:35:16,747 INFO L140 encePairwiseOnDemand]: 442/466 looper letters, 596 selfloop transitions, 251 changer transitions 142/997 dead transitions. [2023-08-03 15:35:16,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 997 transitions, 23136 flow [2023-08-03 15:35:16,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-03 15:35:16,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-03 15:35:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4421 transitions. [2023-08-03 15:35:16,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31623748211731045 [2023-08-03 15:35:16,750 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4421 transitions. [2023-08-03 15:35:16,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4421 transitions. [2023-08-03 15:35:16,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:35:16,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4421 transitions. [2023-08-03 15:35:16,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 147.36666666666667) internal successors, (4421), 30 states have internal predecessors, (4421), 0 states have call successors, (0), 0 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-03 15:35:16,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 466.0) internal successors, (14446), 31 states have internal predecessors, (14446), 0 states have call successors, (0), 0 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-03 15:35:16,759 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 466.0) internal successors, (14446), 31 states have internal predecessors, (14446), 0 states have call successors, (0), 0 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-03 15:35:16,759 INFO L175 Difference]: Start difference. First operand has 566 places, 760 transitions, 17317 flow. Second operand 30 states and 4421 transitions. [2023-08-03 15:35:16,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 997 transitions, 23136 flow [2023-08-03 15:35:17,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 997 transitions, 22464 flow, removed 154 selfloop flow, removed 33 redundant places. [2023-08-03 15:35:17,630 INFO L231 Difference]: Finished difference. Result has 560 places, 753 transitions, 17395 flow [2023-08-03 15:35:17,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=16773, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=17395, PETRI_PLACES=560, PETRI_TRANSITIONS=753} [2023-08-03 15:35:17,631 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 493 predicate places. [2023-08-03 15:35:17,631 INFO L495 AbstractCegarLoop]: Abstraction has has 560 places, 753 transitions, 17395 flow [2023-08-03 15:35:17,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 139.91666666666666) internal successors, (3358), 24 states have internal predecessors, (3358), 0 states have call successors, (0), 0 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-03 15:35:17,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:35:17,632 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:35:17,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-03 15:35:17,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-08-03 15:35:17,832 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:35:17,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:35:17,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1547944806, now seen corresponding path program 1 times [2023-08-03 15:35:17,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:35:17,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353368637] [2023-08-03 15:35:17,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:35:17,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:35:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:35:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:35:18,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:35:18,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353368637] [2023-08-03 15:35:18,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353368637] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:35:18,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67621293] [2023-08-03 15:35:18,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:35:18,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:35:18,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:35:18,359 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:35:18,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-03 15:35:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:35:18,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-03 15:35:18,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:35:18,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:35:18,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:35:18,734 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:35:18,735 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:35:18,769 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 9 treesize of output 11 [2023-08-03 15:35:18,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:35:18,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:35:18,829 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:35:18,829 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:35:18,872 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 9 treesize of output 11 [2023-08-03 15:35:19,196 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:35:19,197 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 15:35:20,331 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:35:20,331 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 15:35:21,805 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 15:35:22,991 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:35:23,000 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:35:23,000 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 17 treesize of output 11 [2023-08-03 15:35:24,238 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 15:35:25,204 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 15:35:25,803 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 15:35:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:35:25,990 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:35:25,999 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2352 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2352) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 15:35:26,010 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2352 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post10#1|))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2352) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 15:35:26,015 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2352 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2352) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 15:35:26,023 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2352 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread2of2ForFork0_#t~post7#1|)) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2352) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 15:35:26,026 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2352 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (select .cse0 |c_~#A~0.offset|)))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2352) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 15:35:26,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:35:26,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67621293] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:35:26,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:35:26,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 24 [2023-08-03 15:35:26,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011999501] [2023-08-03 15:35:26,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:35:26,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-03 15:35:26,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:35:26,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-03 15:35:26,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=337, Unknown=6, NotChecked=210, Total=650 [2023-08-03 15:35:26,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 466 [2023-08-03 15:35:26,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 753 transitions, 17395 flow. Second operand has 26 states, 26 states have (on average 141.03846153846155) internal successors, (3667), 26 states have internal predecessors, (3667), 0 states have call successors, (0), 0 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-03 15:35:26,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:35:26,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 466 [2023-08-03 15:35:26,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:35:31,820 INFO L124 PetriNetUnfolderBase]: 2199/6579 cut-off events. [2023-08-03 15:35:31,820 INFO L125 PetriNetUnfolderBase]: For 165145/165163 co-relation queries the response was YES. [2023-08-03 15:35:31,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56093 conditions, 6579 events. 2199/6579 cut-off events. For 165145/165163 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 62122 event pairs, 1157 based on Foata normal form. 83/6520 useless extension candidates. Maximal degree in co-relation 55894. Up to 3928 conditions per place. [2023-08-03 15:35:31,903 INFO L140 encePairwiseOnDemand]: 445/466 looper letters, 577 selfloop transitions, 78 changer transitions 339/1002 dead transitions. [2023-08-03 15:35:31,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 1002 transitions, 24023 flow [2023-08-03 15:35:31,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-03 15:35:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-03 15:35:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4097 transitions. [2023-08-03 15:35:31,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31399448191293683 [2023-08-03 15:35:31,906 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4097 transitions. [2023-08-03 15:35:31,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4097 transitions. [2023-08-03 15:35:31,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:35:31,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4097 transitions. [2023-08-03 15:35:31,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 146.32142857142858) internal successors, (4097), 28 states have internal predecessors, (4097), 0 states have call successors, (0), 0 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-03 15:35:31,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 466.0) internal successors, (13514), 29 states have internal predecessors, (13514), 0 states have call successors, (0), 0 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-03 15:35:31,914 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 466.0) internal successors, (13514), 29 states have internal predecessors, (13514), 0 states have call successors, (0), 0 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-03 15:35:31,914 INFO L175 Difference]: Start difference. First operand has 560 places, 753 transitions, 17395 flow. Second operand 28 states and 4097 transitions. [2023-08-03 15:35:31,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 1002 transitions, 24023 flow [2023-08-03 15:35:32,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 1002 transitions, 23652 flow, removed 54 selfloop flow, removed 26 redundant places. [2023-08-03 15:35:32,868 INFO L231 Difference]: Finished difference. Result has 572 places, 643 transitions, 14783 flow [2023-08-03 15:35:32,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=17041, PETRI_DIFFERENCE_MINUEND_PLACES=529, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=14783, PETRI_PLACES=572, PETRI_TRANSITIONS=643} [2023-08-03 15:35:32,868 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 505 predicate places. [2023-08-03 15:35:32,868 INFO L495 AbstractCegarLoop]: Abstraction has has 572 places, 643 transitions, 14783 flow [2023-08-03 15:35:32,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 141.03846153846155) internal successors, (3667), 26 states have internal predecessors, (3667), 0 states have call successors, (0), 0 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-03 15:35:32,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:35:32,869 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:35:32,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-03 15:35:33,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2023-08-03 15:35:33,074 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:35:33,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:35:33,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1871404868, now seen corresponding path program 2 times [2023-08-03 15:35:33,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:35:33,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433554903] [2023-08-03 15:35:33,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:35:33,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:35:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:35:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:35:33,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:35:33,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433554903] [2023-08-03 15:35:33,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433554903] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:35:33,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568377870] [2023-08-03 15:35:33,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:35:33,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:35:33,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:35:33,451 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:35:33,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-03 15:35:33,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:35:33,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:35:33,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-03 15:35:33,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:35:33,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:35:33,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:35:33,844 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:35:33,844 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:35:33,872 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 9 treesize of output 11 [2023-08-03 15:35:33,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:35:33,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:35:33,946 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:35:33,946 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:35:33,978 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 9 treesize of output 11 [2023-08-03 15:35:34,327 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:35:34,327 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:35:35,542 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:35:35,543 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:35:37,167 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 15:35:39,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:35:39,127 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 16 treesize of output 18 [2023-08-03 15:35:40,796 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:35:40,807 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:35:40,808 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 17 treesize of output 11 [2023-08-03 15:35:41,480 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 15:35:41,860 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 15:35:42,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 15:35:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:35:42,583 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:35:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:35:42,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568377870] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:35:42,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:35:42,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-08-03 15:35:42,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957206868] [2023-08-03 15:35:42,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:35:42,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-03 15:35:42,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:35:42,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-03 15:35:42,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=575, Unknown=6, NotChecked=0, Total=702 [2023-08-03 15:35:43,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 15:35:43,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 643 transitions, 14783 flow. Second operand has 27 states, 27 states have (on average 139.5185185185185) internal successors, (3767), 27 states have internal predecessors, (3767), 0 states have call successors, (0), 0 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-03 15:35:43,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:35:43,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 15:35:43,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:35:48,706 INFO L124 PetriNetUnfolderBase]: 1797/5409 cut-off events. [2023-08-03 15:35:48,706 INFO L125 PetriNetUnfolderBase]: For 140385/140395 co-relation queries the response was YES. [2023-08-03 15:35:48,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46123 conditions, 5409 events. 1797/5409 cut-off events. For 140385/140395 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 49700 event pairs, 1000 based on Foata normal form. 81/5381 useless extension candidates. Maximal degree in co-relation 45916. Up to 3262 conditions per place. [2023-08-03 15:35:48,776 INFO L140 encePairwiseOnDemand]: 448/466 looper letters, 483 selfloop transitions, 91 changer transitions 246/828 dead transitions. [2023-08-03 15:35:48,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 828 transitions, 19770 flow [2023-08-03 15:35:48,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-03 15:35:48,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-03 15:35:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4346 transitions. [2023-08-03 15:35:48,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31087267525035767 [2023-08-03 15:35:48,779 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4346 transitions. [2023-08-03 15:35:48,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4346 transitions. [2023-08-03 15:35:48,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:35:48,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4346 transitions. [2023-08-03 15:35:48,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 144.86666666666667) internal successors, (4346), 30 states have internal predecessors, (4346), 0 states have call successors, (0), 0 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-03 15:35:48,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 466.0) internal successors, (14446), 31 states have internal predecessors, (14446), 0 states have call successors, (0), 0 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-03 15:35:48,788 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 466.0) internal successors, (14446), 31 states have internal predecessors, (14446), 0 states have call successors, (0), 0 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-03 15:35:48,788 INFO L175 Difference]: Start difference. First operand has 572 places, 643 transitions, 14783 flow. Second operand 30 states and 4346 transitions. [2023-08-03 15:35:48,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 828 transitions, 19770 flow [2023-08-03 15:35:49,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 828 transitions, 19112 flow, removed 240 selfloop flow, removed 35 redundant places. [2023-08-03 15:35:49,529 INFO L231 Difference]: Finished difference. Result has 538 places, 551 transitions, 12533 flow [2023-08-03 15:35:49,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=14351, PETRI_DIFFERENCE_MINUEND_PLACES=499, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=12533, PETRI_PLACES=538, PETRI_TRANSITIONS=551} [2023-08-03 15:35:49,529 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 471 predicate places. [2023-08-03 15:35:49,529 INFO L495 AbstractCegarLoop]: Abstraction has has 538 places, 551 transitions, 12533 flow [2023-08-03 15:35:49,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 139.5185185185185) internal successors, (3767), 27 states have internal predecessors, (3767), 0 states have call successors, (0), 0 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-03 15:35:49,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:35:49,530 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:35:49,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-08-03 15:35:49,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2023-08-03 15:35:49,730 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:35:49,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:35:49,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1193977212, now seen corresponding path program 3 times [2023-08-03 15:35:49,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:35:49,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574010185] [2023-08-03 15:35:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:35:49,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:35:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:35:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:35:50,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:35:50,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574010185] [2023-08-03 15:35:50,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574010185] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:35:50,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290739332] [2023-08-03 15:35:50,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 15:35:50,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:35:50,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:35:50,650 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:35:50,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-03 15:35:50,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-03 15:35:50,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:35:50,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-03 15:35:50,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:35:51,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:35:51,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:35:51,072 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:35:51,073 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:35:51,127 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 9 treesize of output 11 [2023-08-03 15:35:51,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:35:51,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:35:51,177 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 15:35:51,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 15:35:51,241 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 9 treesize of output 11 [2023-08-03 15:35:51,569 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:35:51,569 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:35:52,887 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 15:35:52,888 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 15:35:54,584 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 15:35:56,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:35:56,555 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 16 treesize of output 18 [2023-08-03 15:35:58,516 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:35:58,516 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 379 treesize of output 344 [2023-08-03 15:35:59,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:35:59,569 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 16 treesize of output 18 [2023-08-03 15:35:59,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:35:59,775 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 16 treesize of output 18 [2023-08-03 15:36:00,680 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 15:36:00,681 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 379 treesize of output 344 [2023-08-03 15:36:00,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:36:00,963 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 16 treesize of output 18 [2023-08-03 15:36:01,377 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 15:36:01,383 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:36:01,383 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 17 treesize of output 11 [2023-08-03 15:36:01,997 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 15:36:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:36:02,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:36:02,504 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2542 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2542) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_2543 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post10#1|))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2543) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) is different from false [2023-08-03 15:36:02,512 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2542 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2542) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_2543 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2543) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) is different from false [2023-08-03 15:36:02,572 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2542 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2542) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_2543 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (select .cse0 |c_~#A~0.offset|)))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2543) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) is different from false [2023-08-03 15:36:02,589 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2543 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (select .cse0 |c_~#A~0.offset|)))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2543) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (forall ((v_ArrVal_2542 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_2542) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) is different from false [2023-08-03 15:36:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-08-03 15:36:02,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290739332] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:36:02,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:36:02,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 10] total 31 [2023-08-03 15:36:02,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315438904] [2023-08-03 15:36:02,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:36:02,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-03 15:36:02,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:36:02,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-03 15:36:02,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=665, Unknown=17, NotChecked=228, Total=1056 [2023-08-03 15:36:02,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 15:36:02,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 551 transitions, 12533 flow. Second operand has 33 states, 33 states have (on average 139.36363636363637) internal successors, (4599), 33 states have internal predecessors, (4599), 0 states have call successors, (0), 0 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-03 15:36:02,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:36:02,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 15:36:02,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:36:04,712 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse36 (select |c_#memory_int| |c_~#A~0.base|)) (.cse40 (select |c_#memory_int| 1)) (.cse39 (select |c_#memory_int| 4)) (.cse42 (select |c_#memory_int| 3)) (.cse41 (select |c_#memory_int| 5))) (let ((.cse34 (= |c_ULTIMATE.start_main_~m~0#1.base| 5)) (.cse35 (= |c_ULTIMATE.start_main_~d~0#1.base| 5)) (.cse0 (= (select .cse41 16) 0)) (.cse1 (= (select .cse41 8) 0)) (.cse2 (= (select .cse42 4) 0)) (.cse3 (= (select .cse39 12) 0)) (.cse4 (= (select .cse42 16) 0)) (.cse5 (= (select .cse42 8) 0)) (.cse6 (= (select .cse39 4) 0)) (.cse7 (= |c_ULTIMATE.start_main_~m~0#1.base| 4)) (.cse9 (= |c_ULTIMATE.start_main_~m~0#1.offset| 12)) (.cse10 (= (select .cse42 0) 0)) (.cse11 (= (select .cse39 0) 0)) (.cse13 (= (select .cse39 20) 0)) (.cse14 (= 0 (select .cse41 20))) (.cse16 (= (select .cse41 4) 0)) (.cse17 (= (select .cse40 1) 0)) (.cse18 (= (select .cse39 16) 0)) (.cse19 (= (select .cse39 8) 0)) (.cse21 (= (select .cse42 12) 0)) (.cse23 (= (select .cse41 12) 0)) (.cse24 (= 3 |c_~#__global_lock~0.base|)) (.cse25 (= (select .cse41 0) 0)) (.cse26 (= |c_~#A~0.base| 4)) (.cse27 (= |c_ULTIMATE.start_main_~d~0#1.base| 4)) (.cse28 (= (select .cse41 28) 0)) (.cse29 (= (select .cse41 24) 0)) (.cse30 (= (select .cse39 28) 0)) (.cse31 (= 48 (select .cse40 0))) (.cse33 (= (select .cse39 24) 0)) (.cse15 (= |c_~#A~0.offset| 0)) (.cse37 (select .cse36 |c_~#A~0.offset|))) (and (let ((.cse8 (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4))) (.cse12 (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (.cse20 (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (.cse22 (not (= 5 |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (.cse32 (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse34 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse35 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse34 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse35 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse33) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse33)) (or (forall ((v_ArrVal_2542 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2542) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_2543 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse36 |c_~#A~0.offset| .cse37)) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2543) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (or (and (or (let ((.cse38 (select |c_#pthreadsMutex| |c_~#__global_lock~0.base|))) (and (< |c_ULTIMATE.start_main_~m~0#1.offset| 13) (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|) (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| (store .cse38 |c_~#__global_lock~0.offset| 0)) |c_ULTIMATE.start_main_~m~0#1.base|) 12) 1) (<= 12 |c_ULTIMATE.start_main_~m~0#1.offset|) (= (select .cse38 |c_~#__global_lock~0.offset|) 1))) (not (= |c_ULTIMATE.start_main_~d~0#1.offset| 0))) (= (select .cse36 0) 0) .cse15) (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) (= .cse37 0))) (= (select (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12)) 1)))) is different from false [2023-08-03 15:36:07,089 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-03 15:36:36,052 WARN L233 SmtUtils]: Spent 28.92s on a formula simplification. DAG size of input: 144 DAG size of output: 132 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:36:38,350 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#pthreadsMutex| |c_~#__global_lock~0.base|))) (let ((.cse3 (< |c_ULTIMATE.start_main_~m~0#1.offset| 13)) (.cse5 (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|)) (.cse6 (<= 12 |c_ULTIMATE.start_main_~m~0#1.offset|)) (.cse2 (select .cse4 |c_~#__global_lock~0.offset|)) (.cse1 (not (= |c_ULTIMATE.start_main_~d~0#1.offset| 0))) (.cse12 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (.cse47 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse9 (forall ((v_ArrVal_2542 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2542) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse13 (select |c_#pthreadsMutex| |c_~#A~0.base|)) (.cse14 (+ |c_~#A~0.offset| 12)) (.cse0 (and .cse12 (= (select .cse47 |c_~#A~0.offset|) 1))) (.cse10 (or (and .cse3 .cse5 (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| (store .cse4 |c_~#__global_lock~0.offset| 0)) |c_ULTIMATE.start_main_~m~0#1.base|) 12) 1) .cse6 (= .cse2 1)) .cse1)) (.cse7 (= |c_~#A~0.offset| 0)) (.cse8 (= (select .cse47 0) 1))) (and (or .cse0 (and (or .cse1 (and (= .cse2 0) .cse3 (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| .cse4) |c_ULTIMATE.start_main_~m~0#1.base|) 12) 1) .cse5 .cse6)) .cse7 .cse8)) (or .cse9 (forall ((v_ArrVal_2543 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2543) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (let ((.cse11 (= |c_t_funThread2of2ForFork0_#t~post7#1| 0))) (or (and .cse10 .cse11 .cse7) (and .cse12 .cse11))) (or (forall ((v_ArrVal_2542 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store .cse13 .cse14 1)) |c_~#__global_lock~0.base| v_ArrVal_2542) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2543 (Array Int Int))) (= (select (select (store (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2532))) (store .cse15 |c_~#A~0.base| (let ((.cse16 (select .cse15 |c_~#A~0.base|))) (store .cse16 |c_~#A~0.offset| (select .cse16 |c_~#A~0.offset|))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2543) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (let ((.cse44 (select |c_#memory_int| 1)) (.cse43 (select |c_#memory_int| 4)) (.cse46 (select |c_#memory_int| 3)) (.cse45 (select |c_#memory_int| 5))) (let ((.cse17 (= (select .cse45 16) 0)) (.cse18 (= (select .cse45 8) 0)) (.cse19 (= (select .cse46 4) 0)) (.cse20 (= (select .cse43 12) 0)) (.cse21 (= (select .cse46 16) 0)) (.cse22 (= (select .cse46 8) 0)) (.cse23 (= (select .cse43 4) 0)) (.cse24 (= |c_ULTIMATE.start_main_~m~0#1.offset| 12)) (.cse25 (= (select .cse46 0) 0)) (.cse26 (= (select .cse43 20) 0)) (.cse27 (= 0 (select .cse45 20))) (.cse28 (= (select .cse45 4) 0)) (.cse29 (= (select .cse43 0) 1)) (.cse30 (= (select .cse44 1) 0)) (.cse31 (= (select .cse43 16) 0)) (.cse32 (= (select .cse43 8) 0)) (.cse33 (= (select .cse46 12) 0)) (.cse34 (= (select .cse45 12) 0)) (.cse35 (= 3 |c_~#__global_lock~0.base|)) (.cse36 (= (select .cse45 0) 0)) (.cse37 (= |c_~#A~0.base| 4)) (.cse38 (= (select .cse45 28) 0)) (.cse39 (= (select .cse45 24) 0)) (.cse40 (= (select .cse43 28) 0)) (.cse41 (= 48 (select .cse44 0))) (.cse42 (= (select .cse43 24) 0))) (or (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (= |c_ULTIMATE.start_main_~m~0#1.base| 4) .cse24 .cse25 .cse26 .cse27 .cse7 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (= |c_ULTIMATE.start_main_~d~0#1.base| 4) .cse38 .cse39 .cse40 .cse41 .cse42) (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (= |c_ULTIMATE.start_main_~m~0#1.base| 5) .cse26 .cse27 .cse7 .cse28 .cse29 .cse30 .cse31 .cse32 (= |c_ULTIMATE.start_main_~d~0#1.base| 5) .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42)))) (or .cse9 (forall ((v_ArrVal_2543 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse47 |c_~#A~0.offset| |c_t_funThread2of2ForFork0_#t~post7#1|)) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2543) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (= (select .cse13 .cse14) 1) (or .cse0 (and .cse10 .cse7 .cse8)))))) is different from false [2023-08-03 15:36:38,475 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse32 (select .cse31 |c_~#A~0.offset|)) (.cse11 (= |c_~#A~0.offset| 0))) (and (let ((.cse28 (select |c_#memory_int| 1)) (.cse27 (select |c_#memory_int| 4)) (.cse30 (select |c_#memory_int| 3)) (.cse29 (select |c_#memory_int| 5))) (let ((.cse0 (= (select .cse29 16) 0)) (.cse1 (= (select .cse29 8) 0)) (.cse2 (= (select .cse30 4) 0)) (.cse3 (= (select .cse27 12) 0)) (.cse4 (= (select .cse30 16) 0)) (.cse5 (= (select .cse30 8) 0)) (.cse6 (= (select .cse27 4) 0)) (.cse7 (= |c_ULTIMATE.start_main_~m~0#1.offset| 12)) (.cse8 (= (select .cse30 0) 0)) (.cse9 (= (select .cse27 20) 0)) (.cse10 (= 0 (select .cse29 20))) (.cse12 (= (select .cse29 4) 0)) (.cse13 (= (select .cse27 0) 1)) (.cse14 (= (select .cse28 1) 0)) (.cse15 (= (select .cse27 16) 0)) (.cse16 (= (select .cse27 8) 0)) (.cse17 (= (select .cse30 12) 0)) (.cse18 (= (select .cse29 12) 0)) (.cse19 (= 3 |c_~#__global_lock~0.base|)) (.cse20 (= (select .cse29 0) 0)) (.cse21 (= |c_~#A~0.base| 4)) (.cse22 (= (select .cse29 28) 0)) (.cse23 (= (select .cse29 24) 0)) (.cse24 (= (select .cse27 28) 0)) (.cse25 (= 48 (select .cse28 0))) (.cse26 (= (select .cse27 24) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |c_ULTIMATE.start_main_~m~0#1.base| 4) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (= |c_ULTIMATE.start_main_~d~0#1.base| 4) .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |c_ULTIMATE.start_main_~m~0#1.base| 5) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= |c_ULTIMATE.start_main_~d~0#1.base| 5) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) (or (forall ((v_ArrVal_2542 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2542) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_2543 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse31 |c_~#A~0.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post10#1|))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2543) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (= (select (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12)) 1) (= .cse32 |c_t_funThread2of2ForFork0_#t~post10#1|) (or (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) (= .cse32 1)) (and (or (let ((.cse33 (select |c_#pthreadsMutex| |c_~#__global_lock~0.base|))) (and (< |c_ULTIMATE.start_main_~m~0#1.offset| 13) (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|) (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| (store .cse33 |c_~#__global_lock~0.offset| 0)) |c_ULTIMATE.start_main_~m~0#1.base|) 12) 1) (<= 12 |c_ULTIMATE.start_main_~m~0#1.offset|) (= (select .cse33 |c_~#__global_lock~0.offset|) 1))) (not (= |c_ULTIMATE.start_main_~d~0#1.offset| 0))) .cse11 (= (select .cse31 0) 1)))))) is different from false [2023-08-03 15:36:54,848 WARN L233 SmtUtils]: Spent 16.23s on a formula simplification. DAG size of input: 167 DAG size of output: 101 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:36:55,108 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse44 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse4 (select |c_#pthreadsMutex| |c_~#__global_lock~0.base|)) (.cse45 (select .cse44 |c_~#A~0.offset|))) (let ((.cse9 (forall ((v_ArrVal_2542 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2542) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse10 (select |c_#pthreadsMutex| |c_~#A~0.base|)) (.cse11 (+ |c_~#A~0.offset| 12)) (.cse0 (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) (= .cse45 1))) (.cse3 (< |c_ULTIMATE.start_main_~m~0#1.offset| 13)) (.cse5 (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|)) (.cse6 (<= 12 |c_ULTIMATE.start_main_~m~0#1.offset|)) (.cse2 (select .cse4 |c_~#__global_lock~0.offset|)) (.cse1 (not (= |c_ULTIMATE.start_main_~d~0#1.offset| 0))) (.cse7 (= |c_~#A~0.offset| 0)) (.cse8 (= (select .cse44 0) 1))) (and (or .cse0 (and (or .cse1 (and (= .cse2 0) .cse3 (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| .cse4) |c_ULTIMATE.start_main_~m~0#1.base|) 12) 1) .cse5 .cse6)) .cse7 .cse8)) (or .cse9 (forall ((v_ArrVal_2543 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2543) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (or (forall ((v_ArrVal_2542 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store .cse10 .cse11 1)) |c_~#__global_lock~0.base| v_ArrVal_2542) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2543 (Array Int Int))) (= (select (select (store (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2532))) (store .cse12 |c_~#A~0.base| (let ((.cse13 (select .cse12 |c_~#A~0.base|))) (store .cse13 |c_~#A~0.offset| (select .cse13 |c_~#A~0.offset|))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2543) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (let ((.cse41 (select |c_#memory_int| 1)) (.cse40 (select |c_#memory_int| 4)) (.cse43 (select |c_#memory_int| 3)) (.cse42 (select |c_#memory_int| 5))) (let ((.cse14 (= (select .cse42 16) 0)) (.cse15 (= (select .cse42 8) 0)) (.cse16 (= (select .cse43 4) 0)) (.cse17 (= (select .cse40 12) 0)) (.cse18 (= (select .cse43 16) 0)) (.cse19 (= (select .cse43 8) 0)) (.cse20 (= (select .cse40 4) 0)) (.cse21 (= |c_ULTIMATE.start_main_~m~0#1.offset| 12)) (.cse22 (= (select .cse43 0) 0)) (.cse23 (= (select .cse40 20) 0)) (.cse24 (= 0 (select .cse42 20))) (.cse25 (= (select .cse42 4) 0)) (.cse26 (= (select .cse40 0) 1)) (.cse27 (= (select .cse41 1) 0)) (.cse28 (= (select .cse40 16) 0)) (.cse29 (= (select .cse40 8) 0)) (.cse30 (= (select .cse43 12) 0)) (.cse31 (= (select .cse42 12) 0)) (.cse32 (= 3 |c_~#__global_lock~0.base|)) (.cse33 (= (select .cse42 0) 0)) (.cse34 (= |c_~#A~0.base| 4)) (.cse35 (= (select .cse42 28) 0)) (.cse36 (= (select .cse42 24) 0)) (.cse37 (= (select .cse40 28) 0)) (.cse38 (= 48 (select .cse41 0))) (.cse39 (= (select .cse40 24) 0))) (or (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= |c_ULTIMATE.start_main_~m~0#1.base| 4) .cse21 .cse22 .cse23 .cse24 .cse7 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (= |c_ULTIMATE.start_main_~d~0#1.base| 4) .cse35 .cse36 .cse37 .cse38 .cse39) (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= |c_ULTIMATE.start_main_~m~0#1.base| 5) .cse23 .cse24 .cse7 .cse25 .cse26 .cse27 .cse28 .cse29 (= |c_ULTIMATE.start_main_~d~0#1.base| 5) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39)))) (or .cse9 (forall ((v_ArrVal_2543 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse44 |c_~#A~0.offset| |c_t_funThread2of2ForFork0_#t~post7#1|)) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2543) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (= (select .cse10 .cse11) 1) (= .cse45 |c_t_funThread2of2ForFork0_#t~post10#1|) (or .cse0 (and (or (and .cse3 .cse5 (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| (store .cse4 |c_~#__global_lock~0.offset| 0)) |c_ULTIMATE.start_main_~m~0#1.base|) 12) 1) .cse6 (= .cse2 1)) .cse1) .cse7 .cse8)))))) is different from false [2023-08-03 15:36:55,860 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#pthreadsMutex| |c_~#__global_lock~0.base|)) (.cse12 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse9 (forall ((v_ArrVal_2542 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2542) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse0 (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) (= (select .cse12 |c_~#A~0.offset|) 1))) (.cse3 (< |c_ULTIMATE.start_main_~m~0#1.offset| 13)) (.cse5 (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|)) (.cse6 (<= 12 |c_ULTIMATE.start_main_~m~0#1.offset|)) (.cse2 (select .cse4 |c_~#__global_lock~0.offset|)) (.cse1 (not (= |c_ULTIMATE.start_main_~d~0#1.offset| 0))) (.cse7 (= |c_~#A~0.offset| 0)) (.cse8 (= (select .cse12 0) 1))) (and (or .cse0 (and (or .cse1 (and (= .cse2 0) .cse3 (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| .cse4) |c_ULTIMATE.start_main_~m~0#1.base|) 12) 1) .cse5 .cse6)) .cse7 .cse8)) (or .cse9 (forall ((v_ArrVal_2543 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2543) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (or (forall ((v_ArrVal_2542 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_2542) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2543 (Array Int Int))) (= (select (select (store (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2532))) (store .cse10 |c_~#A~0.base| (let ((.cse11 (select .cse10 |c_~#A~0.base|))) (store .cse11 |c_~#A~0.offset| (select .cse11 |c_~#A~0.offset|))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2543) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (or .cse9 (forall ((v_ArrVal_2543 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse12 |c_~#A~0.offset| |c_t_funThread2of2ForFork0_#t~post7#1|)) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2543) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (or .cse0 (and (or (and .cse3 .cse5 (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| (store .cse4 |c_~#__global_lock~0.offset| 0)) |c_ULTIMATE.start_main_~m~0#1.base|) 12) 1) .cse6 (= .cse2 1)) .cse1) .cse7 .cse8))))) is different from false Received shutdown request... [2023-08-03 15:38:01,273 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-03 15:38:01,290 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-03 15:38:02,107 WARN L265 SmtUtils]: Removed 25 from assertion stack [2023-08-03 15:38:02,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-03 15:38:02,108 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-03 15:38:02,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-08-03 15:38:02,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:38:02,308 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 166 for 65691ms.. [2023-08-03 15:38:02,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-03 15:38:02,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-03 15:38:02,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-08-03 15:38:02,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-03 15:38:02,309 INFO L445 BasicCegarLoop]: Path program histogram: [12, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:38:02,311 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 15:38:02,311 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 15:38:02,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 03:38:02 BasicIcfg [2023-08-03 15:38:02,313 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 15:38:02,313 INFO L158 Benchmark]: Toolchain (without parser) took 803356.25ms. Allocated memory was 354.4MB in the beginning and 7.8GB in the end (delta: 7.4GB). Free memory was 305.2MB in the beginning and 4.2GB in the end (delta: -3.9GB). Peak memory consumption was 3.5GB. Max. memory is 16.0GB. [2023-08-03 15:38:02,314 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 354.4MB. Free memory is still 310.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 15:38:02,314 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.40ms. Allocated memory is still 354.4MB. Free memory was 304.7MB in the beginning and 275.8MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-03 15:38:02,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.27ms. Allocated memory is still 354.4MB. Free memory was 275.3MB in the beginning and 272.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 15:38:02,314 INFO L158 Benchmark]: Boogie Preprocessor took 32.03ms. Allocated memory is still 354.4MB. Free memory was 272.7MB in the beginning and 270.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 15:38:02,314 INFO L158 Benchmark]: RCFGBuilder took 407.86ms. Allocated memory is still 354.4MB. Free memory was 270.6MB in the beginning and 251.2MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-03 15:38:02,314 INFO L158 Benchmark]: TraceAbstraction took 802424.79ms. Allocated memory was 354.4MB in the beginning and 7.8GB in the end (delta: 7.4GB). Free memory was 250.7MB in the beginning and 4.2GB in the end (delta: -4.0GB). Peak memory consumption was 3.5GB. Max. memory is 16.0GB. [2023-08-03 15:38:02,314 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.08ms. Allocated memory is still 354.4MB. Free memory is still 310.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 443.40ms. Allocated memory is still 354.4MB. Free memory was 304.7MB in the beginning and 275.8MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.27ms. Allocated memory is still 354.4MB. Free memory was 275.3MB in the beginning and 272.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.03ms. Allocated memory is still 354.4MB. Free memory was 272.7MB in the beginning and 270.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 407.86ms. Allocated memory is still 354.4MB. Free memory was 270.6MB in the beginning and 251.2MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 802424.79ms. Allocated memory was 354.4MB in the beginning and 7.8GB in the end (delta: 7.4GB). Free memory was 250.7MB in the beginning and 4.2GB in the end (delta: -4.0GB). Peak memory consumption was 3.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 170 PlacesBefore, 44 PlacesAfterwards, 194 TransitionsBefore, 64 TransitionsAfterwards, 8664 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 166 TotalNumberOfCompositions, 18412 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7930, independent: 7563, independent conditional: 0, independent unconditional: 7563, dependent: 367, dependent conditional: 0, dependent unconditional: 367, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4262, independent: 4204, independent conditional: 0, independent unconditional: 4204, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7930, independent: 3359, independent conditional: 0, independent unconditional: 3359, dependent: 309, dependent conditional: 0, dependent unconditional: 309, unknown: 4262, unknown conditional: 0, unknown unconditional: 4262] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 194, Positive conditional cache size: 0, Positive unconditional cache size: 194, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 222 PlacesBefore, 67 PlacesAfterwards, 258 TransitionsBefore, 98 TransitionsAfterwards, 25080 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 115 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 20 ConcurrentYvCompositions, 5 ChoiceCompositions, 206 TotalNumberOfCompositions, 57220 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22399, independent: 21824, independent conditional: 0, independent unconditional: 21824, dependent: 575, dependent conditional: 0, dependent unconditional: 575, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11916, independent: 11825, independent conditional: 0, independent unconditional: 11825, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 22399, independent: 9999, independent conditional: 0, independent unconditional: 9999, dependent: 484, dependent conditional: 0, dependent unconditional: 484, unknown: 11916, unknown conditional: 0, unknown unconditional: 11916] , Statistics on independence cache: Total cache size (in pairs): 521, Positive cache size: 478, Positive conditional cache size: 0, Positive unconditional cache size: 478, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 166 for 65691ms.. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 166 for 65691ms.. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 166 for 65691ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 219 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.7s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 74 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=0, InterpolantAutomatonStates: 3, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 265 locations, 5 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: 795.6s, OverallIterations: 41, TraceHistogramMax: 3, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 585.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 2270 mSolverCounterUnknown, 23176 SdHoareTripleChecker+Valid, 82.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21661 mSDsluCounter, 4380 SdHoareTripleChecker+Invalid, 76.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 16433 IncrementalHoareTripleChecker+Unchecked, 4105 mSDsCounter, 6090 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 70697 IncrementalHoareTripleChecker+Invalid, 95490 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6090 mSolverCounterUnsat, 275 mSDtfsCounter, 70697 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 2270 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2532 GetRequests, 1145 SyntacticMatches, 108 SemanticMatches, 1278 ConstructedPredicates, 56 IntricatePredicates, 3 DeprecatedPredicates, 22533 ImplicationChecksByTransitivity, 276.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35955occurred in iteration=34, InterpolantAutomatonStates: 976, 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.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 194.6s InterpolantComputationTime, 1770 NumberOfCodeBlocks, 1770 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 2411 ConstructedInterpolants, 410 QuantifiedInterpolants, 226339 SizeOfPredicates, 595 NumberOfNonLiveVariables, 3849 ConjunctsInSsa, 779 ConjunctsInUnsatCore, 95 InterpolantComputations, 15 PerfectInterpolantSequences, 136/521 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