/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_76-tricky_address3_racefree_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 15:19:52,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 15:19:52,709 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 15:19:52,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 15:19:52,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 15:19:52,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 15:19:52,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 15:19:52,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 15:19:52,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 15:19:52,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 15:19:52,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 15:19:52,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 15:19:52,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 15:19:52,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 15:19:52,735 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 15:19:52,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 15:19:52,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 15:19:52,736 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 15:19:52,737 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 15:19:52,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 15:19:52,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 15:19:52,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 15:19:52,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 15:19:52,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 15:19:52,739 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 15:19:52,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 15:19:52,739 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 15:19:52,740 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 15:19:52,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 15:19:52,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 15:19:52,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 15:19:52,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 15:19:52,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 15:19:52,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 15:19:52,742 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 15:19:52,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 15:19:52,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 15:19:52,742 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 15:19:52,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 15:19:52,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 15:19:52,743 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 15:19:52,745 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:19:52,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 15:19:52,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 15:19:52,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 15:19:52,948 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 15:19:52,948 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 15:19:52,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_76-tricky_address3_racefree_bound2.i [2023-08-03 15:19:54,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 15:19:54,464 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 15:19:54,464 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_76-tricky_address3_racefree_bound2.i [2023-08-03 15:19:54,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fddcc900/c6e5bbc64df440d1ba24ff8382e927e9/FLAGcd2d5884a [2023-08-03 15:19:54,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fddcc900/c6e5bbc64df440d1ba24ff8382e927e9 [2023-08-03 15:19:54,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 15:19:54,521 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 15:19:54,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 15:19:54,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 15:19:54,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 15:19:54,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 03:19:54" (1/1) ... [2023-08-03 15:19:54,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77894594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:54, skipping insertion in model container [2023-08-03 15:19:54,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 03:19:54" (1/1) ... [2023-08-03 15:19:54,582 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 15:19:54,946 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_76-tricky_address3_racefree_bound2.i[41323,41336] [2023-08-03 15:19:54,976 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 15:19:54,999 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 15:19:55,026 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-03 15:19:55,032 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-03 15:19:55,038 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-03 15:19:55,044 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_76-tricky_address3_racefree_bound2.i[41323,41336] [2023-08-03 15:19:55,053 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 15:19:55,101 INFO L206 MainTranslator]: Completed translation [2023-08-03 15:19:55,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:55 WrapperNode [2023-08-03 15:19:55,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 15:19:55,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 15:19:55,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 15:19:55,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 15:19:55,126 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:19:55" (1/1) ... [2023-08-03 15:19:55,141 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:19:55" (1/1) ... [2023-08-03 15:19:55,163 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 193 [2023-08-03 15:19:55,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 15:19:55,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 15:19:55,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 15:19:55,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 15:19:55,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:55" (1/1) ... [2023-08-03 15:19:55,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:55" (1/1) ... [2023-08-03 15:19:55,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:55" (1/1) ... [2023-08-03 15:19:55,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:55" (1/1) ... [2023-08-03 15:19:55,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:55" (1/1) ... [2023-08-03 15:19:55,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:55" (1/1) ... [2023-08-03 15:19:55,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:55" (1/1) ... [2023-08-03 15:19:55,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:55" (1/1) ... [2023-08-03 15:19:55,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 15:19:55,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 15:19:55,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 15:19:55,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 15:19:55,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:55" (1/1) ... [2023-08-03 15:19:55,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 15:19:55,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:19:55,238 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:19:55,245 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:19:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 15:19:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 15:19:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 15:19:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 15:19:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-03 15:19:55,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 15:19:55,266 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-03 15:19:55,266 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-03 15:19:55,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 15:19:55,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 15:19:55,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 15:19:55,267 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:19:55,383 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 15:19:55,385 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 15:19:55,578 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 15:19:55,586 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 15:19:55,586 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-03 15:19:55,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 03:19:55 BoogieIcfgContainer [2023-08-03 15:19:55,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 15:19:55,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 15:19:55,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 15:19:55,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 15:19:55,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 03:19:54" (1/3) ... [2023-08-03 15:19:55,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465a2110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 03:19:55, skipping insertion in model container [2023-08-03 15:19:55,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:55" (2/3) ... [2023-08-03 15:19:55,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465a2110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 03:19:55, skipping insertion in model container [2023-08-03 15:19:55,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 03:19:55" (3/3) ... [2023-08-03 15:19:55,595 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_76-tricky_address3_racefree_bound2.i [2023-08-03 15:19:55,602 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 15:19:55,609 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 15:19:55,609 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 15:19:55,609 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 15:19:55,694 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-03 15:19:55,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 193 transitions, 394 flow [2023-08-03 15:19:55,804 INFO L124 PetriNetUnfolderBase]: 45/263 cut-off events. [2023-08-03 15:19:55,805 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-03 15:19:55,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 263 events. 45/263 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 814 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-08-03 15:19:55,814 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 193 transitions, 394 flow [2023-08-03 15:19:55,819 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 188 transitions, 381 flow [2023-08-03 15:19:55,822 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 15:19:55,830 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-03 15:19:55,832 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-03 15:19:55,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 188 transitions, 381 flow [2023-08-03 15:19:55,915 INFO L124 PetriNetUnfolderBase]: 44/258 cut-off events. [2023-08-03 15:19:55,915 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:19:55,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 258 events. 44/258 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 778 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-08-03 15:19:55,929 INFO L119 LiptonReduction]: Number of co-enabled transitions 10792 [2023-08-03 15:19:58,703 INFO L134 LiptonReduction]: Checked pairs total: 17790 [2023-08-03 15:19:58,703 INFO L136 LiptonReduction]: Total number of compositions: 164 [2023-08-03 15:19:58,715 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 15:19:58,721 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;@248ffcb3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 15:19:58,721 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 15:19:58,725 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 15:19:58,725 INFO L124 PetriNetUnfolderBase]: 4/19 cut-off events. [2023-08-03 15:19:58,726 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:19:58,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:19:58,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 15:19:58,727 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:19:58,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:19:58,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1355205613, now seen corresponding path program 1 times [2023-08-03 15:19:58,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:19:58,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590568723] [2023-08-03 15:19:58,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:58,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:19:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:58,958 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:19:58,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:19:58,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590568723] [2023-08-03 15:19:58,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590568723] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:19:58,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:19:58,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 15:19:58,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24718346] [2023-08-03 15:19:58,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:19:58,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 15:19:58,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:19:58,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 15:19:58,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 15:19:59,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 357 [2023-08-03 15:19:59,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states 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:19:59,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:19:59,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 357 [2023-08-03 15:19:59,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:19:59,139 INFO L124 PetriNetUnfolderBase]: 272/614 cut-off events. [2023-08-03 15:19:59,139 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:19:59,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 614 events. 272/614 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3057 event pairs, 238 based on Foata normal form. 118/640 useless extension candidates. Maximal degree in co-relation 1094. Up to 528 conditions per place. [2023-08-03 15:19:59,143 INFO L140 encePairwiseOnDemand]: 332/357 looper letters, 34 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-03 15:19:59,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 167 flow [2023-08-03 15:19:59,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:19:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:19:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2023-08-03 15:19:59,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976657329598506 [2023-08-03 15:19:59,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 533 transitions. [2023-08-03 15:19:59,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 533 transitions. [2023-08-03 15:19:59,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:19:59,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 533 transitions. [2023-08-03 15:19:59,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states 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:19:59,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states 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:19:59,179 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states 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:19:59,181 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 533 transitions. [2023-08-03 15:19:59,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 167 flow [2023-08-03 15:19:59,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 167 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:19:59,186 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 105 flow [2023-08-03 15:19:59,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2023-08-03 15:19:59,192 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-08-03 15:19:59,192 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 105 flow [2023-08-03 15:19:59,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states 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:19:59,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:19:59,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:19:59,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 15:19:59,194 INFO L420 AbstractCegarLoop]: === Iteration 2 === 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:19:59,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:19:59,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1202044733, now seen corresponding path program 1 times [2023-08-03 15:19:59,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:19:59,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470924524] [2023-08-03 15:19:59,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:59,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:19:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:59,271 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:19:59,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:19:59,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470924524] [2023-08-03 15:19:59,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470924524] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:19:59,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714858725] [2023-08-03 15:19:59,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:59,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:19:59,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:19:59,275 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:19:59,281 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:19:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:59,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 15:19:59,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:19:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:19:59,359 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 15:19:59,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714858725] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:19:59,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 15:19:59,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 15:19:59,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917016859] [2023-08-03 15:19:59,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:19:59,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 15:19:59,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:19:59,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 15:19:59,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 15:19:59,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 357 [2023-08-03 15:19:59,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states 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:19:59,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:19:59,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 357 [2023-08-03 15:19:59,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:19:59,551 INFO L124 PetriNetUnfolderBase]: 255/592 cut-off events. [2023-08-03 15:19:59,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:19:59,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 592 events. 255/592 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3266 event pairs, 0 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 1120. Up to 497 conditions per place. [2023-08-03 15:19:59,554 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 49 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-03 15:19:59,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 237 flow [2023-08-03 15:19:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:19:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:19:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2023-08-03 15:19:59,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2023-08-03 15:19:59,556 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2023-08-03 15:19:59,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2023-08-03 15:19:59,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:19:59,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2023-08-03 15:19:59,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states 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:19:59,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states 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:19:59,561 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states 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:19:59,561 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 105 flow. Second operand 3 states and 525 transitions. [2023-08-03 15:19:59,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 237 flow [2023-08-03 15:19:59,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 233 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 15:19:59,563 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 109 flow [2023-08-03 15:19:59,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2023-08-03 15:19:59,564 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2023-08-03 15:19:59,564 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 109 flow [2023-08-03 15:19:59,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states 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:19:59,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:19:59,565 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-03 15:19:59,575 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:19:59,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:19:59,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === 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:19:59,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:19:59,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1382333179, now seen corresponding path program 1 times [2023-08-03 15:19:59,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:19:59,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132281243] [2023-08-03 15:19:59,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:59,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:19:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 15:19:59,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:19:59,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132281243] [2023-08-03 15:19:59,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132281243] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:19:59,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425683294] [2023-08-03 15:19:59,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:59,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:19:59,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:19:59,852 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:19:59,876 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:19:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:59,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 15:19:59,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:19:59,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 15:19:59,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:19:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 15:19:59,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425683294] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:19:59,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:19:59,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-03 15:19:59,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267393493] [2023-08-03 15:19:59,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:19:59,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 15:19:59,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:19:59,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 15:19:59,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-03 15:20:00,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 357 [2023-08-03 15:20:00,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 109 flow. Second operand has 7 states, 7 states have (on average 158.57142857142858) internal successors, (1110), 7 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states 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:20:00,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:20:00,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 357 [2023-08-03 15:20:00,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:20:00,123 INFO L124 PetriNetUnfolderBase]: 271/599 cut-off events. [2023-08-03 15:20:00,123 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-03 15:20:00,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1176 conditions, 599 events. 271/599 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2938 event pairs, 238 based on Foata normal form. 3/529 useless extension candidates. Maximal degree in co-relation 1149. Up to 513 conditions per place. [2023-08-03 15:20:00,126 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 34 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-08-03 15:20:00,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 199 flow [2023-08-03 15:20:00,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 15:20:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 15:20:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 984 transitions. [2023-08-03 15:20:00,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45938375350140054 [2023-08-03 15:20:00,129 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 984 transitions. [2023-08-03 15:20:00,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 984 transitions. [2023-08-03 15:20:00,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:20:00,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 984 transitions. [2023-08-03 15:20:00,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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:20:00,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states 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:20:00,136 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states 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:20:00,136 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 109 flow. Second operand 6 states and 984 transitions. [2023-08-03 15:20:00,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 199 flow [2023-08-03 15:20:00,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 15:20:00,138 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 141 flow [2023-08-03 15:20:00,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-08-03 15:20:00,139 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2023-08-03 15:20:00,139 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 141 flow [2023-08-03 15:20:00,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 158.57142857142858) internal successors, (1110), 7 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states 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:20:00,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:20:00,140 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-03 15:20:00,148 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:20:00,346 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,SelfDestructingSolverStorable2 [2023-08-03 15:20:00,346 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 1 more)] === [2023-08-03 15:20:00,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:20:00,346 INFO L85 PathProgramCache]: Analyzing trace with hash 941146001, now seen corresponding path program 2 times [2023-08-03 15:20:00,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:20:00,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828366741] [2023-08-03 15:20:00,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:00,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:20:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 15:20:00,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:20:00,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828366741] [2023-08-03 15:20:00,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828366741] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:20:00,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712329557] [2023-08-03 15:20:00,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:20:00,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:20:00,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:20:00,477 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:20:00,504 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:20:00,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:20:00,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:20:00,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 15:20:00,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:20:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 15:20:00,587 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:20:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 15:20:00,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712329557] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:20:00,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:20:00,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-03 15:20:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782314094] [2023-08-03 15:20:00,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:20:00,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 15:20:00,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:20:00,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 15:20:00,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-03 15:20:00,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 357 [2023-08-03 15:20:00,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 141 flow. Second operand has 13 states, 13 states have (on average 158.30769230769232) internal successors, (2058), 13 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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:20:00,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:20:00,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 357 [2023-08-03 15:20:00,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:20:00,835 INFO L124 PetriNetUnfolderBase]: 270/602 cut-off events. [2023-08-03 15:20:00,836 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2023-08-03 15:20:00,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 602 events. 270/602 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2934 event pairs, 238 based on Foata normal form. 6/536 useless extension candidates. Maximal degree in co-relation 1138. Up to 513 conditions per place. [2023-08-03 15:20:00,838 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 34 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2023-08-03 15:20:00,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 54 transitions, 267 flow [2023-08-03 15:20:00,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-03 15:20:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-03 15:20:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1935 transitions. [2023-08-03 15:20:00,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45168067226890757 [2023-08-03 15:20:00,850 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1935 transitions. [2023-08-03 15:20:00,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1935 transitions. [2023-08-03 15:20:00,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:20:00,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1935 transitions. [2023-08-03 15:20:00,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 161.25) internal successors, (1935), 12 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states 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:20:00,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 357.0) internal successors, (4641), 13 states have internal predecessors, (4641), 0 states have call successors, (0), 0 states 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:20:00,863 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 357.0) internal successors, (4641), 13 states have internal predecessors, (4641), 0 states have call successors, (0), 0 states 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:20:00,863 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 141 flow. Second operand 12 states and 1935 transitions. [2023-08-03 15:20:00,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 54 transitions, 267 flow [2023-08-03 15:20:00,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 54 transitions, 253 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-03 15:20:00,865 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 211 flow [2023-08-03 15:20:00,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=211, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2023-08-03 15:20:00,866 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2023-08-03 15:20:00,866 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 211 flow [2023-08-03 15:20:00,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 158.30769230769232) internal successors, (2058), 13 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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:20:00,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:20:00,867 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-03 15:20:00,877 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:20:01,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:20:01,073 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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:20:01,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:20:01,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1854023505, now seen corresponding path program 3 times [2023-08-03 15:20:01,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:20:01,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79027762] [2023-08-03 15:20:01,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:01,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:20:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 15:20:01,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 15:20:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 15:20:01,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 15:20:01,155 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 15:20:01,156 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-08-03 15:20:01,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 15:20:01,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-03 15:20:01,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-03 15:20:01,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-03 15:20:01,158 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2023-08-03 15:20:01,160 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 15:20:01,160 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 15:20:01,198 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-03 15:20:01,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 266 transitions, 550 flow [2023-08-03 15:20:01,245 INFO L124 PetriNetUnfolderBase]: 75/430 cut-off events. [2023-08-03 15:20:01,245 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 15:20:01,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 430 events. 75/430 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1680 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 265. Up to 12 conditions per place. [2023-08-03 15:20:01,248 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 266 transitions, 550 flow [2023-08-03 15:20:01,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 266 transitions, 550 flow [2023-08-03 15:20:01,252 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 15:20:01,252 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 266 transitions, 550 flow [2023-08-03 15:20:01,252 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 266 transitions, 550 flow [2023-08-03 15:20:01,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 266 transitions, 550 flow [2023-08-03 15:20:01,298 INFO L124 PetriNetUnfolderBase]: 75/430 cut-off events. [2023-08-03 15:20:01,298 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 15:20:01,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 430 events. 75/430 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1680 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 265. Up to 12 conditions per place. [2023-08-03 15:20:01,318 INFO L119 LiptonReduction]: Number of co-enabled transitions 33228 [2023-08-03 15:20:04,455 INFO L134 LiptonReduction]: Checked pairs total: 56804 [2023-08-03 15:20:04,455 INFO L136 LiptonReduction]: Total number of compositions: 219 [2023-08-03 15:20:04,457 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 15:20:04,458 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;@248ffcb3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 15:20:04,458 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-03 15:20:04,460 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 15:20:04,460 INFO L124 PetriNetUnfolderBase]: 8/30 cut-off events. [2023-08-03 15:20:04,461 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:20:04,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:20:04,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 15:20:04,461 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:20:04,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:20:04,461 INFO L85 PathProgramCache]: Analyzing trace with hash 685324257, now seen corresponding path program 1 times [2023-08-03 15:20:04,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:20:04,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902669585] [2023-08-03 15:20:04,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:04,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:20:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:04,483 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:20:04,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:20:04,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902669585] [2023-08-03 15:20:04,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902669585] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:20:04,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:20:04,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 15:20:04,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619942267] [2023-08-03 15:20:04,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:20:04,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 15:20:04,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:20:04,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 15:20:04,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 15:20:04,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 485 [2023-08-03 15:20:04,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 101 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states 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:20:04,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:20:04,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 485 [2023-08-03 15:20:04,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:20:05,891 INFO L124 PetriNetUnfolderBase]: 10559/16533 cut-off events. [2023-08-03 15:20:05,891 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-08-03 15:20:05,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32068 conditions, 16533 events. 10559/16533 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 109159 event pairs, 9818 based on Foata normal form. 2499/16469 useless extension candidates. Maximal degree in co-relation 13984. Up to 15431 conditions per place. [2023-08-03 15:20:05,969 INFO L140 encePairwiseOnDemand]: 450/485 looper letters, 56 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-03 15:20:05,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 274 flow [2023-08-03 15:20:05,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:20:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:20:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2023-08-03 15:20:05,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079037800687285 [2023-08-03 15:20:05,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 739 transitions. [2023-08-03 15:20:05,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 739 transitions. [2023-08-03 15:20:05,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:20:05,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 739 transitions. [2023-08-03 15:20:05,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states 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:20:05,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 15:20:05,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 15:20:05,977 INFO L175 Difference]: Start difference. First operand has 68 places, 101 transitions, 220 flow. Second operand 3 states and 739 transitions. [2023-08-03 15:20:05,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 274 flow [2023-08-03 15:20:05,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 274 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:20:05,980 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-08-03 15:20:05,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2023-08-03 15:20:05,983 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-03 15:20:05,983 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-08-03 15:20:05,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states 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:20:05,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:20:05,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:20:05,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 15:20:05,984 INFO L420 AbstractCegarLoop]: === Iteration 2 === 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:20:05,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:20:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash -909660943, now seen corresponding path program 1 times [2023-08-03 15:20:05,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:20:05,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114619094] [2023-08-03 15:20:05,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:05,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:20:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:06,036 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:20:06,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:20:06,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114619094] [2023-08-03 15:20:06,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114619094] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:20:06,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133503147] [2023-08-03 15:20:06,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:06,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:20:06,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:20:06,041 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:20:06,069 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:20:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:06,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 15:20:06,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:20:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:20:06,124 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 15:20:06,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133503147] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:20:06,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 15:20:06,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 15:20:06,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075707118] [2023-08-03 15:20:06,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:20:06,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 15:20:06,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:20:06,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 15:20:06,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 15:20:06,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 485 [2023-08-03 15:20:06,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states 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:20:06,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:20:06,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 485 [2023-08-03 15:20:06,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:20:07,379 INFO L124 PetriNetUnfolderBase]: 10416/16508 cut-off events. [2023-08-03 15:20:07,379 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2023-08-03 15:20:07,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32058 conditions, 16508 events. 10416/16508 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 111734 event pairs, 4650 based on Foata normal form. 0/13980 useless extension candidates. Maximal degree in co-relation 32045. Up to 15399 conditions per place. [2023-08-03 15:20:07,459 INFO L140 encePairwiseOnDemand]: 482/485 looper letters, 74 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-08-03 15:20:07,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 356 flow [2023-08-03 15:20:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:20:07,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:20:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2023-08-03 15:20:07,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49759450171821307 [2023-08-03 15:20:07,462 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 724 transitions. [2023-08-03 15:20:07,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 724 transitions. [2023-08-03 15:20:07,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:20:07,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 724 transitions. [2023-08-03 15:20:07,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 0 states have call successors, (0), 0 states 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:20:07,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 15:20:07,466 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 15:20:07,466 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 168 flow. Second operand 3 states and 724 transitions. [2023-08-03 15:20:07,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 356 flow [2023-08-03 15:20:07,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 88 transitions, 352 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 15:20:07,469 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-08-03 15:20:07,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2023-08-03 15:20:07,470 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-03 15:20:07,470 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-08-03 15:20:07,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states 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:20:07,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:20:07,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:20:07,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-03 15:20:07,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:20:07,676 INFO L420 AbstractCegarLoop]: === Iteration 3 === 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:20:07,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:20:07,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1710054241, now seen corresponding path program 1 times [2023-08-03 15:20:07,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:20:07,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075421244] [2023-08-03 15:20:07,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:07,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:20:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:07,716 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:20:07,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:20:07,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075421244] [2023-08-03 15:20:07,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075421244] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:20:07,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613435360] [2023-08-03 15:20:07,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:07,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:20:07,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:20:07,718 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:20:07,743 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:20:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:07,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 15:20:07,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:20:07,804 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:20:07,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:20:07,817 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:20:07,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613435360] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:20:07,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:20:07,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-03 15:20:07,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924293088] [2023-08-03 15:20:07,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:20:07,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 15:20:07,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:20:07,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 15:20:07,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-03 15:20:07,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 485 [2023-08-03 15:20:07,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states 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:20:07,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:20:07,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 485 [2023-08-03 15:20:07,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:20:09,019 INFO L124 PetriNetUnfolderBase]: 10623/16504 cut-off events. [2023-08-03 15:20:09,019 INFO L125 PetriNetUnfolderBase]: For 685/685 co-relation queries the response was YES. [2023-08-03 15:20:09,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32633 conditions, 16504 events. 10623/16504 cut-off events. For 685/685 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 108155 event pairs, 9818 based on Foata normal form. 3/14244 useless extension candidates. Maximal degree in co-relation 32605. Up to 15417 conditions per place. [2023-08-03 15:20:09,076 INFO L140 encePairwiseOnDemand]: 482/485 looper letters, 57 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-03 15:20:09,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 312 flow [2023-08-03 15:20:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 15:20:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 15:20:09,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1354 transitions. [2023-08-03 15:20:09,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652920962199313 [2023-08-03 15:20:09,080 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1354 transitions. [2023-08-03 15:20:09,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1354 transitions. [2023-08-03 15:20:09,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:20:09,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1354 transitions. [2023-08-03 15:20:09,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states 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:20:09,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states 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:20:09,087 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states 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:20:09,087 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 176 flow. Second operand 6 states and 1354 transitions. [2023-08-03 15:20:09,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 312 flow [2023-08-03 15:20:09,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 15:20:09,091 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-08-03 15:20:09,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2023-08-03 15:20:09,091 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-08-03 15:20:09,092 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-08-03 15:20:09,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states 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:20:09,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:20:09,092 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:20:09,097 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:20:09,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:20:09,298 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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:20:09,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:20:09,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1658605999, now seen corresponding path program 2 times [2023-08-03 15:20:09,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:20:09,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890585486] [2023-08-03 15:20:09,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:09,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:20:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 15:20:09,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:20:09,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890585486] [2023-08-03 15:20:09,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890585486] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:20:09,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669862131] [2023-08-03 15:20:09,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:20:09,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:20:09,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:20:09,388 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:20:09,391 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:20:09,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-03 15:20:09,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:20:09,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-03 15:20:09,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:20:09,490 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 7 treesize of output 6 [2023-08-03 15:20:09,539 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:20:09,540 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:20:09,562 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 13 treesize of output 15 [2023-08-03 15:20:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-03 15:20:09,613 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 15:20:09,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669862131] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:20:09,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 15:20:09,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-03 15:20:09,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130633467] [2023-08-03 15:20:09,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:20:09,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-03 15:20:09,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:20:09,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-03 15:20:09,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-03 15:20:09,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 485 [2023-08-03 15:20:09,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 207.5) internal successors, (1245), 6 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states 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:20:09,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:20:09,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 485 [2023-08-03 15:20:09,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:20:10,882 INFO L124 PetriNetUnfolderBase]: 11006/17360 cut-off events. [2023-08-03 15:20:10,882 INFO L125 PetriNetUnfolderBase]: For 706/706 co-relation queries the response was YES. [2023-08-03 15:20:10,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34683 conditions, 17360 events. 11006/17360 cut-off events. For 706/706 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 118607 event pairs, 2714 based on Foata normal form. 0/15185 useless extension candidates. Maximal degree in co-relation 34647. Up to 12981 conditions per place. [2023-08-03 15:20:10,949 INFO L140 encePairwiseOnDemand]: 476/485 looper letters, 132 selfloop transitions, 14 changer transitions 9/167 dead transitions. [2023-08-03 15:20:10,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 167 transitions, 737 flow [2023-08-03 15:20:10,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 15:20:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 15:20:10,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1388 transitions. [2023-08-03 15:20:10,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47697594501718216 [2023-08-03 15:20:10,953 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1388 transitions. [2023-08-03 15:20:10,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1388 transitions. [2023-08-03 15:20:10,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:20:10,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1388 transitions. [2023-08-03 15:20:10,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states 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:20:10,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states 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:20:10,961 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states 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:20:10,961 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 210 flow. Second operand 6 states and 1388 transitions. [2023-08-03 15:20:10,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 167 transitions, 737 flow [2023-08-03 15:20:10,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 167 transitions, 723 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-03 15:20:10,965 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 280 flow [2023-08-03 15:20:10,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=280, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2023-08-03 15:20:10,965 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2023-08-03 15:20:10,966 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 280 flow [2023-08-03 15:20:10,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 207.5) internal successors, (1245), 6 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states 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:20:10,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:20:10,966 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 15:20:10,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-03 15:20:11,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:20:11,173 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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:20:11,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:20:11,173 INFO L85 PathProgramCache]: Analyzing trace with hash -845271688, now seen corresponding path program 1 times [2023-08-03 15:20:11,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:20:11,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685809179] [2023-08-03 15:20:11,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:11,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:20:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 15:20:11,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:20:11,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685809179] [2023-08-03 15:20:11,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685809179] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:20:11,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47406772] [2023-08-03 15:20:11,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:11,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:20:11,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:20:11,245 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:20:11,250 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:20:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:11,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 15:20:11,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:20:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 15:20:11,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:20:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 15:20:11,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47406772] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:20:11,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:20:11,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-03 15:20:11,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937312095] [2023-08-03 15:20:11,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:20:11,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 15:20:11,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:20:11,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 15:20:11,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-03 15:20:11,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 485 [2023-08-03 15:20:11,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 280 flow. Second operand has 13 states, 13 states have (on average 216.3846153846154) internal successors, (2813), 13 states have internal predecessors, (2813), 0 states have call successors, (0), 0 states 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:20:11,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:20:11,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 485 [2023-08-03 15:20:11,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:20:12,684 INFO L124 PetriNetUnfolderBase]: 11004/17512 cut-off events. [2023-08-03 15:20:12,685 INFO L125 PetriNetUnfolderBase]: For 3607/3607 co-relation queries the response was YES. [2023-08-03 15:20:12,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38053 conditions, 17512 events. 11004/17512 cut-off events. For 3607/3607 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 120714 event pairs, 9683 based on Foata normal form. 6/16099 useless extension candidates. Maximal degree in co-relation 37995. Up to 16586 conditions per place. [2023-08-03 15:20:12,736 INFO L140 encePairwiseOnDemand]: 482/485 looper letters, 69 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2023-08-03 15:20:12,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 476 flow [2023-08-03 15:20:12,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-03 15:20:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-03 15:20:12,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2653 transitions. [2023-08-03 15:20:12,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4558419243986254 [2023-08-03 15:20:12,744 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2653 transitions. [2023-08-03 15:20:12,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2653 transitions. [2023-08-03 15:20:12,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:20:12,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2653 transitions. [2023-08-03 15:20:12,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 221.08333333333334) internal successors, (2653), 12 states have internal predecessors, (2653), 0 states have call successors, (0), 0 states 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:20:12,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 485.0) internal successors, (6305), 13 states have internal predecessors, (6305), 0 states have call successors, (0), 0 states 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:20:12,759 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 485.0) internal successors, (6305), 13 states have internal predecessors, (6305), 0 states have call successors, (0), 0 states 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:20:12,759 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 280 flow. Second operand 12 states and 2653 transitions. [2023-08-03 15:20:12,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 476 flow [2023-08-03 15:20:12,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 476 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:20:12,769 INFO L231 Difference]: Finished difference. Result has 104 places, 92 transitions, 364 flow [2023-08-03 15:20:12,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=364, PETRI_PLACES=104, PETRI_TRANSITIONS=92} [2023-08-03 15:20:12,770 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 36 predicate places. [2023-08-03 15:20:12,770 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 364 flow [2023-08-03 15:20:12,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 216.3846153846154) internal successors, (2813), 13 states have internal predecessors, (2813), 0 states have call successors, (0), 0 states 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:20:12,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:20:12,771 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 15:20:12,779 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:20:12,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:20:12,976 INFO L420 AbstractCegarLoop]: === Iteration 6 === 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:20:12,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:20:12,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1266609288, now seen corresponding path program 2 times [2023-08-03 15:20:12,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:20:12,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394075872] [2023-08-03 15:20:12,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:12,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:20:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 15:20:13,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:20:13,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394075872] [2023-08-03 15:20:13,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394075872] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:20:13,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524146947] [2023-08-03 15:20:13,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:20:13,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:20:13,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:20:13,051 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:20:13,054 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:20:13,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:20:13,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:20:13,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 15:20:13,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:20:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 15:20:13,166 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 15:20:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524146947] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:20:13,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 15:20:13,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 15:20:13,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107676980] [2023-08-03 15:20:13,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:20:13,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 15:20:13,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:20:13,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 15:20:13,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 15:20:13,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 485 [2023-08-03 15:20:13,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 364 flow. Second operand has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states 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:20:13,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:20:13,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 485 [2023-08-03 15:20:13,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:20:14,424 INFO L124 PetriNetUnfolderBase]: 10481/17257 cut-off events. [2023-08-03 15:20:14,424 INFO L125 PetriNetUnfolderBase]: For 3121/3121 co-relation queries the response was YES. [2023-08-03 15:20:14,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37117 conditions, 17257 events. 10481/17257 cut-off events. For 3121/3121 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 126324 event pairs, 526 based on Foata normal form. 282/16232 useless extension candidates. Maximal degree in co-relation 37034. Up to 15302 conditions per place. [2023-08-03 15:20:14,485 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 128 selfloop transitions, 4 changer transitions 0/143 dead transitions. [2023-08-03 15:20:14,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 143 transitions, 758 flow [2023-08-03 15:20:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 15:20:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 15:20:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1182 transitions. [2023-08-03 15:20:14,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48742268041237113 [2023-08-03 15:20:14,489 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1182 transitions. [2023-08-03 15:20:14,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1182 transitions. [2023-08-03 15:20:14,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:20:14,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1182 transitions. [2023-08-03 15:20:14,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 236.4) internal successors, (1182), 5 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states 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:20:14,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states 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:20:14,495 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states 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:20:14,496 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 364 flow. Second operand 5 states and 1182 transitions. [2023-08-03 15:20:14,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 143 transitions, 758 flow [2023-08-03 15:20:14,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 143 transitions, 706 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-03 15:20:14,505 INFO L231 Difference]: Finished difference. Result has 102 places, 92 transitions, 327 flow [2023-08-03 15:20:14,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=327, PETRI_PLACES=102, PETRI_TRANSITIONS=92} [2023-08-03 15:20:14,506 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 34 predicate places. [2023-08-03 15:20:14,506 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 92 transitions, 327 flow [2023-08-03 15:20:14,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states 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:20:14,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:20:14,506 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:20:14,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-03 15:20:14,713 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,SelfDestructingSolverStorable10 [2023-08-03 15:20:14,714 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:20:14,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:20:14,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1254315808, now seen corresponding path program 1 times [2023-08-03 15:20:14,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:20:14,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855773821] [2023-08-03 15:20:14,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:14,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:20:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:14,967 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:20:14,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:20:14,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855773821] [2023-08-03 15:20:14,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855773821] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:20:14,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776404322] [2023-08-03 15:20:14,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:14,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:20:14,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:20:14,969 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:20:14,970 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:20:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:15,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-03 15:20:15,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:20:15,068 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 7 treesize of output 6 [2023-08-03 15:20:15,119 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:20:15,119 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:20:15,134 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 13 treesize of output 15 [2023-08-03 15:20:15,156 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 13 treesize of output 15 [2023-08-03 15:20:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:20:15,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:20:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:20:25,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776404322] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:20:25,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:20:25,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-03 15:20:25,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751026066] [2023-08-03 15:20:25,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:20:25,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-03 15:20:25,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:20:25,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-03 15:20:25,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=93, Unknown=4, NotChecked=0, Total=132 [2023-08-03 15:20:27,374 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:20:29,430 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:20:31,485 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:20:33,499 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:20:35,521 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:20:37,534 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:20:39,556 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:20:41,566 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:20:41,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 485 [2023-08-03 15:20:41,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 92 transitions, 327 flow. Second operand has 12 states, 12 states have (on average 180.5) internal successors, (2166), 12 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states 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:20:41,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:20:41,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 485 [2023-08-03 15:20:41,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:20:43,182 INFO L124 PetriNetUnfolderBase]: 10809/17265 cut-off events. [2023-08-03 15:20:43,182 INFO L125 PetriNetUnfolderBase]: For 5629/5629 co-relation queries the response was YES. [2023-08-03 15:20:43,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38261 conditions, 17265 events. 10809/17265 cut-off events. For 5629/5629 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 118807 event pairs, 2385 based on Foata normal form. 0/16042 useless extension candidates. Maximal degree in co-relation 38201. Up to 12947 conditions per place. [2023-08-03 15:20:43,282 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 133 selfloop transitions, 20 changer transitions 14/177 dead transitions. [2023-08-03 15:20:43,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 177 transitions, 900 flow [2023-08-03 15:20:43,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 15:20:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 15:20:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1217 transitions. [2023-08-03 15:20:43,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.418213058419244 [2023-08-03 15:20:43,286 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1217 transitions. [2023-08-03 15:20:43,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1217 transitions. [2023-08-03 15:20:43,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:20:43,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1217 transitions. [2023-08-03 15:20:43,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 202.83333333333334) internal successors, (1217), 6 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states 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:20:43,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states 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:20:43,294 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states 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:20:43,294 INFO L175 Difference]: Start difference. First operand has 102 places, 92 transitions, 327 flow. Second operand 6 states and 1217 transitions. [2023-08-03 15:20:43,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 177 transitions, 900 flow [2023-08-03 15:20:43,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 177 transitions, 886 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-03 15:20:43,307 INFO L231 Difference]: Finished difference. Result has 107 places, 100 transitions, 415 flow [2023-08-03 15:20:43,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=415, PETRI_PLACES=107, PETRI_TRANSITIONS=100} [2023-08-03 15:20:43,307 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 39 predicate places. [2023-08-03 15:20:43,308 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 100 transitions, 415 flow [2023-08-03 15:20:43,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 180.5) internal successors, (2166), 12 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states 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:20:43,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:20:43,308 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:20:43,314 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:20:43,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:20:43,515 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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:20:43,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:20:43,515 INFO L85 PathProgramCache]: Analyzing trace with hash -884483368, now seen corresponding path program 1 times [2023-08-03 15:20:43,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:20:43,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099748401] [2023-08-03 15:20:43,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:43,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:20:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 15:20:43,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:20:43,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099748401] [2023-08-03 15:20:43,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099748401] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:20:43,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628277316] [2023-08-03 15:20:43,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:43,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:20:43,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:20:43,593 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:20:43,597 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:20:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:43,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 15:20:43,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:20:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 15:20:43,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:20:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 15:20:43,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628277316] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:20:43,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:20:43,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 15:20:43,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465065267] [2023-08-03 15:20:43,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:20:43,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 15:20:43,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:20:43,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 15:20:43,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 15:20:43,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 485 [2023-08-03 15:20:43,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 100 transitions, 415 flow. Second operand has 5 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states 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:20:43,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:20:43,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 485 [2023-08-03 15:20:43,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:20:44,825 INFO L124 PetriNetUnfolderBase]: 10009/16379 cut-off events. [2023-08-03 15:20:44,826 INFO L125 PetriNetUnfolderBase]: For 5732/5732 co-relation queries the response was YES. [2023-08-03 15:20:44,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37342 conditions, 16379 events. 10009/16379 cut-off events. For 5732/5732 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 116204 event pairs, 262 based on Foata normal form. 17/15471 useless extension candidates. Maximal degree in co-relation 37279. Up to 14557 conditions per place. [2023-08-03 15:20:44,948 INFO L140 encePairwiseOnDemand]: 482/485 looper letters, 138 selfloop transitions, 3 changer transitions 0/152 dead transitions. [2023-08-03 15:20:44,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 152 transitions, 854 flow [2023-08-03 15:20:44,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 15:20:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 15:20:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 966 transitions. [2023-08-03 15:20:44,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4979381443298969 [2023-08-03 15:20:44,951 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 966 transitions. [2023-08-03 15:20:44,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 966 transitions. [2023-08-03 15:20:44,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:20:44,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 966 transitions. [2023-08-03 15:20:44,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 241.5) internal successors, (966), 4 states have internal predecessors, (966), 0 states have call successors, (0), 0 states 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:20:44,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 0 states 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:20:44,957 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 0 states 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:20:44,957 INFO L175 Difference]: Start difference. First operand has 107 places, 100 transitions, 415 flow. Second operand 4 states and 966 transitions. [2023-08-03 15:20:44,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 152 transitions, 854 flow [2023-08-03 15:20:44,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 152 transitions, 854 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:20:44,975 INFO L231 Difference]: Finished difference. Result has 110 places, 99 transitions, 415 flow [2023-08-03 15:20:44,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=415, PETRI_PLACES=110, PETRI_TRANSITIONS=99} [2023-08-03 15:20:44,976 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 42 predicate places. [2023-08-03 15:20:44,976 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 99 transitions, 415 flow [2023-08-03 15:20:44,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states 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:20:44,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:20:44,976 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:20:44,985 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:20:45,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-03 15:20:45,181 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:20:45,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:20:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1813793732, now seen corresponding path program 1 times [2023-08-03 15:20:45,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:20:45,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022539590] [2023-08-03 15:20:45,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:45,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:20:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 15:20:45,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:20:45,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022539590] [2023-08-03 15:20:45,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022539590] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:20:45,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:20:45,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 15:20:45,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321098269] [2023-08-03 15:20:45,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:20:45,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 15:20:45,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:20:45,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 15:20:45,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-03 15:20:45,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 485 [2023-08-03 15:20:45,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 99 transitions, 415 flow. Second operand has 5 states, 5 states have (on average 199.4) internal successors, (997), 5 states have internal predecessors, (997), 0 states have call successors, (0), 0 states 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:20:45,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:20:45,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 485 [2023-08-03 15:20:45,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:20:46,148 INFO L124 PetriNetUnfolderBase]: 5211/9599 cut-off events. [2023-08-03 15:20:46,148 INFO L125 PetriNetUnfolderBase]: For 5376/5376 co-relation queries the response was YES. [2023-08-03 15:20:46,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23155 conditions, 9599 events. 5211/9599 cut-off events. For 5376/5376 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 70705 event pairs, 1933 based on Foata normal form. 1420/10162 useless extension candidates. Maximal degree in co-relation 23091. Up to 5058 conditions per place. [2023-08-03 15:20:46,208 INFO L140 encePairwiseOnDemand]: 464/485 looper letters, 128 selfloop transitions, 21 changer transitions 2/160 dead transitions. [2023-08-03 15:20:46,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 160 transitions, 963 flow [2023-08-03 15:20:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 15:20:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 15:20:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 898 transitions. [2023-08-03 15:20:46,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46288659793814435 [2023-08-03 15:20:46,210 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 898 transitions. [2023-08-03 15:20:46,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 898 transitions. [2023-08-03 15:20:46,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:20:46,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 898 transitions. [2023-08-03 15:20:46,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 224.5) internal successors, (898), 4 states have internal predecessors, (898), 0 states have call successors, (0), 0 states 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:20:46,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 0 states 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:20:46,215 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 0 states 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:20:46,215 INFO L175 Difference]: Start difference. First operand has 110 places, 99 transitions, 415 flow. Second operand 4 states and 898 transitions. [2023-08-03 15:20:46,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 160 transitions, 963 flow [2023-08-03 15:20:46,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 160 transitions, 953 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 15:20:46,229 INFO L231 Difference]: Finished difference. Result has 111 places, 110 transitions, 515 flow [2023-08-03 15:20:46,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=515, PETRI_PLACES=111, PETRI_TRANSITIONS=110} [2023-08-03 15:20:46,233 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 43 predicate places. [2023-08-03 15:20:46,233 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 110 transitions, 515 flow [2023-08-03 15:20:46,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 199.4) internal successors, (997), 5 states have internal predecessors, (997), 0 states have call successors, (0), 0 states 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:20:46,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:20:46,234 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:20:46,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-03 15:20:46,234 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:20:46,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:20:46,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1303784437, now seen corresponding path program 1 times [2023-08-03 15:20:46,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:20:46,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851110613] [2023-08-03 15:20:46,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:46,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:20:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:20:46,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:20:46,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851110613] [2023-08-03 15:20:46,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851110613] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:20:46,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347033545] [2023-08-03 15:20:46,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:46,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:20:46,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:20:46,605 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:20:46,615 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:20:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:46,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-03 15:20:46,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:20:46,734 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 7 treesize of output 6 [2023-08-03 15:20:46,784 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:20:46,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:20:46,806 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 13 treesize of output 15 [2023-08-03 15:20:46,827 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 13 treesize of output 15 [2023-08-03 15:20:46,844 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:20:46,898 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:20:46,898 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 19 treesize of output 11 [2023-08-03 15:20:46,943 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 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 15:20:46,983 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:20:46,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:20:47,052 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 15 treesize of output 13 [2023-08-03 15:20:47,057 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-03 15:20:57,116 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_66| Int) (v_ArrVal_528 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_61| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_528) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_61| v_ArrVal_531) |v_t_funThread2of2ForFork0_~p~0#1.offset_66|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_61| |v_t_funThread2of2ForFork0_~p~0#1.offset_66|))) is different from false [2023-08-03 15:20:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-03 15:20:57,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347033545] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:20:57,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:20:57,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-08-03 15:20:57,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715378953] [2023-08-03 15:20:57,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:20:57,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-03 15:20:57,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:20:57,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-03 15:20:57,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=209, Unknown=5, NotChecked=30, Total=306 [2023-08-03 15:20:57,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 485 [2023-08-03 15:20:57,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 515 flow. Second operand has 18 states, 18 states have (on average 160.66666666666666) internal successors, (2892), 18 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states 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:20:57,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:20:57,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 485 [2023-08-03 15:20:57,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:21:00,118 INFO L124 PetriNetUnfolderBase]: 9348/17096 cut-off events. [2023-08-03 15:21:00,119 INFO L125 PetriNetUnfolderBase]: For 12081/12111 co-relation queries the response was YES. [2023-08-03 15:21:00,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48555 conditions, 17096 events. 9348/17096 cut-off events. For 12081/12111 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 138173 event pairs, 1321 based on Foata normal form. 98/15556 useless extension candidates. Maximal degree in co-relation 48489. Up to 7042 conditions per place. [2023-08-03 15:21:00,219 INFO L140 encePairwiseOnDemand]: 468/485 looper letters, 333 selfloop transitions, 73 changer transitions 123/537 dead transitions. [2023-08-03 15:21:00,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 537 transitions, 3207 flow [2023-08-03 15:21:00,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-03 15:21:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-03 15:21:00,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3625 transitions. [2023-08-03 15:21:00,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37371134020618557 [2023-08-03 15:21:00,229 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3625 transitions. [2023-08-03 15:21:00,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3625 transitions. [2023-08-03 15:21:00,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:21:00,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3625 transitions. [2023-08-03 15:21:00,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 181.25) internal successors, (3625), 20 states have internal predecessors, (3625), 0 states have call successors, (0), 0 states 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:21:00,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 485.0) internal successors, (10185), 21 states have internal predecessors, (10185), 0 states have call successors, (0), 0 states 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:21:00,252 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 485.0) internal successors, (10185), 21 states have internal predecessors, (10185), 0 states have call successors, (0), 0 states 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:21:00,252 INFO L175 Difference]: Start difference. First operand has 111 places, 110 transitions, 515 flow. Second operand 20 states and 3625 transitions. [2023-08-03 15:21:00,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 537 transitions, 3207 flow [2023-08-03 15:21:00,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 537 transitions, 3206 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 15:21:00,313 INFO L231 Difference]: Finished difference. Result has 140 places, 162 transitions, 1081 flow [2023-08-03 15:21:00,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1081, PETRI_PLACES=140, PETRI_TRANSITIONS=162} [2023-08-03 15:21:00,313 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 72 predicate places. [2023-08-03 15:21:00,314 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 162 transitions, 1081 flow [2023-08-03 15:21:00,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 160.66666666666666) internal successors, (2892), 18 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states 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:21:00,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:21:00,314 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:21:00,321 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:21:00,519 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,SelfDestructingSolverStorable14 [2023-08-03 15:21:00,520 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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:21:00,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:21:00,520 INFO L85 PathProgramCache]: Analyzing trace with hash -939359669, now seen corresponding path program 2 times [2023-08-03 15:21:00,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:21:00,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236099661] [2023-08-03 15:21:00,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:21:00,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:21:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:21:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:21:01,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:21:01,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236099661] [2023-08-03 15:21:01,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236099661] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:21:01,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703013310] [2023-08-03 15:21:01,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:21:01,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:21:01,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:21:01,034 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:21:01,042 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:21:01,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:21:01,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:21:01,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-03 15:21:01,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:21:01,186 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 7 treesize of output 6 [2023-08-03 15:21:01,281 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:21:01,281 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:21:01,305 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 13 treesize of output 15 [2023-08-03 15:21:01,334 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 13 treesize of output 15 [2023-08-03 15:21:01,360 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:21:01,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:21:01,405 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:21:01,431 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 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 15:21:01,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:21:01,462 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:21:01,497 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:21:01,498 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 19 treesize of output 11 [2023-08-03 15:21:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:21:01,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:21:01,573 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_68| Int) (v_ArrVal_619 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_619) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_68|)) 0)) (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_68|) 0))) is different from false [2023-08-03 15:21:01,582 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_68| Int) (v_ArrVal_618 Int) (v_ArrVal_619 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_619) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_68|)) 0)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_618)) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_68|) 0))) is different from false [2023-08-03 15:21:01,616 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:21:01,616 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-03 15:21:01,624 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:21:01,624 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 39 treesize of output 35 [2023-08-03 15:21:01,629 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-03 15:21:17,751 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_68| Int) (v_ArrVal_613 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_63| Int) (v_ArrVal_618 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_613) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_63| v_ArrVal_618) |v_t_funThread2of2ForFork0_~p~0#1.offset_68|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_63| |v_t_funThread2of2ForFork0_~p~0#1.offset_68|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-03 15:21:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-03 15:21:19,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703013310] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:21:19,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:21:19,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-08-03 15:21:19,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384522274] [2023-08-03 15:21:19,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:21:19,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-03 15:21:19,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:21:19,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-03 15:21:19,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=244, Unknown=7, NotChecked=108, Total=462 [2023-08-03 15:21:19,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 485 [2023-08-03 15:21:19,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 162 transitions, 1081 flow. Second operand has 22 states, 22 states have (on average 159.3181818181818) internal successors, (3505), 22 states have internal predecessors, (3505), 0 states have call successors, (0), 0 states 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:21:19,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:21:19,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 485 [2023-08-03 15:21:19,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:21:24,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 15:21:26,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 15:21:28,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 15:21:30,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 15:21:32,600 INFO L124 PetriNetUnfolderBase]: 10884/19893 cut-off events. [2023-08-03 15:21:32,601 INFO L125 PetriNetUnfolderBase]: For 43569/43608 co-relation queries the response was YES. [2023-08-03 15:21:32,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68486 conditions, 19893 events. 10884/19893 cut-off events. For 43569/43608 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 165033 event pairs, 1253 based on Foata normal form. 12/18031 useless extension candidates. Maximal degree in co-relation 68408. Up to 9739 conditions per place. [2023-08-03 15:21:32,796 INFO L140 encePairwiseOnDemand]: 471/485 looper letters, 286 selfloop transitions, 108 changer transitions 110/512 dead transitions. [2023-08-03 15:21:32,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 512 transitions, 3911 flow [2023-08-03 15:21:32,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-03 15:21:32,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-03 15:21:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2896 transitions. [2023-08-03 15:21:32,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3731958762886598 [2023-08-03 15:21:32,803 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2896 transitions. [2023-08-03 15:21:32,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2896 transitions. [2023-08-03 15:21:32,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:21:32,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2896 transitions. [2023-08-03 15:21:32,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 181.0) internal successors, (2896), 16 states have internal predecessors, (2896), 0 states have call successors, (0), 0 states 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:21:32,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 485.0) internal successors, (8245), 17 states have internal predecessors, (8245), 0 states have call successors, (0), 0 states 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:21:32,817 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 485.0) internal successors, (8245), 17 states have internal predecessors, (8245), 0 states have call successors, (0), 0 states 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:21:32,817 INFO L175 Difference]: Start difference. First operand has 140 places, 162 transitions, 1081 flow. Second operand 16 states and 2896 transitions. [2023-08-03 15:21:32,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 512 transitions, 3911 flow [2023-08-03 15:21:33,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 512 transitions, 3821 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-03 15:21:33,049 INFO L231 Difference]: Finished difference. Result has 155 places, 214 transitions, 1747 flow [2023-08-03 15:21:33,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1747, PETRI_PLACES=155, PETRI_TRANSITIONS=214} [2023-08-03 15:21:33,049 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 87 predicate places. [2023-08-03 15:21:33,050 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 214 transitions, 1747 flow [2023-08-03 15:21:33,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 159.3181818181818) internal successors, (3505), 22 states have internal predecessors, (3505), 0 states have call successors, (0), 0 states 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:21:33,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:21:33,050 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:21:33,055 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:21:33,255 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,SelfDestructingSolverStorable15 [2023-08-03 15:21:33,255 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:21:33,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:21:33,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2040308918, now seen corresponding path program 1 times [2023-08-03 15:21:33,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:21:33,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188361686] [2023-08-03 15:21:33,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:21:33,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:21:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:21:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:21:37,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:21:37,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188361686] [2023-08-03 15:21:37,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188361686] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:21:37,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296293049] [2023-08-03 15:21:37,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:21:37,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:21:37,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:21:37,534 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:21:37,540 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:21:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:21:37,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-03 15:21:37,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:21:37,682 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 7 treesize of output 6 [2023-08-03 15:21:37,761 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:21:37,761 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:21:37,792 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 13 treesize of output 15 [2023-08-03 15:21:37,815 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 13 treesize of output 15 [2023-08-03 15:21:37,847 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:21:37,909 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:21:37,909 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 19 treesize of output 11 [2023-08-03 15:21:37,984 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 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 15:21:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:21:38,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:21:38,162 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 15 treesize of output 13 [2023-08-03 15:21:38,166 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-03 15:21:52,237 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_65| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_70| Int) (v_ArrVal_703 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_700) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_70| v_ArrVal_703) |v_t_funThread1of2ForFork0_~p~0#1.offset_65|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_65| |v_t_funThread2of2ForFork0_~p~0#1.offset_70|))) is different from false [2023-08-03 15:21:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-03 15:21:52,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296293049] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:21:52,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:21:52,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 27 [2023-08-03 15:21:52,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473443031] [2023-08-03 15:21:52,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:21:52,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-03 15:21:52,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:21:52,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-03 15:21:52,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=614, Unknown=3, NotChecked=52, Total=812 [2023-08-03 15:21:52,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 485 [2023-08-03 15:21:52,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 214 transitions, 1747 flow. Second operand has 29 states, 29 states have (on average 155.06896551724137) internal successors, (4497), 29 states have internal predecessors, (4497), 0 states have call successors, (0), 0 states 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:21:52,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:21:52,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 485 [2023-08-03 15:21:52,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:21:58,294 INFO L124 PetriNetUnfolderBase]: 11738/21869 cut-off events. [2023-08-03 15:21:58,294 INFO L125 PetriNetUnfolderBase]: For 56782/56806 co-relation queries the response was YES. [2023-08-03 15:21:58,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79384 conditions, 21869 events. 11738/21869 cut-off events. For 56782/56806 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 188021 event pairs, 3314 based on Foata normal form. 51/19872 useless extension candidates. Maximal degree in co-relation 79301. Up to 11815 conditions per place. [2023-08-03 15:21:58,498 INFO L140 encePairwiseOnDemand]: 465/485 looper letters, 350 selfloop transitions, 99 changer transitions 89/546 dead transitions. [2023-08-03 15:21:58,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 546 transitions, 4344 flow [2023-08-03 15:21:58,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-03 15:21:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-03 15:21:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4550 transitions. [2023-08-03 15:21:58,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34746086292478046 [2023-08-03 15:21:58,504 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4550 transitions. [2023-08-03 15:21:58,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4550 transitions. [2023-08-03 15:21:58,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:21:58,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4550 transitions. [2023-08-03 15:21:58,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 168.5185185185185) internal successors, (4550), 27 states have internal predecessors, (4550), 0 states have call successors, (0), 0 states 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:21:58,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 485.0) internal successors, (13580), 28 states have internal predecessors, (13580), 0 states have call successors, (0), 0 states 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:21:58,524 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 485.0) internal successors, (13580), 28 states have internal predecessors, (13580), 0 states have call successors, (0), 0 states 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:21:58,524 INFO L175 Difference]: Start difference. First operand has 155 places, 214 transitions, 1747 flow. Second operand 27 states and 4550 transitions. [2023-08-03 15:21:58,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 546 transitions, 4344 flow [2023-08-03 15:21:59,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 546 transitions, 4260 flow, removed 32 selfloop flow, removed 3 redundant places. [2023-08-03 15:21:59,038 INFO L231 Difference]: Finished difference. Result has 183 places, 226 transitions, 2050 flow [2023-08-03 15:21:59,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1696, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2050, PETRI_PLACES=183, PETRI_TRANSITIONS=226} [2023-08-03 15:21:59,038 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 115 predicate places. [2023-08-03 15:21:59,038 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 226 transitions, 2050 flow [2023-08-03 15:21:59,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 155.06896551724137) internal successors, (4497), 29 states have internal predecessors, (4497), 0 states have call successors, (0), 0 states 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:21:59,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:21:59,039 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:21:59,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-03 15:21:59,244 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,SelfDestructingSolverStorable16 [2023-08-03 15:21:59,244 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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:21:59,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:21:59,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1762616659, now seen corresponding path program 3 times [2023-08-03 15:21:59,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:21:59,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614044327] [2023-08-03 15:21:59,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:21:59,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:21:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:21:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:21:59,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:21:59,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614044327] [2023-08-03 15:21:59,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614044327] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:21:59,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315970790] [2023-08-03 15:21:59,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 15:21:59,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:21:59,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:21:59,621 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:21:59,624 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:21:59,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-03 15:21:59,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:21:59,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-03 15:21:59,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:21:59,768 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 7 treesize of output 6 [2023-08-03 15:21:59,827 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:21:59,830 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:21:59,849 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 13 treesize of output 15 [2023-08-03 15:21:59,870 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 13 treesize of output 15 [2023-08-03 15:21:59,891 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:21:59,932 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:21:59,932 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-03 15:21:59,983 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 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 15:22:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:22:00,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:22:00,075 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 15 treesize of output 13 [2023-08-03 15:22:00,079 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-03 15:22:00,104 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_785 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_785) |c_~#a~0.base|))) is different from false [2023-08-03 15:22:00,172 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-03 15:22:00,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315970790] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:22:00,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:22:00,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-03 15:22:00,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903351131] [2023-08-03 15:22:00,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:22:00,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-03 15:22:00,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:22:00,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-03 15:22:00,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=188, Unknown=1, NotChecked=28, Total=272 [2023-08-03 15:22:00,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 485 [2023-08-03 15:22:00,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 226 transitions, 2050 flow. Second operand has 17 states, 17 states have (on average 160.8235294117647) internal successors, (2734), 17 states have internal predecessors, (2734), 0 states have call successors, (0), 0 states 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:22:00,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:22:00,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 485 [2023-08-03 15:22:00,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:22:03,227 INFO L124 PetriNetUnfolderBase]: 13567/25376 cut-off events. [2023-08-03 15:22:03,228 INFO L125 PetriNetUnfolderBase]: For 74454/74508 co-relation queries the response was YES. [2023-08-03 15:22:03,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94818 conditions, 25376 events. 13567/25376 cut-off events. For 74454/74508 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 224239 event pairs, 2926 based on Foata normal form. 52/23063 useless extension candidates. Maximal degree in co-relation 94719. Up to 14409 conditions per place. [2023-08-03 15:22:03,485 INFO L140 encePairwiseOnDemand]: 469/485 looper letters, 325 selfloop transitions, 92 changer transitions 111/536 dead transitions. [2023-08-03 15:22:03,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 536 transitions, 4840 flow [2023-08-03 15:22:03,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-03 15:22:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-03 15:22:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2730 transitions. [2023-08-03 15:22:03,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3752577319587629 [2023-08-03 15:22:03,488 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2730 transitions. [2023-08-03 15:22:03,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2730 transitions. [2023-08-03 15:22:03,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:22:03,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2730 transitions. [2023-08-03 15:22:03,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 182.0) internal successors, (2730), 15 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:22:03,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 485.0) internal successors, (7760), 16 states have internal predecessors, (7760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 15:22:03,497 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 485.0) internal successors, (7760), 16 states have internal predecessors, (7760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 15:22:03,497 INFO L175 Difference]: Start difference. First operand has 183 places, 226 transitions, 2050 flow. Second operand 15 states and 2730 transitions. [2023-08-03 15:22:03,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 536 transitions, 4840 flow [2023-08-03 15:22:04,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 536 transitions, 4580 flow, removed 21 selfloop flow, removed 29 redundant places. [2023-08-03 15:22:04,197 INFO L231 Difference]: Finished difference. Result has 174 places, 247 transitions, 2370 flow [2023-08-03 15:22:04,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2370, PETRI_PLACES=174, PETRI_TRANSITIONS=247} [2023-08-03 15:22:04,198 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 106 predicate places. [2023-08-03 15:22:04,198 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 247 transitions, 2370 flow [2023-08-03 15:22:04,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 160.8235294117647) internal successors, (2734), 17 states have internal predecessors, (2734), 0 states have call successors, (0), 0 states 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:22:04,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:22:04,199 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:22:04,204 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:22:04,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:22:04,401 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:22:04,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:22:04,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1872272908, now seen corresponding path program 2 times [2023-08-03 15:22:04,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:22:04,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846289680] [2023-08-03 15:22:04,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:22:04,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:22:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:22:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:22:04,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:22:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846289680] [2023-08-03 15:22:04,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846289680] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:22:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099117013] [2023-08-03 15:22:04,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:22:04,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:22:04,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:22:04,830 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:22:04,856 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:22:04,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:22:04,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:22:04,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-03 15:22:04,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:22:04,984 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 7 treesize of output 6 [2023-08-03 15:22:05,083 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:22:05,083 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:22:05,105 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 13 treesize of output 15 [2023-08-03 15:22:05,139 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 13 treesize of output 15 [2023-08-03 15:22:05,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:22:05,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:22:05,221 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:22:05,262 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:22:05,262 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 19 treesize of output 11 [2023-08-03 15:22:05,294 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 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 15:22:05,328 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:22:05,328 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:22:05,434 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:22:05,434 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-03 15:22:05,443 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:22:05,443 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 39 treesize of output 35 [2023-08-03 15:22:05,447 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-03 15:22:19,554 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_874 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_69| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_74| Int) (v_ArrVal_870 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_69| |v_t_funThread2of2ForFork0_~p~0#1.offset_74|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_870) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_74| v_ArrVal_874) |v_t_funThread1of2ForFork0_~p~0#1.offset_69|) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-03 15:22:21,813 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-03 15:22:21,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099117013] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:22:21,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:22:21,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-08-03 15:22:21,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558072257] [2023-08-03 15:22:21,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:22:21,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-03 15:22:21,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:22:21,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-03 15:22:21,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=331, Unknown=9, NotChecked=38, Total=462 [2023-08-03 15:22:21,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 485 [2023-08-03 15:22:21,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 247 transitions, 2370 flow. Second operand has 22 states, 22 states have (on average 157.3181818181818) internal successors, (3461), 22 states have internal predecessors, (3461), 0 states have call successors, (0), 0 states 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:22:21,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:22:21,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 485 [2023-08-03 15:22:21,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:22:26,109 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:22:28,461 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:22:30,647 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:22:32,683 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:22:35,035 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:22:37,046 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:22:39,052 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:22:41,759 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:22:43,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 15:22:46,391 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:22:49,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 15:22:52,499 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:22:53,637 INFO L124 PetriNetUnfolderBase]: 16847/31963 cut-off events. [2023-08-03 15:22:53,637 INFO L125 PetriNetUnfolderBase]: For 95978/96044 co-relation queries the response was YES. [2023-08-03 15:22:53,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120116 conditions, 31963 events. 16847/31963 cut-off events. For 95978/96044 co-relation queries the response was YES. Maximal size of possible extension queue 1362. Compared 298148 event pairs, 3259 based on Foata normal form. 112/29183 useless extension candidates. Maximal degree in co-relation 120038. Up to 14916 conditions per place. [2023-08-03 15:22:54,009 INFO L140 encePairwiseOnDemand]: 460/485 looper letters, 484 selfloop transitions, 172 changer transitions 256/920 dead transitions. [2023-08-03 15:22:54,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 920 transitions, 7978 flow [2023-08-03 15:22:54,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-03 15:22:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-03 15:22:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 5657 transitions. [2023-08-03 15:22:54,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36449742268041235 [2023-08-03 15:22:54,013 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 5657 transitions. [2023-08-03 15:22:54,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 5657 transitions. [2023-08-03 15:22:54,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:22:54,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 5657 transitions. [2023-08-03 15:22:54,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 176.78125) internal successors, (5657), 32 states have internal predecessors, (5657), 0 states have call successors, (0), 0 states 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:22:54,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 485.0) internal successors, (16005), 33 states have internal predecessors, (16005), 0 states have call successors, (0), 0 states 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:22:54,026 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 485.0) internal successors, (16005), 33 states have internal predecessors, (16005), 0 states have call successors, (0), 0 states 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:22:54,026 INFO L175 Difference]: Start difference. First operand has 174 places, 247 transitions, 2370 flow. Second operand 32 states and 5657 transitions. [2023-08-03 15:22:54,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 920 transitions, 7978 flow [2023-08-03 15:22:55,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 920 transitions, 7745 flow, removed 51 selfloop flow, removed 6 redundant places. [2023-08-03 15:22:55,043 INFO L231 Difference]: Finished difference. Result has 217 places, 328 transitions, 3565 flow [2023-08-03 15:22:55,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=2231, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=3565, PETRI_PLACES=217, PETRI_TRANSITIONS=328} [2023-08-03 15:22:55,044 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 149 predicate places. [2023-08-03 15:22:55,044 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 328 transitions, 3565 flow [2023-08-03 15:22:55,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 157.3181818181818) internal successors, (3461), 22 states have internal predecessors, (3461), 0 states have call successors, (0), 0 states 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:22:55,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:22:55,044 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:22:55,048 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:22:55,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:22:55,245 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:22:55,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:22:55,245 INFO L85 PathProgramCache]: Analyzing trace with hash -321806055, now seen corresponding path program 4 times [2023-08-03 15:22:55,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:22:55,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244010662] [2023-08-03 15:22:55,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:22:55,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:22:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:22:55,733 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 15:22:55,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:22:55,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244010662] [2023-08-03 15:22:55,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244010662] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:22:55,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566877716] [2023-08-03 15:22:55,733 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-03 15:22:55,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:22:55,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:22:55,738 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:22:55,740 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:22:55,881 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-03 15:22:55,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:22:55,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-03 15:22:55,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:22:55,890 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 7 treesize of output 6 [2023-08-03 15:22:55,991 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:22:55,992 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:22:56,019 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 13 treesize of output 15 [2023-08-03 15:22:56,056 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:22:56,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:22:56,110 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:22:56,142 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 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 15:22:56,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:22:56,185 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:22:56,222 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:22:56,266 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:22:56,266 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 19 treesize of output 11 [2023-08-03 15:22:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 15:22:56,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:22:56,431 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_960 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_76| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_960)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_962) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_76|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_961) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_76|)) 0)))) is different from false [2023-08-03 15:22:56,466 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:22:56,466 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-03 15:22:56,475 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:22:56,476 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 39 treesize of output 35 [2023-08-03 15:22:56,480 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-03 15:22:56,721 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((v_ArrVal_960 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_76| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int) (v_ArrVal_962 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_71| |v_t_funThread2of2ForFork0_~p~0#1.offset_76|) (= 0 (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_71| v_ArrVal_960)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_962) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_76|)))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_960 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_76| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int) (v_ArrVal_962 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_71| v_ArrVal_960)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_962) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_76|)))))) is different from false [2023-08-03 15:22:56,775 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_960 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_76| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int) (v_ArrVal_962 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_955))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_71| v_ArrVal_960))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_962) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_76|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_960 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_76| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int) (v_ArrVal_962 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_71| |v_t_funThread2of2ForFork0_~p~0#1.offset_76|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_955))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_71| v_ArrVal_960))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_962) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_76|) 0)))) is different from false [2023-08-03 15:23:04,845 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:23:05,035 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-03 15:23:05,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566877716] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:23:05,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:23:05,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2023-08-03 15:23:05,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707622521] [2023-08-03 15:23:05,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:23:05,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-03 15:23:05,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:23:05,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-03 15:23:05,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=313, Unknown=7, NotChecked=120, Total=552 [2023-08-03 15:23:05,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 485 [2023-08-03 15:23:05,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 328 transitions, 3565 flow. Second operand has 24 states, 24 states have (on average 157.125) internal successors, (3771), 24 states have internal predecessors, (3771), 0 states have call successors, (0), 0 states 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:23:05,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:23:05,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 485 [2023-08-03 15:23:05,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:23:07,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 15:23:09,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 15:23:11,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 15:23:14,083 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 [0] [2023-08-03 15:23:16,090 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 [0] [2023-08-03 15:23:18,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 15:23:22,729 INFO L124 PetriNetUnfolderBase]: 16201/30947 cut-off events. [2023-08-03 15:23:22,729 INFO L125 PetriNetUnfolderBase]: For 191114/191325 co-relation queries the response was YES. [2023-08-03 15:23:23,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138040 conditions, 30947 events. 16201/30947 cut-off events. For 191114/191325 co-relation queries the response was YES. Maximal size of possible extension queue 1351. Compared 289268 event pairs, 3402 based on Foata normal form. 9/28138 useless extension candidates. Maximal degree in co-relation 137943. Up to 19681 conditions per place. [2023-08-03 15:23:23,161 INFO L140 encePairwiseOnDemand]: 469/485 looper letters, 394 selfloop transitions, 170 changer transitions 115/687 dead transitions. [2023-08-03 15:23:23,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 687 transitions, 7390 flow [2023-08-03 15:23:23,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-03 15:23:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-03 15:23:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3509 transitions. [2023-08-03 15:23:23,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36175257731958765 [2023-08-03 15:23:23,165 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3509 transitions. [2023-08-03 15:23:23,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3509 transitions. [2023-08-03 15:23:23,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:23:23,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3509 transitions. [2023-08-03 15:23:23,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 175.45) internal successors, (3509), 20 states have internal predecessors, (3509), 0 states have call successors, (0), 0 states 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:23:23,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 485.0) internal successors, (10185), 21 states have internal predecessors, (10185), 0 states have call successors, (0), 0 states 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:23:23,175 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 485.0) internal successors, (10185), 21 states have internal predecessors, (10185), 0 states have call successors, (0), 0 states 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:23:23,175 INFO L175 Difference]: Start difference. First operand has 217 places, 328 transitions, 3565 flow. Second operand 20 states and 3509 transitions. [2023-08-03 15:23:23,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 687 transitions, 7390 flow [2023-08-03 15:23:24,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 687 transitions, 7212 flow, removed 69 selfloop flow, removed 5 redundant places. [2023-08-03 15:23:24,451 INFO L231 Difference]: Finished difference. Result has 235 places, 364 transitions, 4321 flow [2023-08-03 15:23:24,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=3406, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4321, PETRI_PLACES=235, PETRI_TRANSITIONS=364} [2023-08-03 15:23:24,452 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 167 predicate places. [2023-08-03 15:23:24,452 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 364 transitions, 4321 flow [2023-08-03 15:23:24,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 157.125) internal successors, (3771), 24 states have internal predecessors, (3771), 0 states have call successors, (0), 0 states 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:23:24,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:24,453 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:23:24,457 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:23:24,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:24,653 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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:23:24,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:24,654 INFO L85 PathProgramCache]: Analyzing trace with hash 791760339, now seen corresponding path program 1 times [2023-08-03 15:23:24,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:24,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381332384] [2023-08-03 15:23:24,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:24,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:23:24,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:23:24,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381332384] [2023-08-03 15:23:24,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381332384] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:23:24,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700424161] [2023-08-03 15:23:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:24,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:24,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:23:24,898 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:23:24,904 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:23:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:25,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-03 15:23:25,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:23:25,046 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 7 treesize of output 6 [2023-08-03 15:23:25,101 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:23:25,102 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:23:25,122 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 13 treesize of output 15 [2023-08-03 15:23:25,148 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 13 treesize of output 15 [2023-08-03 15:23:25,178 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 16 treesize of output 12 [2023-08-03 15:23:25,210 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-03 15:23:25,211 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 22 treesize of output 15 [2023-08-03 15:23:25,260 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 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 15:23:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:23:25,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:23:25,377 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 18 treesize of output 16 [2023-08-03 15:23:25,381 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-03 15:23:39,499 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1046 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int) (|~#a~0.offset| Int) (v_ArrVal_1043 (Array Int Int)) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1043) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1046) .cse0) 0) (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_73|)))) is different from false [2023-08-03 15:23:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-03 15:23:39,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700424161] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:23:39,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:23:39,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2023-08-03 15:23:39,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311731961] [2023-08-03 15:23:39,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:23:39,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-03 15:23:39,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:23:39,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-03 15:23:39,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=4, NotChecked=28, Total=272 [2023-08-03 15:23:39,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 485 [2023-08-03 15:23:39,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 364 transitions, 4321 flow. Second operand has 17 states, 17 states have (on average 159.05882352941177) internal successors, (2704), 17 states have internal predecessors, (2704), 0 states have call successors, (0), 0 states 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:23:39,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:23:39,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 485 [2023-08-03 15:23:39,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:23:50,374 INFO L124 PetriNetUnfolderBase]: 24538/47247 cut-off events. [2023-08-03 15:23:50,374 INFO L125 PetriNetUnfolderBase]: For 365854/366049 co-relation queries the response was YES. [2023-08-03 15:23:50,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229712 conditions, 47247 events. 24538/47247 cut-off events. For 365854/366049 co-relation queries the response was YES. Maximal size of possible extension queue 1833. Compared 469936 event pairs, 8070 based on Foata normal form. 130/43044 useless extension candidates. Maximal degree in co-relation 229607. Up to 22344 conditions per place. [2023-08-03 15:23:50,903 INFO L140 encePairwiseOnDemand]: 466/485 looper letters, 504 selfloop transitions, 236 changer transitions 171/919 dead transitions. [2023-08-03 15:23:50,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 919 transitions, 12256 flow [2023-08-03 15:23:50,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-03 15:23:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-03 15:23:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2696 transitions. [2023-08-03 15:23:50,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37058419243986257 [2023-08-03 15:23:50,907 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2696 transitions. [2023-08-03 15:23:50,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2696 transitions. [2023-08-03 15:23:50,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:23:50,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2696 transitions. [2023-08-03 15:23:50,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 179.73333333333332) internal successors, (2696), 15 states have internal predecessors, (2696), 0 states have call successors, (0), 0 states 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:23:50,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 485.0) internal successors, (7760), 16 states have internal predecessors, (7760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 15:23:50,917 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 485.0) internal successors, (7760), 16 states have internal predecessors, (7760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 15:23:50,917 INFO L175 Difference]: Start difference. First operand has 235 places, 364 transitions, 4321 flow. Second operand 15 states and 2696 transitions. [2023-08-03 15:23:50,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 919 transitions, 12256 flow [2023-08-03 15:23:53,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 919 transitions, 11701 flow, removed 79 selfloop flow, removed 9 redundant places. [2023-08-03 15:23:53,080 INFO L231 Difference]: Finished difference. Result has 249 places, 521 transitions, 7533 flow [2023-08-03 15:23:53,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=4040, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7533, PETRI_PLACES=249, PETRI_TRANSITIONS=521} [2023-08-03 15:23:53,081 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 181 predicate places. [2023-08-03 15:23:53,081 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 521 transitions, 7533 flow [2023-08-03 15:23:53,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 159.05882352941177) internal successors, (2704), 17 states have internal predecessors, (2704), 0 states have call successors, (0), 0 states 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:23:53,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:53,082 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:23:53,086 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:23:53,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:53,282 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:23:53,282 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1647008307, now seen corresponding path program 2 times [2023-08-03 15:23:53,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:53,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671411049] [2023-08-03 15:23:53,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:53,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:23:53,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:23:53,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671411049] [2023-08-03 15:23:53,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671411049] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:23:53,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410791750] [2023-08-03 15:23:53,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:23:53,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:53,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:23:53,645 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:23:53,652 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:23:53,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:23:53,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:23:53,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-03 15:23:53,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:23:53,776 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 7 treesize of output 6 [2023-08-03 15:23:53,868 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:23:53,869 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:23:53,894 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 13 treesize of output 15 [2023-08-03 15:23:53,943 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 13 treesize of output 15 [2023-08-03 15:23:53,967 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:23:54,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:23:54,039 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:23:54,104 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 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 15:23:54,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:23:54,143 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:23:54,178 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-03 15:23:54,179 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 22 treesize of output 15 [2023-08-03 15:23:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:23:54,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:23:54,357 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:23:54,358 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-08-03 15:23:54,367 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:23:54,367 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 45 treesize of output 42 [2023-08-03 15:23:54,372 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-03 15:23:56,396 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (or (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1133 Int) (|~#a~0.offset| Int)) (= (select (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1133) (+ .cse1 |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1133 Int) (|~#a~0.offset| Int)) (let ((.cse2 (+ .cse1 |~#a~0.offset|))) (or (= (select (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1133) .cse2) 0) (= .cse2 |v_t_funThread1of2ForFork0_~p~0#1.offset_75|)))))) is different from false [2023-08-03 15:23:56,419 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (or (forall ((v_ArrVal_1128 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1133 Int) (|~#a~0.offset| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1128) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1133) (+ .cse0 |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1128 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1133 Int) (|~#a~0.offset| Int)) (let ((.cse1 (+ .cse0 |~#a~0.offset|))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1128) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1133) .cse1) 0) (= .cse1 |v_t_funThread1of2ForFork0_~p~0#1.offset_75|)))))) is different from false [2023-08-03 15:24:04,545 WARN L233 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:24:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-03 15:24:04,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410791750] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:24:04,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:24:04,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-08-03 15:24:04,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407140331] [2023-08-03 15:24:04,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:24:04,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-03 15:24:04,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:24:04,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-03 15:24:04,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=277, Unknown=3, NotChecked=74, Total=462 [2023-08-03 15:24:04,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 485 [2023-08-03 15:24:04,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 521 transitions, 7533 flow. Second operand has 22 states, 22 states have (on average 157.45454545454547) internal successors, (3464), 22 states have internal predecessors, (3464), 0 states have call successors, (0), 0 states 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:04,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:24:04,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 485 [2023-08-03 15:24:04,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:24:07,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 15:24:09,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 15:24:16,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 15:24:25,961 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:24:27,994 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:24:30,048 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:24:32,061 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:24:34,759 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:24:36,817 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:24:38,838 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:24:45,689 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:24:48,357 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:24:50,397 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:24:52,417 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:24:54,468 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:24:56,490 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:24:58,993 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:25:01,029 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:25:03,049 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:25:05,068 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:25:07,761 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:25:09,794 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:25:11,809 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:25:15,874 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:25:18,646 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:25:20,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:25:22,770 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:25:24,799 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:25:27,587 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:25:29,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:25:32,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:25:34,456 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:25:36,472 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:25:38,478 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:25:41,163 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:25:43,173 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:25:45,907 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:25:47,963 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:25:50,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:25:52,900 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:25:55,335 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:25:58,075 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:25:58,875 INFO L124 PetriNetUnfolderBase]: 28995/56892 cut-off events. [2023-08-03 15:25:58,876 INFO L125 PetriNetUnfolderBase]: For 501095/501218 co-relation queries the response was YES. [2023-08-03 15:25:59,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288416 conditions, 56892 events. 28995/56892 cut-off events. For 501095/501218 co-relation queries the response was YES. Maximal size of possible extension queue 2415. Compared 595884 event pairs, 5905 based on Foata normal form. 135/51735 useless extension candidates. Maximal degree in co-relation 288300. Up to 23438 conditions per place. [2023-08-03 15:25:59,635 INFO L140 encePairwiseOnDemand]: 461/485 looper letters, 511 selfloop transitions, 455 changer transitions 113/1087 dead transitions. [2023-08-03 15:25:59,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 1087 transitions, 15019 flow [2023-08-03 15:25:59,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-03 15:25:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-03 15:25:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3416 transitions. [2023-08-03 15:25:59,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37069994574064025 [2023-08-03 15:25:59,650 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3416 transitions. [2023-08-03 15:25:59,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3416 transitions. [2023-08-03 15:25:59,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:25:59,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3416 transitions. [2023-08-03 15:25:59,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 179.78947368421052) internal successors, (3416), 19 states have internal predecessors, (3416), 0 states have call successors, (0), 0 states 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:59,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 485.0) internal successors, (9700), 20 states have internal predecessors, (9700), 0 states have call successors, (0), 0 states 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:59,662 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 485.0) internal successors, (9700), 20 states have internal predecessors, (9700), 0 states have call successors, (0), 0 states 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:59,662 INFO L175 Difference]: Start difference. First operand has 249 places, 521 transitions, 7533 flow. Second operand 19 states and 3416 transitions. [2023-08-03 15:25:59,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 1087 transitions, 15019 flow [2023-08-03 15:26:03,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 1087 transitions, 14871 flow, removed 74 selfloop flow, removed 0 redundant places. [2023-08-03 15:26:03,578 INFO L231 Difference]: Finished difference. Result has 278 places, 698 transitions, 11419 flow [2023-08-03 15:26:03,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=7467, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=305, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=11419, PETRI_PLACES=278, PETRI_TRANSITIONS=698} [2023-08-03 15:26:03,579 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 210 predicate places. [2023-08-03 15:26:03,579 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 698 transitions, 11419 flow [2023-08-03 15:26:03,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 157.45454545454547) internal successors, (3464), 22 states have internal predecessors, (3464), 0 states have call successors, (0), 0 states 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:03,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:26:03,580 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:26:03,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-03 15:26:03,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:26:03,781 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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:03,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:26:03,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1201558247, now seen corresponding path program 3 times [2023-08-03 15:26:03,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:26:03,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378621753] [2023-08-03 15:26:03,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:26:03,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:26:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:26:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:26:09,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:26:09,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378621753] [2023-08-03 15:26:09,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378621753] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:26:09,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486791506] [2023-08-03 15:26:09,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 15:26:09,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:26:09,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:26:09,421 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:26:09,423 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:26:09,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-03 15:26:09,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:26:09,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-03 15:26:09,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:26:09,589 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 7 treesize of output 6 [2023-08-03 15:26:09,688 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:26:09,688 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:26:09,727 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 13 treesize of output 15 [2023-08-03 15:26:09,783 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 13 treesize of output 15 [2023-08-03 15:26:09,853 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:26:09,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:26:09,946 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:26:10,011 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-03 15:26:10,012 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 22 treesize of output 15 [2023-08-03 15:26:10,064 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 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 15:26:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:26:10,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:26:10,337 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:26:10,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-08-03 15:26:10,346 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:26:10,347 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 45 treesize of output 42 [2023-08-03 15:26:10,351 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-03 15:26:12,374 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1220 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (|~#a~0.offset| Int)) (= (select (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_77| v_ArrVal_1220) (+ .cse1 |~#a~0.offset|)) 0))) (forall ((v_ArrVal_1220 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (|~#a~0.offset| Int)) (let ((.cse2 (+ .cse1 |~#a~0.offset|))) (or (= .cse2 |v_t_funThread1of2ForFork0_~p~0#1.offset_77|) (= (select (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_77| v_ArrVal_1220) .cse2) 0)))))) is different from false [2023-08-03 15:26:12,418 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (forall ((v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1220 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (|~#a~0.offset| Int)) (let ((.cse0 (+ .cse1 |~#a~0.offset|))) (or (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_77|) (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1215) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_77| v_ArrVal_1220) .cse0))))) (or (forall ((v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1220 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (|~#a~0.offset| Int)) (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1215) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_77| v_ArrVal_1220) (+ .cse1 |~#a~0.offset|)))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-08-03 15:26:20,604 WARN L233 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:26:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-03 15:26:20,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486791506] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:26:20,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:26:20,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 31 [2023-08-03 15:26:20,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445770246] [2023-08-03 15:26:20,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:26:20,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-03 15:26:20,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:26:20,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-03 15:26:20,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=798, Unknown=4, NotChecked=118, Total=1056 [2023-08-03 15:26:21,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 485 [2023-08-03 15:26:21,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 698 transitions, 11419 flow. Second operand has 33 states, 33 states have (on average 152.0) internal successors, (5016), 33 states have internal predecessors, (5016), 0 states have call successors, (0), 0 states 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:21,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:26:21,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 485 [2023-08-03 15:26:21,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:27:09,879 INFO L124 PetriNetUnfolderBase]: 33719/67287 cut-off events. [2023-08-03 15:27:09,879 INFO L125 PetriNetUnfolderBase]: For 817206/817380 co-relation queries the response was YES. [2023-08-03 15:27:10,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377459 conditions, 67287 events. 33719/67287 cut-off events. For 817206/817380 co-relation queries the response was YES. Maximal size of possible extension queue 2830. Compared 731309 event pairs, 8186 based on Foata normal form. 224/61579 useless extension candidates. Maximal degree in co-relation 377330. Up to 25854 conditions per place. [2023-08-03 15:27:10,873 INFO L140 encePairwiseOnDemand]: 467/485 looper letters, 747 selfloop transitions, 470 changer transitions 193/1418 dead transitions. [2023-08-03 15:27:10,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 1418 transitions, 22672 flow [2023-08-03 15:27:10,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-03 15:27:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-03 15:27:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 5988 transitions. [2023-08-03 15:27:10,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3429553264604811 [2023-08-03 15:27:10,879 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 5988 transitions. [2023-08-03 15:27:10,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 5988 transitions. [2023-08-03 15:27:10,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:27:10,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 5988 transitions. [2023-08-03 15:27:10,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 166.33333333333334) internal successors, (5988), 36 states have internal predecessors, (5988), 0 states have call successors, (0), 0 states 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,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 485.0) internal successors, (17945), 37 states have internal predecessors, (17945), 0 states have call successors, (0), 0 states 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,899 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 485.0) internal successors, (17945), 37 states have internal predecessors, (17945), 0 states have call successors, (0), 0 states 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,899 INFO L175 Difference]: Start difference. First operand has 278 places, 698 transitions, 11419 flow. Second operand 36 states and 5988 transitions. [2023-08-03 15:27:10,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 1418 transitions, 22672 flow [2023-08-03 15:27:19,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 1418 transitions, 21679 flow, removed 250 selfloop flow, removed 7 redundant places. [2023-08-03 15:27:19,561 INFO L231 Difference]: Finished difference. Result has 319 places, 841 transitions, 14881 flow [2023-08-03 15:27:19,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=10789, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=698, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=343, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=14881, PETRI_PLACES=319, PETRI_TRANSITIONS=841} [2023-08-03 15:27:19,561 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 251 predicate places. [2023-08-03 15:27:19,562 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 841 transitions, 14881 flow [2023-08-03 15:27:19,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 152.0) internal successors, (5016), 33 states have internal predecessors, (5016), 0 states have call successors, (0), 0 states 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:19,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:27:19,562 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:27:19,567 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:27:19,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:27:19,763 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:19,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:27:19,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1175596910, now seen corresponding path program 1 times [2023-08-03 15:27:19,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:27:19,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965972132] [2023-08-03 15:27:19,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:27:19,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:27:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:27:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:27:20,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:27:20,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965972132] [2023-08-03 15:27:20,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965972132] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:27:20,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527585945] [2023-08-03 15:27:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:27:20,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:27:20,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:27:20,026 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:27:20,029 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:27:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:27:20,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-03 15:27:20,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:27:20,190 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 7 treesize of output 6 [2023-08-03 15:27:20,245 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:27:20,245 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:27:20,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 13 treesize of output 15 [2023-08-03 15:27:20,291 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 13 treesize of output 15 [2023-08-03 15:27:20,326 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:27:20,365 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-03 15:27:20,365 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 22 treesize of output 15 [2023-08-03 15:27:20,429 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 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-03 15:27:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:27:20,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:27:20,554 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 18 treesize of output 16 [2023-08-03 15:27:20,560 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2023-08-03 15:27:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:27:24,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527585945] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:27:24,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:27:24,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-03 15:27:24,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130474813] [2023-08-03 15:27:24,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:27:24,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-03 15:27:24,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:27:24,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-03 15:27:24,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=209, Unknown=3, NotChecked=0, Total=272 [2023-08-03 15:27:26,742 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:28,776 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:30,808 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:32,860 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:34,906 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:36,957 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:27:39,047 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:41,143 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:43,212 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:45,234 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:47,265 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:27:49,348 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:51,391 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:53,453 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:55,514 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:57,565 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:59,587 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:28:01,624 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:28:03,676 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:28:05,903 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:28:07,941 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:28:09,992 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:28:12,033 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:28:14,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:28:16,121 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:28:18,173 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:28:20,227 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:28:22,297 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:28:24,333 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:28:24,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 485 [2023-08-03 15:28:24,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 841 transitions, 14881 flow. Second operand has 17 states, 17 states have (on average 158.94117647058823) internal successors, (2702), 17 states have internal predecessors, (2702), 0 states have call successors, (0), 0 states 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:24,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:28:24,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 485 [2023-08-03 15:28:24,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:28:43,919 INFO L124 PetriNetUnfolderBase]: 35037/69841 cut-off events. [2023-08-03 15:28:43,920 INFO L125 PetriNetUnfolderBase]: For 1061854/1062028 co-relation queries the response was YES. [2023-08-03 15:28:45,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419575 conditions, 69841 events. 35037/69841 cut-off events. For 1061854/1062028 co-relation queries the response was YES. Maximal size of possible extension queue 2936. Compared 762852 event pairs, 13067 based on Foata normal form. 51/63618 useless extension candidates. Maximal degree in co-relation 419423. Up to 46767 conditions per place. [2023-08-03 15:28:45,403 INFO L140 encePairwiseOnDemand]: 465/485 looper letters, 828 selfloop transitions, 277 changer transitions 149/1262 dead transitions. [2023-08-03 15:28:45,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 1262 transitions, 21606 flow [2023-08-03 15:28:45,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-03 15:28:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-03 15:28:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3388 transitions. [2023-08-03 15:28:45,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3676614215952252 [2023-08-03 15:28:45,406 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3388 transitions. [2023-08-03 15:28:45,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3388 transitions. [2023-08-03 15:28:45,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:28:45,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3388 transitions. [2023-08-03 15:28:45,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 178.31578947368422) internal successors, (3388), 19 states have internal predecessors, (3388), 0 states have call successors, (0), 0 states 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:45,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 485.0) internal successors, (9700), 20 states have internal predecessors, (9700), 0 states have call successors, (0), 0 states 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:45,418 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 485.0) internal successors, (9700), 20 states have internal predecessors, (9700), 0 states have call successors, (0), 0 states 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:45,418 INFO L175 Difference]: Start difference. First operand has 319 places, 841 transitions, 14881 flow. Second operand 19 states and 3388 transitions. [2023-08-03 15:28:45,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 1262 transitions, 21606 flow [2023-08-03 15:28:59,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 1262 transitions, 21345 flow, removed 116 selfloop flow, removed 12 redundant places. [2023-08-03 15:28:59,315 INFO L231 Difference]: Finished difference. Result has 332 places, 852 transitions, 15759 flow [2023-08-03 15:28:59,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=14620, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=15759, PETRI_PLACES=332, PETRI_TRANSITIONS=852} [2023-08-03 15:28:59,316 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 264 predicate places. [2023-08-03 15:28:59,316 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 852 transitions, 15759 flow [2023-08-03 15:28:59,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 158.94117647058823) internal successors, (2702), 17 states have internal predecessors, (2702), 0 states have call successors, (0), 0 states 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,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:28:59,317 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:28:59,321 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:28:59,521 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,SelfDestructingSolverStorable23 [2023-08-03 15:28:59,522 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:28:59,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:28:59,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1246869714, now seen corresponding path program 2 times [2023-08-03 15:28:59,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:28:59,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382003084] [2023-08-03 15:28:59,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:28:59,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:28:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:29:01,247 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:29:01,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:29:01,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382003084] [2023-08-03 15:29:01,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382003084] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:29:01,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804519403] [2023-08-03 15:29:01,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:29:01,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:29:01,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:29:01,249 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:29:01,263 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:29:01,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:29:01,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:29:01,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-03 15:29:01,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:29:01,432 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 7 treesize of output 6 [2023-08-03 15:29:01,526 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:29:01,527 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:29:01,570 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 13 treesize of output 15 [2023-08-03 15:29:01,610 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 13 treesize of output 15 [2023-08-03 15:29:01,667 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 16 treesize of output 12 [2023-08-03 15:29:01,711 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-03 15:29:01,712 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 22 treesize of output 15 [2023-08-03 15:29:01,803 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 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-03 15:29:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:29:01,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:29:01,982 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 18 treesize of output 16 [2023-08-03 15:29:01,988 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-03 15:29:04,010 WARN L839 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1390 Int)) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) .cse0 v_ArrVal_1390) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|) 0) (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_81|)))) is different from false [2023-08-03 15:29:04,031 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1386 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1390 Int)) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_81|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1386) |c_~#a~0.base|) .cse0 v_ArrVal_1390) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|) 0)))) is different from false [2023-08-03 15:29:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-03 15:29:04,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804519403] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:29:04,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:29:04,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 27 [2023-08-03 15:29:04,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724355148] [2023-08-03 15:29:04,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:29:04,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-03 15:29:04,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:29:04,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-03 15:29:04,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=605, Unknown=2, NotChecked=102, Total=812 [2023-08-03 15:29:04,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 485 [2023-08-03 15:29:04,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 852 transitions, 15759 flow. Second operand has 29 states, 29 states have (on average 153.17241379310346) internal successors, (4442), 29 states have internal predecessors, (4442), 0 states have call successors, (0), 0 states 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:04,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:29:04,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 485 [2023-08-03 15:29:04,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:29:22,719 WARN L233 SmtUtils]: Spent 18.25s on a formula simplification. DAG size of input: 40 DAG size of output: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:29:24,722 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:29:27,210 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:29:29,693 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:30,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:29:43,282 WARN L233 SmtUtils]: Spent 12.12s on a formula simplification. DAG size of input: 41 DAG size of output: 27 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:29:45,946 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:47,993 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:30:25,399 WARN L233 SmtUtils]: Spent 36.28s on a formula simplification. DAG size of input: 36 DAG size of output: 29 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:30:27,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:30:29,426 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:30:31,446 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:30:33,448 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:35,459 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:30:37,478 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:30:39,496 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:30:41,740 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:30:43,750 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:30:45,752 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:47,754 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:49,794 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:30:51,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:30:53,115 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:30:55,132 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:30:57,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 15:30:58,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:31:00,807 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:31:02,809 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:31:04,872 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:31:06,897 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:31:08,910 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:31:10,912 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:31:13,526 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:31:15,543 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:31:17,564 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:31:19,573 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:31:21,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:31:23,785 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:31:25,816 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:31:27,828 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:31:29,846 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:31:32,351 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 [0, 1] [2023-08-03 15:31:34,355 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:31:40,277 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:31:42,284 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:31:44,309 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:31:46,341 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:31:48,368 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:31:50,445 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:32:18,724 INFO L124 PetriNetUnfolderBase]: 38881/77909 cut-off events. [2023-08-03 15:32:18,724 INFO L125 PetriNetUnfolderBase]: For 1267408/1267808 co-relation queries the response was YES. [2023-08-03 15:32:20,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472254 conditions, 77909 events. 38881/77909 cut-off events. For 1267408/1267808 co-relation queries the response was YES. Maximal size of possible extension queue 3066. Compared 866296 event pairs, 14418 based on Foata normal form. 61/70573 useless extension candidates. Maximal degree in co-relation 472102. Up to 47241 conditions per place. [2023-08-03 15:32:20,459 INFO L140 encePairwiseOnDemand]: 462/485 looper letters, 904 selfloop transitions, 396 changer transitions 207/1515 dead transitions. [2023-08-03 15:32:20,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 1515 transitions, 27813 flow [2023-08-03 15:32:20,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-03 15:32:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-03 15:32:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 5787 transitions. [2023-08-03 15:32:20,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34091310751104564 [2023-08-03 15:32:20,464 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 5787 transitions. [2023-08-03 15:32:20,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 5787 transitions. [2023-08-03 15:32:20,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:32:20,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 5787 transitions. [2023-08-03 15:32:20,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 165.34285714285716) internal successors, (5787), 35 states have internal predecessors, (5787), 0 states have call successors, (0), 0 states 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,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 485.0) internal successors, (17460), 36 states have internal predecessors, (17460), 0 states have call successors, (0), 0 states 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,485 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 485.0) internal successors, (17460), 36 states have internal predecessors, (17460), 0 states have call successors, (0), 0 states 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,486 INFO L175 Difference]: Start difference. First operand has 332 places, 852 transitions, 15759 flow. Second operand 35 states and 5787 transitions. [2023-08-03 15:32:20,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 1515 transitions, 27813 flow [2023-08-03 15:32:40,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 1515 transitions, 27510 flow, removed 106 selfloop flow, removed 6 redundant places. [2023-08-03 15:32:40,793 INFO L231 Difference]: Finished difference. Result has 369 places, 950 transitions, 19427 flow [2023-08-03 15:32:40,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=15543, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=852, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=248, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=19427, PETRI_PLACES=369, PETRI_TRANSITIONS=950} [2023-08-03 15:32:40,794 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 301 predicate places. [2023-08-03 15:32:40,794 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 950 transitions, 19427 flow [2023-08-03 15:32:40,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 153.17241379310346) internal successors, (4442), 29 states have internal predecessors, (4442), 0 states have call successors, (0), 0 states 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:40,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:32:40,795 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:32:40,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-08-03 15:32:40,995 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,SelfDestructingSolverStorable24 [2023-08-03 15:32:40,996 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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:32:40,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:32:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1867585665, now seen corresponding path program 4 times [2023-08-03 15:32:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:32:40,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041088713] [2023-08-03 15:32:40,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:32:40,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:32:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:32:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 15:32:44,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:32:44,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041088713] [2023-08-03 15:32:44,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041088713] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:32:44,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946943255] [2023-08-03 15:32:44,264 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-03 15:32:44,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:32:44,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:32:44,266 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:32:44,269 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:32:44,400 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-03 15:32:44,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:32:44,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-03 15:32:44,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:32:44,409 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 7 treesize of output 6 [2023-08-03 15:32:44,530 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:32:44,531 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:32:44,571 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 13 treesize of output 15 [2023-08-03 15:32:44,600 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:44,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:32:44,715 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:44,795 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 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 15:32:44,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:32:44,847 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:44,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:32:44,976 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-03 15:32:44,976 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 22 treesize of output 15 [2023-08-03 15:32:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 15:32:45,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:32:45,179 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1476 (Array Int Int)) (|~#a~0.offset| Int)) (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1476) |c_~#a~0.base|) (+ .cse0 4 |~#a~0.offset|)) 0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1477) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|)) 0)))) is different from false [2023-08-03 15:32:45,190 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_ArrVal_1476 (Array Int Int)) (|~#a~0.offset| Int)) (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1474)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1477) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1476) |c_~#a~0.base|) (+ .cse0 4 |~#a~0.offset|)) 0))))) is different from false [2023-08-03 15:32:45,241 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:32:45,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-08-03 15:32:45,253 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:32:45,253 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 45 treesize of output 42 [2023-08-03 15:32:45,259 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-03 15:32:45,686 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (|~#a~0.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_83| v_ArrVal_1474)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1477) |c_~#a~0.base|) (+ .cse1 |~#a~0.offset|)) 0))) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (|~#a~0.offset| Int)) (let ((.cse2 (+ .cse1 |~#a~0.offset|))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_83| v_ArrVal_1474)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1477) |c_~#a~0.base|) .cse2) 0) (= .cse2 |v_t_funThread1of2ForFork0_~p~0#1.offset_83|)))))) is different from false [2023-08-03 15:32:45,708 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (|~#a~0.offset| Int) (v_ArrVal_1470 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1470))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83| v_ArrVal_1474))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1477) |c_~#a~0.base|) (+ .cse1 |~#a~0.offset|))))) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (|~#a~0.offset| Int) (v_ArrVal_1470 (Array Int Int))) (let ((.cse3 (+ .cse1 |~#a~0.offset|))) (or (= 0 (select (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1470))) (store .cse2 |c_~#a~0.base| (store (select .cse2 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83| v_ArrVal_1474))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1477) |c_~#a~0.base|) .cse3)) (= .cse3 |v_t_funThread1of2ForFork0_~p~0#1.offset_83|)))))) is different from false [2023-08-03 15:32:53,949 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:32:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 5 not checked. [2023-08-03 15:32:54,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946943255] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:32:54,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:32:54,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 8] total 32 [2023-08-03 15:32:54,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250572073] [2023-08-03 15:32:54,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:32:54,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-03 15:32:54,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:32:54,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-03 15:32:54,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=726, Unknown=5, NotChecked=236, Total=1122 [2023-08-03 15:32:54,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 485 [2023-08-03 15:32:54,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 950 transitions, 19427 flow. Second operand has 34 states, 34 states have (on average 151.94117647058823) internal successors, (5166), 34 states have internal predecessors, (5166), 0 states have call successors, (0), 0 states 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:54,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:32:54,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 485 [2023-08-03 15:32:54,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:33:15,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 15:33:18,015 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 [0, 1] [2023-08-03 15:33:22,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] Received shutdown request... [2023-08-03 15:33:24,035 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-03 15:33:24,035 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:33:24,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-03 15:33:24,670 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-03 15:33:24,675 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:33:24,870 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,SelfDestructingSolverStorable25 [2023-08-03 15:33:24,871 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (34states, 150/485 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 211904 conditions, 38773 events (19978/38772 cut-off events. For 596792/596917 co-relation queries the response was YES. Maximal size of possible extension queue 3188. Compared 424362 event pairs, 4284 based on Foata normal form. 28/36092 useless extension candidates. Maximal degree in co-relation 211733. Up to 11870 conditions per place.). [2023-08-03 15:33:24,871 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-08-03 15:33:24,871 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-08-03 15:33:24,871 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-08-03 15:33:24,871 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-03 15:33:24,871 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 15:33:24,874 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 15:33:24,874 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 15:33:24,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 03:33:24 BasicIcfg [2023-08-03 15:33:24,877 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 15:33:24,878 INFO L158 Benchmark]: Toolchain (without parser) took 810361.61ms. Allocated memory was 329.3MB in the beginning and 13.8GB in the end (delta: 13.5GB). Free memory was 271.9MB in the beginning and 10.9GB in the end (delta: -10.6GB). Peak memory consumption was 3.5GB. Max. memory is 16.0GB. [2023-08-03 15:33:24,878 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 329.3MB. Free memory is still 277.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 15:33:24,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.96ms. Allocated memory is still 329.3MB. Free memory was 271.6MB in the beginning and 242.1MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-03 15:33:24,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.73ms. Allocated memory was 329.3MB in the beginning and 578.8MB in the end (delta: 249.6MB). Free memory was 242.1MB in the beginning and 541.9MB in the end (delta: -299.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-03 15:33:24,878 INFO L158 Benchmark]: Boogie Preprocessor took 37.23ms. Allocated memory is still 578.8MB. Free memory was 541.9MB in the beginning and 539.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 15:33:24,878 INFO L158 Benchmark]: RCFGBuilder took 386.40ms. Allocated memory is still 578.8MB. Free memory was 539.8MB in the beginning and 517.8MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 15:33:24,878 INFO L158 Benchmark]: TraceAbstraction took 809286.86ms. Allocated memory was 578.8MB in the beginning and 13.8GB in the end (delta: 13.2GB). Free memory was 517.8MB in the beginning and 10.9GB in the end (delta: -10.3GB). Peak memory consumption was 3.5GB. Max. memory is 16.0GB. [2023-08-03 15:33:24,879 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.12ms. Allocated memory is still 329.3MB. Free memory is still 277.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 577.96ms. Allocated memory is still 329.3MB. Free memory was 271.6MB in the beginning and 242.1MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.73ms. Allocated memory was 329.3MB in the beginning and 578.8MB in the end (delta: 249.6MB). Free memory was 242.1MB in the beginning and 541.9MB in the end (delta: -299.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.23ms. Allocated memory is still 578.8MB. Free memory was 541.9MB in the beginning and 539.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 386.40ms. Allocated memory is still 578.8MB. Free memory was 539.8MB in the beginning and 517.8MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 809286.86ms. Allocated memory was 578.8MB in the beginning and 13.8GB in the end (delta: 13.2GB). Free memory was 517.8MB in the beginning and 10.9GB in the end (delta: -10.3GB). 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] - GenericResultAtLocation [Line: 736]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [736] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 161 PlacesBefore, 45 PlacesAfterwards, 188 TransitionsBefore, 66 TransitionsAfterwards, 10792 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 100 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 18 ConcurrentYvCompositions, 6 ChoiceCompositions, 164 TotalNumberOfCompositions, 17790 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9093, independent: 8818, independent conditional: 0, independent unconditional: 8818, dependent: 275, dependent conditional: 0, dependent unconditional: 275, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5389, independent: 5328, independent conditional: 0, independent unconditional: 5328, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9093, independent: 3490, independent conditional: 0, independent unconditional: 3490, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 5389, unknown conditional: 0, unknown unconditional: 5389] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 226 PlacesBefore, 68 PlacesAfterwards, 266 TransitionsBefore, 101 TransitionsAfterwards, 33228 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 143 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 29 ConcurrentYvCompositions, 7 ChoiceCompositions, 219 TotalNumberOfCompositions, 56804 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 27084, independent: 26654, independent conditional: 0, independent unconditional: 26654, dependent: 430, dependent conditional: 0, dependent unconditional: 430, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 16451, independent: 16337, independent conditional: 0, independent unconditional: 16337, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27084, independent: 10317, independent conditional: 0, independent unconditional: 10317, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 16451, unknown conditional: 0, unknown unconditional: 16451] , Statistics on independence cache: Total cache size (in pairs): 496, Positive cache size: 444, Positive conditional cache size: 0, Positive unconditional cache size: 444, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (34states, 150/485 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 211904 conditions, 38773 events (19978/38772 cut-off events. For 596792/596917 co-relation queries the response was YES. Maximal size of possible extension queue 3188. Compared 424362 event pairs, 4284 based on Foata normal form. 28/36092 useless extension candidates. Maximal degree in co-relation 211733. Up to 11870 conditions per place.). - TimeoutResultAtElement [Line: 954]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (34states, 150/485 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 211904 conditions, 38773 events (19978/38772 cut-off events. For 596792/596917 co-relation queries the response was YES. Maximal size of possible extension queue 3188. Compared 424362 event pairs, 4284 based on Foata normal form. 28/36092 useless extension candidates. Maximal degree in co-relation 211733. Up to 11870 conditions per place.). - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (34states, 150/485 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 211904 conditions, 38773 events (19978/38772 cut-off events. For 596792/596917 co-relation queries the response was YES. Maximal size of possible extension queue 3188. Compared 424362 event pairs, 4284 based on Foata normal form. 28/36092 useless extension candidates. Maximal degree in co-relation 211733. Up to 11870 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 222 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: 5.4s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 90 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 571 IncrementalHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 2 mSDtfsCounter, 571 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=4, InterpolantAutomatonStates: 24, 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.5s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 331 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 13/47 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, 281 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: 803.7s, OverallIterations: 21, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 640.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 345 mSolverCounterUnknown, 11130 SdHoareTripleChecker+Valid, 327.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10734 mSDsluCounter, 1700 SdHoareTripleChecker+Invalid, 324.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 9957 IncrementalHoareTripleChecker+Unchecked, 1664 mSDsCounter, 1368 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24336 IncrementalHoareTripleChecker+Invalid, 36006 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1368 mSolverCounterUnsat, 36 mSDtfsCounter, 24336 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1275 GetRequests, 742 SyntacticMatches, 21 SemanticMatches, 512 ConstructedPredicates, 21 IntricatePredicates, 1 DeprecatedPredicates, 3780 ImplicationChecksByTransitivity, 272.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19427occurred in iteration=20, InterpolantAutomatonStates: 303, 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.1s SatisfiabilityAnalysisTime, 153.3s InterpolantComputationTime, 982 NumberOfCodeBlocks, 964 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1359 ConstructedInterpolants, 375 QuantifiedInterpolants, 27130 SizeOfPredicates, 113 NumberOfNonLiveVariables, 3963 ConjunctsInSsa, 491 ConjunctsInUnsatCore, 56 InterpolantComputations, 5 PerfectInterpolantSequences, 2336/2725 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