/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 INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_77-tricky_address4_racing_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 21:30:13,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 21:30:13,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 21:30:13,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 21:30:13,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 21:30:13,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 21:30:13,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 21:30:13,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 21:30:13,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 21:30:13,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 21:30:13,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 21:30:13,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 21:30:13,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 21:30:13,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 21:30:13,536 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 21:30:13,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 21:30:13,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 21:30:13,537 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 21:30:13,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 21:30:13,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 21:30:13,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 21:30:13,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 21:30:13,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 21:30:13,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 21:30:13,539 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 21:30:13,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 21:30:13,539 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 21:30:13,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 21:30:13,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 21:30:13,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 21:30:13,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:30:13,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 21:30:13,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 21:30:13,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 21:30:13,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 21:30:13,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 21:30:13,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 21:30:13,542 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 21:30:13,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 21:30:13,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 21:30:13,542 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 21:30:13,542 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 -> INSUFFICIENT_FIRST [2023-08-03 21:30:13,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 21:30:13,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 21:30:13,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 21:30:13,741 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 21:30:13,741 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 21:30:13,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_77-tricky_address4_racing_bound2.i [2023-08-03 21:30:14,752 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 21:30:14,912 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 21:30:14,912 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_77-tricky_address4_racing_bound2.i [2023-08-03 21:30:14,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17a6f0da0/608103316db74520b34bcd7547943e92/FLAG72101ae97 [2023-08-03 21:30:14,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17a6f0da0/608103316db74520b34bcd7547943e92 [2023-08-03 21:30:14,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 21:30:14,940 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 21:30:14,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 21:30:14,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 21:30:14,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 21:30:14,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:30:14" (1/1) ... [2023-08-03 21:30:14,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d9927b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:30:14, skipping insertion in model container [2023-08-03 21:30:14,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:30:14" (1/1) ... [2023-08-03 21:30:14,974 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 21:30:15,233 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_77-tricky_address4_racing_bound2.i[41323,41336] [2023-08-03 21:30:15,248 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:30:15,257 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 21:30:15,267 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-03 21:30:15,268 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-03 21:30:15,274 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-03 21:30:15,281 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_77-tricky_address4_racing_bound2.i[41323,41336] [2023-08-03 21:30:15,289 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:30:15,334 INFO L206 MainTranslator]: Completed translation [2023-08-03 21:30:15,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:30:15 WrapperNode [2023-08-03 21:30:15,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 21:30:15,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 21:30:15,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 21:30:15,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 21:30:15,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:30:15" (1/1) ... [2023-08-03 21:30:15,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:30:15" (1/1) ... [2023-08-03 21:30:15,366 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 193 [2023-08-03 21:30:15,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 21:30:15,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 21:30:15,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 21:30:15,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 21:30:15,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:30:15" (1/1) ... [2023-08-03 21:30:15,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:30:15" (1/1) ... [2023-08-03 21:30:15,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:30:15" (1/1) ... [2023-08-03 21:30:15,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:30:15" (1/1) ... [2023-08-03 21:30:15,380 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:30:15" (1/1) ... [2023-08-03 21:30:15,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:30:15" (1/1) ... [2023-08-03 21:30:15,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:30:15" (1/1) ... [2023-08-03 21:30:15,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:30:15" (1/1) ... [2023-08-03 21:30:15,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 21:30:15,392 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 21:30:15,392 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 21:30:15,392 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 21:30:15,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:30:15" (1/1) ... [2023-08-03 21:30:15,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:30:15,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:30:15,420 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 21:30:15,438 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 21:30:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 21:30:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 21:30:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 21:30:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 21:30:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-03 21:30:15,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 21:30:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-03 21:30:15,448 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-03 21:30:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 21:30:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 21:30:15,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 21:30:15,449 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 21:30:15,593 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 21:30:15,595 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 21:30:15,841 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 21:30:15,845 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 21:30:15,845 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-03 21:30:15,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:30:15 BoogieIcfgContainer [2023-08-03 21:30:15,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 21:30:15,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 21:30:15,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 21:30:15,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 21:30:15,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 09:30:14" (1/3) ... [2023-08-03 21:30:15,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fba78b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:30:15, skipping insertion in model container [2023-08-03 21:30:15,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:30:15" (2/3) ... [2023-08-03 21:30:15,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fba78b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:30:15, skipping insertion in model container [2023-08-03 21:30:15,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:30:15" (3/3) ... [2023-08-03 21:30:15,851 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_77-tricky_address4_racing_bound2.i [2023-08-03 21:30:15,856 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 21:30:15,861 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 21:30:15,862 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 21:30:15,862 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 21:30:15,908 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-03 21:30:15,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 193 transitions, 394 flow [2023-08-03 21:30:16,003 INFO L124 PetriNetUnfolderBase]: 45/263 cut-off events. [2023-08-03 21:30:16,003 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-03 21:30:16,009 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 21:30:16,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 193 transitions, 394 flow [2023-08-03 21:30:16,012 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 188 transitions, 381 flow [2023-08-03 21:30:16,014 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:30:16,019 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-03 21:30:16,021 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-03 21:30:16,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 188 transitions, 381 flow [2023-08-03 21:30:16,047 INFO L124 PetriNetUnfolderBase]: 44/258 cut-off events. [2023-08-03 21:30:16,047 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:30:16,052 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 21:30:16,057 INFO L119 LiptonReduction]: Number of co-enabled transitions 10792 [2023-08-03 21:30:18,185 INFO L134 LiptonReduction]: Checked pairs total: 17790 [2023-08-03 21:30:18,185 INFO L136 LiptonReduction]: Total number of compositions: 164 [2023-08-03 21:30:18,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 21:30:18,198 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;@2a8c6ef7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:30:18,198 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-03 21:30:18,202 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:30:18,203 INFO L124 PetriNetUnfolderBase]: 10/40 cut-off events. [2023-08-03 21:30:18,203 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:30:18,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:30:18,203 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-03 21:30:18,203 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:30:18,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:30:18,207 INFO L85 PathProgramCache]: Analyzing trace with hash -947284719, now seen corresponding path program 1 times [2023-08-03 21:30:18,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:30:18,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591717981] [2023-08-03 21:30:18,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:18,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:30:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 21:30:18,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:30:18,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591717981] [2023-08-03 21:30:18,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591717981] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:30:18,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:30:18,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:30:18,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678494273] [2023-08-03 21:30:18,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:30:18,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:30:18,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:30:18,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:30:18,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:30:18,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 357 [2023-08-03 21:30:18,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:18,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:30:18,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 357 [2023-08-03 21:30:18,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:30:18,508 INFO L124 PetriNetUnfolderBase]: 272/614 cut-off events. [2023-08-03 21:30:18,509 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:30:18,510 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 21:30:18,511 INFO L140 encePairwiseOnDemand]: 332/357 looper letters, 20 selfloop transitions, 2 changer transitions 18/45 dead transitions. [2023-08-03 21:30:18,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 167 flow [2023-08-03 21:30:18,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:30:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:30:18,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2023-08-03 21:30:18,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976657329598506 [2023-08-03 21:30:18,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 533 transitions. [2023-08-03 21:30:18,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 533 transitions. [2023-08-03 21:30:18,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:30:18,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 533 transitions. [2023-08-03 21:30:18,526 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 21:30:18,529 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 21:30:18,530 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 21:30:18,531 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 533 transitions. [2023-08-03 21:30:18,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 167 flow [2023-08-03 21:30:18,532 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 21:30:18,533 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 69 flow [2023-08-03 21:30:18,535 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=69, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2023-08-03 21:30:18,537 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-08-03 21:30:18,537 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 69 flow [2023-08-03 21:30:18,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:18,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:30:18,537 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-03 21:30:18,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 21:30:18,538 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:30:18,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:30:18,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1382333179, now seen corresponding path program 1 times [2023-08-03 21:30:18,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:30:18,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978678456] [2023-08-03 21:30:18,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:18,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:30:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:18,602 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 21:30:18,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:30:18,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978678456] [2023-08-03 21:30:18,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978678456] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:30:18,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621302974] [2023-08-03 21:30:18,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:18,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:30:18,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:30:18,606 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 21:30:18,636 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 21:30:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:18,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:30:18,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:30:18,700 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 21:30:18,700 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:30:18,711 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 21:30:18,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621302974] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:30:18,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:30:18,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-03 21:30:18,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399869614] [2023-08-03 21:30:18,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:30:18,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 21:30:18,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:30:18,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 21:30:18,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-03 21:30:18,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 357 [2023-08-03 21:30:18,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 27 transitions, 69 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 21:30:18,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:30:18,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 357 [2023-08-03 21:30:18,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:30:18,796 INFO L124 PetriNetUnfolderBase]: 47/129 cut-off events. [2023-08-03 21:30:18,796 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:30:18,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 129 events. 47/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 381 event pairs, 42 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 245. Up to 108 conditions per place. [2023-08-03 21:30:18,797 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 20 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-08-03 21:30:18,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 131 flow [2023-08-03 21:30:18,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 21:30:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 21:30:18,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 970 transitions. [2023-08-03 21:30:18,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45284780578898226 [2023-08-03 21:30:18,802 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 970 transitions. [2023-08-03 21:30:18,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 970 transitions. [2023-08-03 21:30:18,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:30:18,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 970 transitions. [2023-08-03 21:30:18,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.66666666666666) internal successors, (970), 6 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:18,810 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 21:30:18,811 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 21:30:18,811 INFO L175 Difference]: Start difference. First operand has 47 places, 27 transitions, 69 flow. Second operand 6 states and 970 transitions. [2023-08-03 21:30:18,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 131 flow [2023-08-03 21:30:18,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 127 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 21:30:18,812 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2023-08-03 21:30:18,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-08-03 21:30:18,813 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-08-03 21:30:18,813 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2023-08-03 21:30:18,813 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 21:30:18,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:30:18,814 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-03 21:30:18,825 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 21:30:19,019 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 21:30:19,021 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:30:19,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:30:19,021 INFO L85 PathProgramCache]: Analyzing trace with hash 941146001, now seen corresponding path program 2 times [2023-08-03 21:30:19,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:30:19,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213479231] [2023-08-03 21:30:19,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:19,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:30:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:19,107 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 21:30:19,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:30:19,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213479231] [2023-08-03 21:30:19,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213479231] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:30:19,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038633729] [2023-08-03 21:30:19,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:30:19,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:30:19,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:30:19,109 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 21:30:19,136 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 21:30:19,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:30:19,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:30:19,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 21:30:19,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:30:19,182 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 21:30:19,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:30:19,221 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 21:30:19,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038633729] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:30:19,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:30:19,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-03 21:30:19,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802277065] [2023-08-03 21:30:19,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:30:19,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 21:30:19,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:30:19,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 21:30:19,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-03 21:30:19,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 357 [2023-08-03 21:30:19,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 101 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 21:30:19,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:30:19,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 357 [2023-08-03 21:30:19,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:30:19,295 INFO L124 PetriNetUnfolderBase]: 47/135 cut-off events. [2023-08-03 21:30:19,295 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-03 21:30:19,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 135 events. 47/135 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 381 event pairs, 42 based on Foata normal form. 6/117 useless extension candidates. Maximal degree in co-relation 236. Up to 108 conditions per place. [2023-08-03 21:30:19,296 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 20 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2023-08-03 21:30:19,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 199 flow [2023-08-03 21:30:19,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-03 21:30:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-03 21:30:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1921 transitions. [2023-08-03 21:30:19,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44841269841269843 [2023-08-03 21:30:19,300 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1921 transitions. [2023-08-03 21:30:19,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1921 transitions. [2023-08-03 21:30:19,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:30:19,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1921 transitions. [2023-08-03 21:30:19,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 160.08333333333334) internal successors, (1921), 12 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:19,308 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 21:30:19,309 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 21:30:19,309 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 12 states and 1921 transitions. [2023-08-03 21:30:19,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 199 flow [2023-08-03 21:30:19,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 185 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-03 21:30:19,311 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 171 flow [2023-08-03 21:30:19,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=171, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2023-08-03 21:30:19,311 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-08-03 21:30:19,311 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 171 flow [2023-08-03 21:30:19,312 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 21:30:19,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:30:19,312 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-03 21:30:19,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-03 21:30:19,517 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 21:30:19,517 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:30:19,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:30:19,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1854023505, now seen corresponding path program 3 times [2023-08-03 21:30:19,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:30:19,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87183627] [2023-08-03 21:30:19,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:19,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:30:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:30:19,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 21:30:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:30:19,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 21:30:19,582 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 21:30:19,583 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-03 21:30:19,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-03 21:30:19,584 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-03 21:30:19,585 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (1/2) [2023-08-03 21:30:19,586 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 21:30:19,586 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 21:30:19,614 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-03 21:30:19,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 266 transitions, 550 flow [2023-08-03 21:30:19,647 INFO L124 PetriNetUnfolderBase]: 75/430 cut-off events. [2023-08-03 21:30:19,647 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 21:30:19,649 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 21:30:19,649 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 266 transitions, 550 flow [2023-08-03 21:30:19,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 266 transitions, 550 flow [2023-08-03 21:30:19,651 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:30:19,652 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 266 transitions, 550 flow [2023-08-03 21:30:19,652 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 266 transitions, 550 flow [2023-08-03 21:30:19,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 266 transitions, 550 flow [2023-08-03 21:30:19,680 INFO L124 PetriNetUnfolderBase]: 75/430 cut-off events. [2023-08-03 21:30:19,680 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 21:30:19,681 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 21:30:19,693 INFO L119 LiptonReduction]: Number of co-enabled transitions 33228 [2023-08-03 21:30:22,273 INFO L134 LiptonReduction]: Checked pairs total: 56804 [2023-08-03 21:30:22,273 INFO L136 LiptonReduction]: Total number of compositions: 219 [2023-08-03 21:30:22,274 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 21:30:22,275 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;@2a8c6ef7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:30:22,275 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-03 21:30:22,279 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:30:22,280 INFO L124 PetriNetUnfolderBase]: 36/108 cut-off events. [2023-08-03 21:30:22,280 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-03 21:30:22,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:30:22,280 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 21:30:22,280 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:30:22,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:30:22,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1388603768, now seen corresponding path program 1 times [2023-08-03 21:30:22,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:30:22,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344972768] [2023-08-03 21:30:22,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:22,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:30:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:30:22,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:30:22,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344972768] [2023-08-03 21:30:22,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344972768] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:30:22,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:30:22,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:30:22,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323879144] [2023-08-03 21:30:22,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:30:22,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:30:22,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:30:22,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:30:22,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:30:22,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 485 [2023-08-03 21:30:22,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 101 transitions, 220 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 21:30:22,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:30:22,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 485 [2023-08-03 21:30:22,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:30:23,226 INFO L124 PetriNetUnfolderBase]: 10559/16533 cut-off events. [2023-08-03 21:30:23,227 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-08-03 21:30:23,240 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 21:30:23,257 INFO L140 encePairwiseOnDemand]: 450/485 looper letters, 38 selfloop transitions, 2 changer transitions 23/70 dead transitions. [2023-08-03 21:30:23,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 274 flow [2023-08-03 21:30:23,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:30:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:30:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2023-08-03 21:30:23,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079037800687285 [2023-08-03 21:30:23,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 739 transitions. [2023-08-03 21:30:23,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 739 transitions. [2023-08-03 21:30:23,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:30:23,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 739 transitions. [2023-08-03 21:30:23,260 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 21:30:23,261 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 21:30:23,262 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 21:30:23,262 INFO L175 Difference]: Start difference. First operand has 68 places, 101 transitions, 220 flow. Second operand 3 states and 739 transitions. [2023-08-03 21:30:23,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 274 flow [2023-08-03 21:30:23,263 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 21:30:23,264 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 116 flow [2023-08-03 21:30:23,264 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=116, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2023-08-03 21:30:23,264 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-03 21:30:23,264 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 116 flow [2023-08-03 21:30:23,265 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 21:30:23,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:30:23,265 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-03 21:30:23,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-03 21:30:23,352 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:30:23,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:30:23,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1867853176, now seen corresponding path program 1 times [2023-08-03 21:30:23,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:30:23,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710346803] [2023-08-03 21:30:23,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:23,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:30:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:30:23,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:30:23,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710346803] [2023-08-03 21:30:23,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710346803] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:30:23,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114498420] [2023-08-03 21:30:23,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:23,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:30:23,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:30:23,386 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 21:30:23,388 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 21:30:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:23,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:30:23,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:30:23,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:30:23,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:30:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:30:23,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114498420] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:30:23,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:30:23,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-03 21:30:23,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613694309] [2023-08-03 21:30:23,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:30:23,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 21:30:23,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:30:23,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 21:30:23,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-03 21:30:23,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 485 [2023-08-03 21:30:23,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 47 transitions, 116 flow. Second operand has 7 states, 7 states have (on average 216.71428571428572) internal successors, (1517), 7 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:23,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:30:23,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 485 [2023-08-03 21:30:23,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:30:23,647 INFO L124 PetriNetUnfolderBase]: 1958/3219 cut-off events. [2023-08-03 21:30:23,647 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-08-03 21:30:23,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6300 conditions, 3219 events. 1958/3219 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 17560 event pairs, 1837 based on Foata normal form. 0/2639 useless extension candidates. Maximal degree in co-relation 6287. Up to 2999 conditions per place. [2023-08-03 21:30:23,656 INFO L140 encePairwiseOnDemand]: 482/485 looper letters, 38 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2023-08-03 21:30:23,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 214 flow [2023-08-03 21:30:23,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 21:30:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 21:30:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1336 transitions. [2023-08-03 21:30:23,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45910652920962197 [2023-08-03 21:30:23,713 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1336 transitions. [2023-08-03 21:30:23,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1336 transitions. [2023-08-03 21:30:23,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:30:23,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1336 transitions. [2023-08-03 21:30:23,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 222.66666666666666) internal successors, (1336), 6 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:23,718 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 21:30:23,719 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 21:30:23,719 INFO L175 Difference]: Start difference. First operand has 71 places, 47 transitions, 116 flow. Second operand 6 states and 1336 transitions. [2023-08-03 21:30:23,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 214 flow [2023-08-03 21:30:23,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 208 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-03 21:30:23,720 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 146 flow [2023-08-03 21:30:23,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-03 21:30:23,721 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2023-08-03 21:30:23,721 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 146 flow [2023-08-03 21:30:23,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 216.71428571428572) internal successors, (1517), 7 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:23,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:30:23,722 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 21:30:23,728 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 21:30:23,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:30:23,928 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:30:23,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:30:23,929 INFO L85 PathProgramCache]: Analyzing trace with hash -845271688, now seen corresponding path program 2 times [2023-08-03 21:30:23,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:30:23,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023306171] [2023-08-03 21:30:23,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:23,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:30:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:24,001 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 21:30:24,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:30:24,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023306171] [2023-08-03 21:30:24,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023306171] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:30:24,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141544827] [2023-08-03 21:30:24,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:30:24,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:30:24,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:30:24,003 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 21:30:24,005 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 21:30:24,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:30:24,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:30:24,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 21:30:24,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:30:24,085 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 21:30:24,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:30:24,124 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 21:30:24,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141544827] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:30:24,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:30:24,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-03 21:30:24,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962307809] [2023-08-03 21:30:24,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:30:24,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 21:30:24,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:30:24,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 21:30:24,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-03 21:30:24,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 485 [2023-08-03 21:30:24,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 146 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 21:30:24,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:30:24,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 485 [2023-08-03 21:30:24,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:30:24,433 INFO L124 PetriNetUnfolderBase]: 1958/3225 cut-off events. [2023-08-03 21:30:24,434 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-08-03 21:30:24,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6331 conditions, 3225 events. 1958/3225 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 17557 event pairs, 1837 based on Foata normal form. 6/2652 useless extension candidates. Maximal degree in co-relation 6272. Up to 2999 conditions per place. [2023-08-03 21:30:24,445 INFO L140 encePairwiseOnDemand]: 482/485 looper letters, 38 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2023-08-03 21:30:24,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 56 transitions, 280 flow [2023-08-03 21:30:24,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-03 21:30:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-03 21:30:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2635 transitions. [2023-08-03 21:30:24,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527491408934708 [2023-08-03 21:30:24,450 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2635 transitions. [2023-08-03 21:30:24,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2635 transitions. [2023-08-03 21:30:24,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:30:24,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2635 transitions. [2023-08-03 21:30:24,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 219.58333333333334) internal successors, (2635), 12 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:24,461 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 21:30:24,462 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 21:30:24,463 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 146 flow. Second operand 12 states and 2635 transitions. [2023-08-03 21:30:24,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 56 transitions, 280 flow [2023-08-03 21:30:24,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 56 transitions, 266 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-03 21:30:24,464 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 216 flow [2023-08-03 21:30:24,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=216, PETRI_PLACES=74, PETRI_TRANSITIONS=56} [2023-08-03 21:30:24,465 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2023-08-03 21:30:24,465 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 216 flow [2023-08-03 21:30:24,466 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 21:30:24,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:30:24,466 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 21:30:24,473 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 21:30:24,670 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 21:30:24,671 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:30:24,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:30:24,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1266609288, now seen corresponding path program 3 times [2023-08-03 21:30:24,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:30:24,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526075668] [2023-08-03 21:30:24,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:24,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:30:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:24,742 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 21:30:24,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:30:24,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526075668] [2023-08-03 21:30:24,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526075668] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:30:24,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943152701] [2023-08-03 21:30:24,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 21:30:24,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:30:24,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:30:24,744 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 21:30:24,773 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 21:30:24,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-03 21:30:24,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:30:24,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 21:30:24,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:30:24,843 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 21:30:24,843 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:30:24,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943152701] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:30:24,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:30:24,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 21:30:24,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121939374] [2023-08-03 21:30:24,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:30:24,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:30:24,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:30:24,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:30:24,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 21:30:24,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 485 [2023-08-03 21:30:24,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 56 transitions, 216 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 21:30:24,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:30:24,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 485 [2023-08-03 21:30:24,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:30:25,050 INFO L124 PetriNetUnfolderBase]: 1345/2296 cut-off events. [2023-08-03 21:30:25,050 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-08-03 21:30:25,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4637 conditions, 2296 events. 1345/2296 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 12461 event pairs, 0 based on Foata normal form. 0/2071 useless extension candidates. Maximal degree in co-relation 4560. Up to 1600 conditions per place. [2023-08-03 21:30:25,056 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 0 selfloop transitions, 0 changer transitions 106/106 dead transitions. [2023-08-03 21:30:25,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 106 transitions, 514 flow [2023-08-03 21:30:25,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:30:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:30:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1166 transitions. [2023-08-03 21:30:25,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808247422680412 [2023-08-03 21:30:25,059 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1166 transitions. [2023-08-03 21:30:25,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1166 transitions. [2023-08-03 21:30:25,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:30:25,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1166 transitions. [2023-08-03 21:30:25,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 233.2) internal successors, (1166), 5 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:25,064 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 21:30:25,064 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 21:30:25,064 INFO L175 Difference]: Start difference. First operand has 74 places, 56 transitions, 216 flow. Second operand 5 states and 1166 transitions. [2023-08-03 21:30:25,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 106 transitions, 514 flow [2023-08-03 21:30:25,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 106 transitions, 465 flow, removed 19 selfloop flow, removed 6 redundant places. [2023-08-03 21:30:25,068 INFO L231 Difference]: Finished difference. Result has 71 places, 0 transitions, 0 flow [2023-08-03 21:30:25,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=71, PETRI_TRANSITIONS=0} [2023-08-03 21:30:25,069 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-03 21:30:25,069 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 0 transitions, 0 flow [2023-08-03 21:30:25,069 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 21:30:25,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-03 21:30:25,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-03 21:30:25,274 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 21:30:25,274 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-03 21:30:25,275 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE (1/2) [2023-08-03 21:30:25,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 266 transitions, 550 flow [2023-08-03 21:30:25,303 INFO L124 PetriNetUnfolderBase]: 75/430 cut-off events. [2023-08-03 21:30:25,303 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 21:30:25,305 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 21:30:25,305 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 266 transitions, 550 flow [2023-08-03 21:30:25,307 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 266 transitions, 550 flow [2023-08-03 21:30:25,307 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:30:25,307 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 266 transitions, 550 flow [2023-08-03 21:30:25,307 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 266 transitions, 550 flow [2023-08-03 21:30:25,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 266 transitions, 550 flow [2023-08-03 21:30:25,334 INFO L124 PetriNetUnfolderBase]: 75/430 cut-off events. [2023-08-03 21:30:25,334 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 21:30:25,335 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 21:30:25,343 INFO L119 LiptonReduction]: Number of co-enabled transitions 33228 [2023-08-03 21:30:27,881 INFO L134 LiptonReduction]: Checked pairs total: 57613 [2023-08-03 21:30:27,881 INFO L136 LiptonReduction]: Total number of compositions: 220 [2023-08-03 21:30:27,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 21:30:27,882 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;@2a8c6ef7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:30:27,882 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 21:30:27,884 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:30:27,884 INFO L124 PetriNetUnfolderBase]: 7/25 cut-off events. [2023-08-03 21:30:27,884 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:30:27,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:30:27,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 21:30:27,884 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:30:27,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:30:27,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1284538660, now seen corresponding path program 1 times [2023-08-03 21:30:27,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:30:27,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231518504] [2023-08-03 21:30:27,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:27,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:30:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:27,912 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 21:30:27,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:30:27,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231518504] [2023-08-03 21:30:27,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231518504] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:30:27,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:30:27,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:30:27,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052762995] [2023-08-03 21:30:27,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:30:27,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:30:27,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:30:27,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:30:27,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:30:27,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 486 [2023-08-03 21:30:27,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 100 transitions, 218 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 21:30:27,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:30:27,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 486 [2023-08-03 21:30:27,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:30:28,668 INFO L124 PetriNetUnfolderBase]: 10521/16515 cut-off events. [2023-08-03 21:30:28,668 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-08-03 21:30:28,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32050 conditions, 16515 events. 10521/16515 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 109811 event pairs, 9818 based on Foata normal form. 2499/16448 useless extension candidates. Maximal degree in co-relation 13969. Up to 15431 conditions per place. [2023-08-03 21:30:28,708 INFO L140 encePairwiseOnDemand]: 452/486 looper letters, 56 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-03 21:30:28,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 274 flow [2023-08-03 21:30:28,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:30:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:30:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 738 transitions. [2023-08-03 21:30:28,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2023-08-03 21:30:28,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 738 transitions. [2023-08-03 21:30:28,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 738 transitions. [2023-08-03 21:30:28,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:30:28,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 738 transitions. [2023-08-03 21:30:28,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:28,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 486.0) internal successors, (1944), 4 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:28,713 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 486.0) internal successors, (1944), 4 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:28,713 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 218 flow. Second operand 3 states and 738 transitions. [2023-08-03 21:30:28,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 274 flow [2023-08-03 21:30:28,714 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 21:30:28,716 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-08-03 21:30:28,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=486, 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 21:30:28,717 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-03 21:30:28,718 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-08-03 21:30:28,718 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 21:30:28,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:30:28,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:30:28,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 21:30:28,718 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:30:28,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:30:28,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1847598989, now seen corresponding path program 1 times [2023-08-03 21:30:28,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:30:28,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982880406] [2023-08-03 21:30:28,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:28,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:30:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:28,738 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 21:30:28,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:30:28,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982880406] [2023-08-03 21:30:28,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982880406] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:30:28,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130627482] [2023-08-03 21:30:28,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:28,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:30:28,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:30:28,740 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 21:30:28,768 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 21:30:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:28,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 21:30:28,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:30:28,818 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 21:30:28,819 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:30:28,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130627482] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:30:28,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:30:28,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 21:30:28,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451687099] [2023-08-03 21:30:28,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:30:28,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:30:28,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:30:28,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:30:28,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:30:28,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 486 [2023-08-03 21:30:28,827 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 21:30:28,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:30:28,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 486 [2023-08-03 21:30:28,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:30:29,492 INFO L124 PetriNetUnfolderBase]: 10399/16491 cut-off events. [2023-08-03 21:30:29,493 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2023-08-03 21:30:29,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32041 conditions, 16491 events. 10399/16491 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 111875 event pairs, 4650 based on Foata normal form. 0/13963 useless extension candidates. Maximal degree in co-relation 32028. Up to 15399 conditions per place. [2023-08-03 21:30:29,545 INFO L140 encePairwiseOnDemand]: 483/486 looper letters, 74 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-08-03 21:30:29,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 356 flow [2023-08-03 21:30:29,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:30:29,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:30:29,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2023-08-03 21:30:29,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49657064471879286 [2023-08-03 21:30:29,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 724 transitions. [2023-08-03 21:30:29,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 724 transitions. [2023-08-03 21:30:29,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:30:29,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 724 transitions. [2023-08-03 21:30:29,549 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 21:30:29,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 486.0) internal successors, (1944), 4 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:29,551 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 486.0) internal successors, (1944), 4 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:29,551 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 168 flow. Second operand 3 states and 724 transitions. [2023-08-03 21:30:29,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 356 flow [2023-08-03 21:30:29,551 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 21:30:29,552 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-08-03 21:30:29,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=486, 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 21:30:29,553 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-03 21:30:29,553 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-08-03 21:30:29,553 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 21:30:29,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:30:29,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:30:29,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-03 21:30:29,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:30:29,757 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:30:29,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:30:29,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1867224605, now seen corresponding path program 1 times [2023-08-03 21:30:29,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:30:29,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178245569] [2023-08-03 21:30:29,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:29,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:30:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:29,781 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 21:30:29,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:30:29,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178245569] [2023-08-03 21:30:29,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178245569] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:30:29,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462987662] [2023-08-03 21:30:29,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:29,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:30:29,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:30:29,783 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 21:30:29,785 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 21:30:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:29,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:30:29,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:30:29,857 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 21:30:29,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:30:29,865 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 21:30:29,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462987662] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:30:29,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:30:29,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-03 21:30:29,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87305771] [2023-08-03 21:30:29,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:30:29,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 21:30:29,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:30:29,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 21:30:29,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-03 21:30:29,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 486 [2023-08-03 21:30:29,880 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 21:30:29,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:30:29,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 486 [2023-08-03 21:30:29,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:30:30,565 INFO L124 PetriNetUnfolderBase]: 10623/16504 cut-off events. [2023-08-03 21:30:30,565 INFO L125 PetriNetUnfolderBase]: For 685/685 co-relation queries the response was YES. [2023-08-03 21:30:30,581 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 569. Compared 108241 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 21:30:30,608 INFO L140 encePairwiseOnDemand]: 483/486 looper letters, 57 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-03 21:30:30,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 312 flow [2023-08-03 21:30:30,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 21:30:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 21:30:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1354 transitions. [2023-08-03 21:30:30,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46433470507544583 [2023-08-03 21:30:30,611 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1354 transitions. [2023-08-03 21:30:30,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1354 transitions. [2023-08-03 21:30:30,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:30:30,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1354 transitions. [2023-08-03 21:30:30,613 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 21:30:30,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 486.0) internal successors, (3402), 7 states have internal predecessors, (3402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:30,616 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 486.0) internal successors, (3402), 7 states have internal predecessors, (3402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:30,616 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 176 flow. Second operand 6 states and 1354 transitions. [2023-08-03 21:30:30,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 312 flow [2023-08-03 21:30:30,617 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 21:30:30,618 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-08-03 21:30:30,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=486, 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 21:30:30,618 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-08-03 21:30:30,618 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-08-03 21:30:30,619 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 21:30:30,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:30:30,619 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:30:30,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-03 21:30:30,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:30:30,823 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:30:30,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:30:30,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1674576890, now seen corresponding path program 2 times [2023-08-03 21:30:30,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:30:30,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133957780] [2023-08-03 21:30:30,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:30,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:30:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:30,875 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 21:30:30,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:30:30,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133957780] [2023-08-03 21:30:30,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133957780] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:30:30,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722510957] [2023-08-03 21:30:30,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:30:30,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:30:30,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:30:30,877 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 21:30:30,878 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 21:30:30,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-03 21:30:30,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:30:30,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-03 21:30:30,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:30:30,965 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 21:30:30,996 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:30:30,996 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 21:30:31,015 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 21:30:31,069 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 21:30:31,069 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:30:31,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722510957] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:30:31,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:30:31,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-03 21:30:31,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588297493] [2023-08-03 21:30:31,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:30:31,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-03 21:30:31,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:30:31,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-03 21:30:31,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-03 21:30:31,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 486 [2023-08-03 21:30:31,214 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 21:30:31,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:30:31,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 486 [2023-08-03 21:30:31,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:30:32,212 INFO L124 PetriNetUnfolderBase]: 10803/17023 cut-off events. [2023-08-03 21:30:32,212 INFO L125 PetriNetUnfolderBase]: For 685/685 co-relation queries the response was YES. [2023-08-03 21:30:32,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34001 conditions, 17023 events. 10803/17023 cut-off events. For 685/685 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 115409 event pairs, 2809 based on Foata normal form. 0/14991 useless extension candidates. Maximal degree in co-relation 33965. Up to 13003 conditions per place. [2023-08-03 21:30:32,254 INFO L140 encePairwiseOnDemand]: 476/486 looper letters, 123 selfloop transitions, 14 changer transitions 14/163 dead transitions. [2023-08-03 21:30:32,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 163 transitions, 721 flow [2023-08-03 21:30:32,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 21:30:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 21:30:32,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1388 transitions. [2023-08-03 21:30:32,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47599451303155005 [2023-08-03 21:30:32,257 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1388 transitions. [2023-08-03 21:30:32,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1388 transitions. [2023-08-03 21:30:32,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:30:32,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1388 transitions. [2023-08-03 21:30:32,259 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 21:30:32,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 486.0) internal successors, (3402), 7 states have internal predecessors, (3402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:32,262 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 486.0) internal successors, (3402), 7 states have internal predecessors, (3402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:32,262 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 210 flow. Second operand 6 states and 1388 transitions. [2023-08-03 21:30:32,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 163 transitions, 721 flow [2023-08-03 21:30:32,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 163 transitions, 707 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-03 21:30:32,265 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 293 flow [2023-08-03 21:30:32,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=486, 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=293, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2023-08-03 21:30:32,265 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 20 predicate places. [2023-08-03 21:30:32,265 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 293 flow [2023-08-03 21:30:32,265 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 21:30:32,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:30:32,266 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:30:32,270 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 21:30:32,470 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,SelfDestructingSolverStorable11 [2023-08-03 21:30:32,470 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:30:32,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:30:32,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1090130062, now seen corresponding path program 1 times [2023-08-03 21:30:32,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:30:32,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583046410] [2023-08-03 21:30:32,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:32,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:30:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-03 21:30:32,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:30:32,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583046410] [2023-08-03 21:30:32,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583046410] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:30:32,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484769325] [2023-08-03 21:30:32,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:32,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:30:32,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:30:32,516 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 21:30:32,517 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 21:30:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:32,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 21:30:32,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:30:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:30:32,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:30:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:30:32,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484769325] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:30:32,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:30:32,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-03 21:30:32,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770007059] [2023-08-03 21:30:32,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:30:32,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-03 21:30:32,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:30:32,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-03 21:30:32,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-03 21:30:32,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 486 [2023-08-03 21:30:32,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 293 flow. Second operand has 14 states, 14 states have (on average 213.35714285714286) internal successors, (2987), 14 states have internal predecessors, (2987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:32,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:30:32,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 486 [2023-08-03 21:30:32,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:30:33,622 INFO L124 PetriNetUnfolderBase]: 10542/17255 cut-off events. [2023-08-03 21:30:33,623 INFO L125 PetriNetUnfolderBase]: For 5243/5243 co-relation queries the response was YES. [2023-08-03 21:30:33,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37938 conditions, 17255 events. 10542/17255 cut-off events. For 5243/5243 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 122891 event pairs, 439 based on Foata normal form. 23/16322 useless extension candidates. Maximal degree in co-relation 37879. Up to 14555 conditions per place. [2023-08-03 21:30:33,677 INFO L140 encePairwiseOnDemand]: 480/486 looper letters, 117 selfloop transitions, 15 changer transitions 0/144 dead transitions. [2023-08-03 21:30:33,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 144 transitions, 735 flow [2023-08-03 21:30:33,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-03 21:30:33,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-03 21:30:33,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3077 transitions. [2023-08-03 21:30:33,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4522339800117578 [2023-08-03 21:30:33,683 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3077 transitions. [2023-08-03 21:30:33,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3077 transitions. [2023-08-03 21:30:33,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:30:33,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3077 transitions. [2023-08-03 21:30:33,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 219.78571428571428) internal successors, (3077), 14 states have internal predecessors, (3077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:33,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 486.0) internal successors, (7290), 15 states have internal predecessors, (7290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:33,694 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 486.0) internal successors, (7290), 15 states have internal predecessors, (7290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:33,694 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 293 flow. Second operand 14 states and 3077 transitions. [2023-08-03 21:30:33,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 144 transitions, 735 flow [2023-08-03 21:30:33,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 144 transitions, 735 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:30:33,703 INFO L231 Difference]: Finished difference. Result has 103 places, 93 transitions, 375 flow [2023-08-03 21:30:33,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=486, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=375, PETRI_PLACES=103, PETRI_TRANSITIONS=93} [2023-08-03 21:30:33,704 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 35 predicate places. [2023-08-03 21:30:33,704 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 93 transitions, 375 flow [2023-08-03 21:30:33,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 213.35714285714286) internal successors, (2987), 14 states have internal predecessors, (2987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:33,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:30:33,705 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 21:30:33,711 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 21:30:33,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-03 21:30:33,909 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:30:33,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:30:33,909 INFO L85 PathProgramCache]: Analyzing trace with hash 149520996, now seen corresponding path program 1 times [2023-08-03 21:30:33,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:30:33,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061851382] [2023-08-03 21:30:33,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:33,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:30:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:34,049 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 21:30:34,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:30:34,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061851382] [2023-08-03 21:30:34,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061851382] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:30:34,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:30:34,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 21:30:34,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315845217] [2023-08-03 21:30:34,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:30:34,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:30:34,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:30:34,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:30:34,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:30:34,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 486 [2023-08-03 21:30:34,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 93 transitions, 375 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 21:30:34,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:30:34,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 486 [2023-08-03 21:30:34,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:30:34,805 INFO L124 PetriNetUnfolderBase]: 5594/10272 cut-off events. [2023-08-03 21:30:34,806 INFO L125 PetriNetUnfolderBase]: For 5257/5257 co-relation queries the response was YES. [2023-08-03 21:30:34,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24406 conditions, 10272 events. 5594/10272 cut-off events. For 5257/5257 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 76308 event pairs, 2161 based on Foata normal form. 1470/10844 useless extension candidates. Maximal degree in co-relation 24332. Up to 5392 conditions per place. [2023-08-03 21:30:34,829 INFO L140 encePairwiseOnDemand]: 465/486 looper letters, 118 selfloop transitions, 21 changer transitions 2/151 dead transitions. [2023-08-03 21:30:34,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 151 transitions, 865 flow [2023-08-03 21:30:34,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:30:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:30:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 898 transitions. [2023-08-03 21:30:34,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4619341563786008 [2023-08-03 21:30:34,832 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 898 transitions. [2023-08-03 21:30:34,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 898 transitions. [2023-08-03 21:30:34,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:30:34,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 898 transitions. [2023-08-03 21:30:34,833 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 21:30:34,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 486.0) internal successors, (2430), 5 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:34,835 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 486.0) internal successors, (2430), 5 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:34,835 INFO L175 Difference]: Start difference. First operand has 103 places, 93 transitions, 375 flow. Second operand 4 states and 898 transitions. [2023-08-03 21:30:34,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 151 transitions, 865 flow [2023-08-03 21:30:34,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 151 transitions, 792 flow, removed 26 selfloop flow, removed 10 redundant places. [2023-08-03 21:30:34,846 INFO L231 Difference]: Finished difference. Result has 97 places, 104 transitions, 411 flow [2023-08-03 21:30:34,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=486, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=411, PETRI_PLACES=97, PETRI_TRANSITIONS=104} [2023-08-03 21:30:34,847 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 29 predicate places. [2023-08-03 21:30:34,847 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 104 transitions, 411 flow [2023-08-03 21:30:34,847 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 21:30:34,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:30:34,847 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 21:30:34,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-03 21:30:34,847 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:30:34,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:30:34,847 INFO L85 PathProgramCache]: Analyzing trace with hash 828567470, now seen corresponding path program 1 times [2023-08-03 21:30:34,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:30:34,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653847509] [2023-08-03 21:30:34,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:34,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:30:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 21:30:37,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:30:37,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653847509] [2023-08-03 21:30:37,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653847509] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:30:37,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696565784] [2023-08-03 21:30:37,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:37,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:30:37,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:30:37,079 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 21:30:37,083 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 21:30:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:37,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-03 21:30:37,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:30:37,181 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 21:30:37,259 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:30:37,259 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 21:30:37,287 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 21:30:37,311 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 21:30:37,340 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 21:30:37,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:30:37,384 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 19 treesize of output 21 [2023-08-03 21:30:37,401 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 21:30:37,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:30:37,448 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 19 treesize of output 21 [2023-08-03 21:30:37,509 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:30:37,510 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 25 treesize of output 11 [2023-08-03 21:30:37,566 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 21:30:37,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:30:37,716 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_458 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_133| Int)) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_133| 28))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_133| 1) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_458) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| (- 24))) 0)) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_133|) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_456) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2023-08-03 21:30:37,782 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:30:37,782 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 29 treesize of output 30 [2023-08-03 21:30:37,790 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:30:37,790 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 48 treesize of output 38 [2023-08-03 21:30:37,794 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 21:30:57,871 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_133| Int) (v_ArrVal_452 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_133| 1) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_133|) (forall ((v_ArrVal_456 Int) (|v_t_funThread1of2ForFork0_~i~0#1_133| Int) (|~#a~0.offset| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_452) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_133| 28) |~#a~0.offset|) v_ArrVal_456) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_133| 28) |~#a~0.offset|)) 0) (= |v_t_funThread1of2ForFork0_~i~0#1_133| |v_t_funThread2of2ForFork0_~i~0#1_133|)))))) is different from false [2023-08-03 21:31:01,733 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 21:31:01,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696565784] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:31:01,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:31:01,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7, 7] total 30 [2023-08-03 21:31:01,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781628104] [2023-08-03 21:31:01,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:31:01,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-03 21:31:01,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:31:01,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-03 21:31:01,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=654, Unknown=6, NotChecked=114, Total=992 [2023-08-03 21:31:02,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 486 [2023-08-03 21:31:02,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 104 transitions, 411 flow. Second operand has 32 states, 32 states have (on average 145.96875) internal successors, (4671), 32 states have internal predecessors, (4671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:31:02,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:31:02,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 486 [2023-08-03 21:31:02,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:31:05,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 [0] [2023-08-03 21:31:07,053 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 21:31:09,884 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 21:31:11,887 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 21:31:13,548 INFO L124 PetriNetUnfolderBase]: 7656/13910 cut-off events. [2023-08-03 21:31:13,549 INFO L125 PetriNetUnfolderBase]: For 8770/8798 co-relation queries the response was YES. [2023-08-03 21:31:13,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38705 conditions, 13910 events. 7656/13910 cut-off events. For 8770/8798 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 107462 event pairs, 803 based on Foata normal form. 13/12705 useless extension candidates. Maximal degree in co-relation 37574. Up to 7469 conditions per place. [2023-08-03 21:31:13,591 INFO L140 encePairwiseOnDemand]: 471/486 looper letters, 267 selfloop transitions, 85 changer transitions 102/463 dead transitions. [2023-08-03 21:31:13,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 463 transitions, 2698 flow [2023-08-03 21:31:13,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-03 21:31:13,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-03 21:31:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3853 transitions. [2023-08-03 21:31:13,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303326474622771 [2023-08-03 21:31:13,598 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3853 transitions. [2023-08-03 21:31:13,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3853 transitions. [2023-08-03 21:31:13,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:31:13,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3853 transitions. [2023-08-03 21:31:13,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 160.54166666666666) internal successors, (3853), 24 states have internal predecessors, (3853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:31:13,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 486.0) internal successors, (12150), 25 states have internal predecessors, (12150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:31:13,615 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 486.0) internal successors, (12150), 25 states have internal predecessors, (12150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:31:13,615 INFO L175 Difference]: Start difference. First operand has 97 places, 104 transitions, 411 flow. Second operand 24 states and 3853 transitions. [2023-08-03 21:31:13,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 463 transitions, 2698 flow [2023-08-03 21:31:13,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 463 transitions, 2697 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:31:13,630 INFO L231 Difference]: Finished difference. Result has 122 places, 167 transitions, 911 flow [2023-08-03 21:31:13,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=486, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=911, PETRI_PLACES=122, PETRI_TRANSITIONS=167} [2023-08-03 21:31:13,631 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 54 predicate places. [2023-08-03 21:31:13,631 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 167 transitions, 911 flow [2023-08-03 21:31:13,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 145.96875) internal successors, (4671), 32 states have internal predecessors, (4671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:31:13,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:31:13,632 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 21:31:13,636 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 21:31:13,836 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,SelfDestructingSolverStorable14 [2023-08-03 21:31:13,836 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:31:13,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:31:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1659523114, now seen corresponding path program 2 times [2023-08-03 21:31:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:31:13,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923187534] [2023-08-03 21:31:13,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:31:13,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:31:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:31:14,188 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 21:31:14,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:31:14,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923187534] [2023-08-03 21:31:14,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923187534] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:31:14,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085125181] [2023-08-03 21:31:14,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:31:14,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:31:14,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:31:14,190 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 21:31:14,192 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 21:31:14,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:31:14,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:31:14,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-03 21:31:14,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:31:14,300 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 21:31:14,389 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:31:14,389 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 21:31:14,411 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 21:31:14,439 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 21:31:14,468 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 21:31:14,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:31:14,508 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 19 treesize of output 21 [2023-08-03 21:31:14,550 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:31:14,550 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 25 treesize of output 11 [2023-08-03 21:31:14,575 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 21:31:14,611 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 21:31:14,611 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:31:14,732 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:31:14,732 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-03 21:31:14,734 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 48 treesize of output 30 [2023-08-03 21:31:14,741 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:31:14,741 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-03 21:31:14,743 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:31:14,748 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-03 21:31:14,748 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 12 [2023-08-03 21:31:28,788 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_135| Int) (v_ArrVal_539 (Array Int Int)) (|~#a~0.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_539) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_135| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-03 21:31:31,560 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 21:31:31,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085125181] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:31:31,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:31:31,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-08-03 21:31:31,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571216972] [2023-08-03 21:31:31,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:31:31,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-03 21:31:31,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:31:31,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-03 21:31:31,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=321, Unknown=3, NotChecked=38, Total=462 [2023-08-03 21:31:31,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 486 [2023-08-03 21:31:31,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 167 transitions, 911 flow. Second operand has 22 states, 22 states have (on average 149.22727272727272) internal successors, (3283), 22 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:31:31,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:31:31,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 486 [2023-08-03 21:31:31,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:31:41,940 WARN L233 SmtUtils]: Spent 10.08s on a formula simplification. DAG size of input: 32 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:31:43,955 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 21:31:45,980 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 21:31:48,001 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 21:31:49,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:31:50,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:31:52,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:31:54,069 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 21:31:55,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:31:56,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:31:59,406 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 21:32:00,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:02,909 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 21:32:05,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:06,672 INFO L124 PetriNetUnfolderBase]: 10598/19392 cut-off events. [2023-08-03 21:32:06,673 INFO L125 PetriNetUnfolderBase]: For 23868/23921 co-relation queries the response was YES. [2023-08-03 21:32:06,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60342 conditions, 19392 events. 10598/19392 cut-off events. For 23868/23921 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 160863 event pairs, 1797 based on Foata normal form. 56/17619 useless extension candidates. Maximal degree in co-relation 58885. Up to 8159 conditions per place. [2023-08-03 21:32:06,721 INFO L140 encePairwiseOnDemand]: 466/486 looper letters, 337 selfloop transitions, 122 changer transitions 141/609 dead transitions. [2023-08-03 21:32:06,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 609 transitions, 4029 flow [2023-08-03 21:32:06,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-03 21:32:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-03 21:32:06,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3861 transitions. [2023-08-03 21:32:06,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34541062801932365 [2023-08-03 21:32:06,726 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3861 transitions. [2023-08-03 21:32:06,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3861 transitions. [2023-08-03 21:32:06,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:32:06,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3861 transitions. [2023-08-03 21:32:06,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 167.8695652173913) internal successors, (3861), 23 states have internal predecessors, (3861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:06,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 486.0) internal successors, (11664), 24 states have internal predecessors, (11664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:06,741 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 486.0) internal successors, (11664), 24 states have internal predecessors, (11664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:06,741 INFO L175 Difference]: Start difference. First operand has 122 places, 167 transitions, 911 flow. Second operand 23 states and 3861 transitions. [2023-08-03 21:32:06,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 609 transitions, 4029 flow [2023-08-03 21:32:06,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 609 transitions, 4011 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-08-03 21:32:06,800 INFO L231 Difference]: Finished difference. Result has 147 places, 232 transitions, 1763 flow [2023-08-03 21:32:06,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=486, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1763, PETRI_PLACES=147, PETRI_TRANSITIONS=232} [2023-08-03 21:32:06,800 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 79 predicate places. [2023-08-03 21:32:06,800 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 232 transitions, 1763 flow [2023-08-03 21:32:06,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 149.22727272727272) internal successors, (3283), 22 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:06,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:32:06,801 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 21:32:06,806 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 21:32:07,004 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,SelfDestructingSolverStorable15 [2023-08-03 21:32:07,005 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:32:07,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:32:07,005 INFO L85 PathProgramCache]: Analyzing trace with hash -401642702, now seen corresponding path program 3 times [2023-08-03 21:32:07,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:32:07,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382280064] [2023-08-03 21:32:07,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:32:07,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:32:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:32:07,446 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 21:32:07,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:32:07,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382280064] [2023-08-03 21:32:07,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382280064] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:32:07,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339109344] [2023-08-03 21:32:07,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 21:32:07,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:32:07,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:32:07,448 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 21:32:07,453 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 21:32:07,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-03 21:32:07,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:32:07,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-03 21:32:07,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:32:07,557 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 21:32:07,641 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:32:07,641 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 21:32:07,657 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 21:32:07,687 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 21:32:07,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:32:07,731 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 19 treesize of output 21 [2023-08-03 21:32:07,752 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 21:32:07,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:32:07,790 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 19 treesize of output 21 [2023-08-03 21:32:07,821 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 20 treesize of output 22 [2023-08-03 21:32:07,881 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:32:07,881 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 25 treesize of output 11 [2023-08-03 21:32:07,929 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 21:32:07,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:32:08,168 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:32:08,168 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 29 treesize of output 30 [2023-08-03 21:32:08,178 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:32:08,178 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 48 treesize of output 38 [2023-08-03 21:32:08,183 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 21:32:10,230 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_137| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_137| 1) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_137|) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_137| Int) (v_ArrVal_629 Int) (|~#a~0.offset| Int) (v_ArrVal_631 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_137| 28) |~#a~0.offset|) v_ArrVal_629)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_631) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_137| 28) |~#a~0.offset|)) 0) (= |v_t_funThread1of2ForFork0_~i~0#1_137| |v_t_funThread2of2ForFork0_~i~0#1_137|))))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_137| Int) (|v_t_funThread1of2ForFork0_~i~0#1_137| Int) (v_ArrVal_629 Int) (|~#a~0.offset| Int) (v_ArrVal_631 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_137| 1) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_137|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_137| 28) |~#a~0.offset|) v_ArrVal_629)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_631) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_137| 28) |~#a~0.offset|)) 0)))))) is different from false [2023-08-03 21:32:12,316 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_624 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_137| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_137| 1) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_137|) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_137| Int) (v_ArrVal_629 Int) (|~#a~0.offset| Int) (v_ArrVal_631 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_624))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_137| 28) |~#a~0.offset|) v_ArrVal_629))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_631) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_137| 28) |~#a~0.offset|)) 0) (= |v_t_funThread1of2ForFork0_~i~0#1_137| |v_t_funThread2of2ForFork0_~i~0#1_137|))))) (or (forall ((v_ArrVal_624 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_137| Int) (|v_t_funThread1of2ForFork0_~i~0#1_137| Int) (v_ArrVal_629 Int) (|~#a~0.offset| Int) (v_ArrVal_631 (Array Int Int))) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_624))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_137| 28) |~#a~0.offset|) v_ArrVal_629))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_631) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_137| 28) |~#a~0.offset|)) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_137| 1) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_137|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-03 21:32:18,796 WARN L233 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:32:19,111 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 21:32:19,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339109344] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:32:19,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:32:19,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2023-08-03 21:32:19,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452661126] [2023-08-03 21:32:19,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:32:19,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-03 21:32:19,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:32:19,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-03 21:32:19,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=341, Unknown=5, NotChecked=82, Total=552 [2023-08-03 21:32:19,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 486 [2023-08-03 21:32:19,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 232 transitions, 1763 flow. Second operand has 24 states, 24 states have (on average 149.125) internal successors, (3579), 24 states have internal predecessors, (3579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:19,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:32:19,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 486 [2023-08-03 21:32:19,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:32:21,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 21:32:23,516 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 21:32:25,531 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 21:32:27,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 21:32:29,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 [0] [2023-08-03 21:32:31,596 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 21:32:33,238 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_137| Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_137| 28))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_137| 1) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_631) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_137|) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_630) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 (- 24))) 0))))) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_137| Int)) (let ((.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_137| 28))) (or (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse1 (- 24))) 0)) (< |v_t_funThread2of2ForFork0_~i~0#1_137| 1) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_137|) (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse1)) 0))))) is different from false [2023-08-03 21:32:35,278 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 21:32:36,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:38,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:40,354 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 21:32:42,435 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 21:32:45,658 INFO L124 PetriNetUnfolderBase]: 13160/24155 cut-off events. [2023-08-03 21:32:45,658 INFO L125 PetriNetUnfolderBase]: For 76976/77026 co-relation queries the response was YES. [2023-08-03 21:32:45,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91503 conditions, 24155 events. 13160/24155 cut-off events. For 76976/77026 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 208849 event pairs, 997 based on Foata normal form. 70/21983 useless extension candidates. Maximal degree in co-relation 89610. Up to 9730 conditions per place. [2023-08-03 21:32:45,759 INFO L140 encePairwiseOnDemand]: 452/486 looper letters, 432 selfloop transitions, 292 changer transitions 184/917 dead transitions. [2023-08-03 21:32:45,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 917 transitions, 8008 flow [2023-08-03 21:32:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-08-03 21:32:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-08-03 21:32:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5212 transitions. [2023-08-03 21:32:45,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3459445108190628 [2023-08-03 21:32:45,763 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 5212 transitions. [2023-08-03 21:32:45,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 5212 transitions. [2023-08-03 21:32:45,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:32:45,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 5212 transitions. [2023-08-03 21:32:45,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 168.1290322580645) internal successors, (5212), 31 states have internal predecessors, (5212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:45,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 486.0) internal successors, (15552), 32 states have internal predecessors, (15552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:45,779 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 486.0) internal successors, (15552), 32 states have internal predecessors, (15552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:45,779 INFO L175 Difference]: Start difference. First operand has 147 places, 232 transitions, 1763 flow. Second operand 31 states and 5212 transitions. [2023-08-03 21:32:45,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 917 transitions, 8008 flow [2023-08-03 21:32:46,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 917 transitions, 7930 flow, removed 38 selfloop flow, removed 1 redundant places. [2023-08-03 21:32:46,066 INFO L231 Difference]: Finished difference. Result has 192 places, 420 transitions, 4488 flow [2023-08-03 21:32:46,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=486, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=4488, PETRI_PLACES=192, PETRI_TRANSITIONS=420} [2023-08-03 21:32:46,067 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 124 predicate places. [2023-08-03 21:32:46,067 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 420 transitions, 4488 flow [2023-08-03 21:32:46,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 149.125) internal successors, (3579), 24 states have internal predecessors, (3579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:46,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:32:46,068 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 21:32:46,072 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 21:32:46,268 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,SelfDestructingSolverStorable16 [2023-08-03 21:32:46,269 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:32:46,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:32:46,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1309389777, now seen corresponding path program 1 times [2023-08-03 21:32:46,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:32:46,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661947457] [2023-08-03 21:32:46,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:32:46,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:32:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:32:46,504 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 21:32:46,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:32:46,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661947457] [2023-08-03 21:32:46,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661947457] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:32:46,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935655169] [2023-08-03 21:32:46,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:32:46,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:32:46,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:32:46,517 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 21:32:46,519 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 21:32:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:32:46,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-03 21:32:46,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:32:46,631 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 21:32:46,691 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:32:46,691 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 21:32:46,706 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 21:32:46,726 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 21:32:46,745 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 21:32:46,777 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:32:46,777 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 25 treesize of output 11 [2023-08-03 21:32:46,829 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 21:32:46,872 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 21:32:46,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:32:46,968 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 21 treesize of output 19 [2023-08-03 21:32:46,972 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 15 treesize of output 8 [2023-08-03 21:32:53,000 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_712 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_139| Int) (|~#a~0.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_712) |c_~#a~0.base|) (+ |~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_139| 28))) 0)) is different from false [2023-08-03 21:32:53,079 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 21:32:53,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935655169] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:32:53,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:32:53,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-03 21:32:53,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373137041] [2023-08-03 21:32:53,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:32:53,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-03 21:32:53,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:32:53,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-03 21:32:53,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=171, Unknown=3, NotChecked=28, Total=272 [2023-08-03 21:32:53,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 486 [2023-08-03 21:32:53,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 420 transitions, 4488 flow. Second operand has 17 states, 17 states have (on average 152.64705882352942) internal successors, (2595), 17 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:53,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:32:53,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 486 [2023-08-03 21:32:53,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:33:05,309 WARN L233 SmtUtils]: Spent 12.11s on a formula simplification. DAG size of input: 27 DAG size of output: 22 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:33:07,326 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 21:33:09,348 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 21:33:17,800 INFO L124 PetriNetUnfolderBase]: 15099/27903 cut-off events. [2023-08-03 21:33:17,800 INFO L125 PetriNetUnfolderBase]: For 281318/281443 co-relation queries the response was YES. [2023-08-03 21:33:17,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150765 conditions, 27903 events. 15099/27903 cut-off events. For 281318/281443 co-relation queries the response was YES. Maximal size of possible extension queue 1195. Compared 248600 event pairs, 3472 based on Foata normal form. 53/27194 useless extension candidates. Maximal degree in co-relation 147463. Up to 15555 conditions per place. [2023-08-03 21:33:17,959 INFO L140 encePairwiseOnDemand]: 466/486 looper letters, 533 selfloop transitions, 95 changer transitions 134/771 dead transitions. [2023-08-03 21:33:17,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 771 transitions, 9209 flow [2023-08-03 21:33:17,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-03 21:33:17,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-03 21:33:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2777 transitions. [2023-08-03 21:33:17,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35712448559670784 [2023-08-03 21:33:17,962 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2777 transitions. [2023-08-03 21:33:17,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2777 transitions. [2023-08-03 21:33:17,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:33:17,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2777 transitions. [2023-08-03 21:33:17,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 173.5625) internal successors, (2777), 16 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:17,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 486.0) internal successors, (8262), 17 states have internal predecessors, (8262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:17,969 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 486.0) internal successors, (8262), 17 states have internal predecessors, (8262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:17,969 INFO L175 Difference]: Start difference. First operand has 192 places, 420 transitions, 4488 flow. Second operand 16 states and 2777 transitions. [2023-08-03 21:33:17,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 771 transitions, 9209 flow [2023-08-03 21:33:18,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 771 transitions, 8539 flow, removed 241 selfloop flow, removed 10 redundant places. [2023-08-03 21:33:18,919 INFO L231 Difference]: Finished difference. Result has 205 places, 454 transitions, 4692 flow [2023-08-03 21:33:18,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=486, PETRI_DIFFERENCE_MINUEND_FLOW=3901, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4692, PETRI_PLACES=205, PETRI_TRANSITIONS=454} [2023-08-03 21:33:18,920 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 137 predicate places. [2023-08-03 21:33:18,920 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 454 transitions, 4692 flow [2023-08-03 21:33:18,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 152.64705882352942) internal successors, (2595), 17 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:18,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:33:18,921 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 21:33:18,925 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 21:33:19,121 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,SelfDestructingSolverStorable17 [2023-08-03 21:33:19,121 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:33:19,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:33:19,121 INFO L85 PathProgramCache]: Analyzing trace with hash 753015628, now seen corresponding path program 4 times [2023-08-03 21:33:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:33:19,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862860220] [2023-08-03 21:33:19,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:19,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:33:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:19,491 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 21:33:19,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:33:19,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862860220] [2023-08-03 21:33:19,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862860220] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:33:19,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329941181] [2023-08-03 21:33:19,491 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-03 21:33:19,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:33:19,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:33:19,492 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 21:33:19,494 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 21:33:19,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-03 21:33:19,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:33:19,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-03 21:33:19,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:33:19,610 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 21:33:19,668 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:33:19,668 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 21:33:19,685 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 21:33:19,704 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 21:33:19,721 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 21:33:19,747 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:33:19,748 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 21:33:19,780 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 21:33:19,812 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 21:33:19,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:33:19,874 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 21 treesize of output 19 [2023-08-03 21:33:19,877 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 15 treesize of output 8 [2023-08-03 21:33:29,909 WARN L839 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (v_ArrVal_797 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_141| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_797) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_141| 28) |~#a~0.offset|)) 0)) is different from false [2023-08-03 21:33:29,982 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 21:33:29,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329941181] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:33:29,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:33:29,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-03 21:33:29,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745550425] [2023-08-03 21:33:29,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:33:29,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-03 21:33:29,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:33:29,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-03 21:33:29,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=171, Unknown=3, NotChecked=28, Total=272 [2023-08-03 21:33:30,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 486 [2023-08-03 21:33:30,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 454 transitions, 4692 flow. Second operand has 17 states, 17 states have (on average 152.64705882352942) internal successors, (2595), 17 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:30,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:33:30,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 486 [2023-08-03 21:33:30,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:33:34,967 INFO L124 PetriNetUnfolderBase]: 16485/30698 cut-off events. [2023-08-03 21:33:34,967 INFO L125 PetriNetUnfolderBase]: For 364964/365056 co-relation queries the response was YES. [2023-08-03 21:33:35,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170099 conditions, 30698 events. 16485/30698 cut-off events. For 364964/365056 co-relation queries the response was YES. Maximal size of possible extension queue 1352. Compared 279614 event pairs, 3980 based on Foata normal form. 61/29966 useless extension candidates. Maximal degree in co-relation 166740. Up to 17951 conditions per place. [2023-08-03 21:33:35,132 INFO L140 encePairwiseOnDemand]: 469/486 looper letters, 574 selfloop transitions, 107 changer transitions 137/827 dead transitions. [2023-08-03 21:33:35,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 827 transitions, 10141 flow [2023-08-03 21:33:35,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-03 21:33:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-03 21:33:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2284 transitions. [2023-08-03 21:33:35,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3615068059512504 [2023-08-03 21:33:35,135 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2284 transitions. [2023-08-03 21:33:35,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2284 transitions. [2023-08-03 21:33:35,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:33:35,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2284 transitions. [2023-08-03 21:33:35,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 175.69230769230768) internal successors, (2284), 13 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:35,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 486.0) internal successors, (6804), 14 states have internal predecessors, (6804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:35,140 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 486.0) internal successors, (6804), 14 states have internal predecessors, (6804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:35,140 INFO L175 Difference]: Start difference. First operand has 205 places, 454 transitions, 4692 flow. Second operand 13 states and 2284 transitions. [2023-08-03 21:33:35,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 827 transitions, 10141 flow [2023-08-03 21:33:36,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 827 transitions, 9964 flow, removed 66 selfloop flow, removed 6 redundant places. [2023-08-03 21:33:36,420 INFO L231 Difference]: Finished difference. Result has 214 places, 488 transitions, 5391 flow [2023-08-03 21:33:36,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=486, PETRI_DIFFERENCE_MINUEND_FLOW=4570, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5391, PETRI_PLACES=214, PETRI_TRANSITIONS=488} [2023-08-03 21:33:36,421 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 146 predicate places. [2023-08-03 21:33:36,421 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 488 transitions, 5391 flow [2023-08-03 21:33:36,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 152.64705882352942) internal successors, (2595), 17 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:36,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:33:36,421 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 21:33:36,426 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 21:33:36,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:33:36,622 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:33:36,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:33:36,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1814484109, now seen corresponding path program 2 times [2023-08-03 21:33:36,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:33:36,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165930591] [2023-08-03 21:33:36,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:36,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:33:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:36,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 21:33:36,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:33:36,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165930591] [2023-08-03 21:33:36,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165930591] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:33:36,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39697805] [2023-08-03 21:33:36,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:33:36,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:33:36,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:33:36,984 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 21:33:36,986 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 21:33:37,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:33:37,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:33:37,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-03 21:33:37,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:33:37,110 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 21:33:37,206 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:33:37,206 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 21:33:37,229 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 21:33:37,256 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 21:33:37,288 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 21:33:37,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:33:37,325 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 19 treesize of output 21 [2023-08-03 21:33:37,358 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:33:37,359 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 25 treesize of output 11 [2023-08-03 21:33:37,385 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 21:33:37,424 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 21:33:37,424 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:33:37,492 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_885 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_885) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) (- 24))) 0))) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_143| Int) (v_ArrVal_885 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_143| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_885) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| (- 24))) 0)) (= 0 (select (select |c_#memory_int| |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|))))))) is different from false [2023-08-03 21:33:37,513 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:33:37,514 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 29 treesize of output 30 [2023-08-03 21:33:37,520 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:33:37,521 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 48 treesize of output 38 [2023-08-03 21:33:37,524 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 21:33:37,539 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:33:37,539 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 29 treesize of output 30 [2023-08-03 21:33:37,543 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 48 treesize of output 30 [2023-08-03 21:33:47,589 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_143| Int) (v_ArrVal_882 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_882) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_143| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-03 21:33:50,727 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 21:33:50,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39697805] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:33:50,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:33:50,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-08-03 21:33:50,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286943618] [2023-08-03 21:33:50,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:33:50,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-03 21:33:50,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:33:50,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-03 21:33:50,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=287, Unknown=4, NotChecked=74, Total=462 [2023-08-03 21:33:50,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 486 [2023-08-03 21:33:50,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 488 transitions, 5391 flow. Second operand has 22 states, 22 states have (on average 149.22727272727272) internal successors, (3283), 22 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:50,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:33:50,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 486 [2023-08-03 21:33:50,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:33:56,808 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 32 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:33:59,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:34:00,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 21:34:02,725 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 21:34:04,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 21:34:10,280 INFO L124 PetriNetUnfolderBase]: 18192/34133 cut-off events. [2023-08-03 21:34:10,280 INFO L125 PetriNetUnfolderBase]: For 430812/430979 co-relation queries the response was YES. [2023-08-03 21:34:10,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191486 conditions, 34133 events. 18192/34133 cut-off events. For 430812/430979 co-relation queries the response was YES. Maximal size of possible extension queue 1507. Compared 319191 event pairs, 3769 based on Foata normal form. 63/33247 useless extension candidates. Maximal degree in co-relation 188534. Up to 18954 conditions per place. [2023-08-03 21:34:10,510 INFO L140 encePairwiseOnDemand]: 465/486 looper letters, 583 selfloop transitions, 138 changer transitions 165/895 dead transitions. [2023-08-03 21:34:10,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 895 transitions, 11410 flow [2023-08-03 21:34:10,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-03 21:34:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-03 21:34:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3534 transitions. [2023-08-03 21:34:10,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3462669018224574 [2023-08-03 21:34:10,514 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3534 transitions. [2023-08-03 21:34:10,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3534 transitions. [2023-08-03 21:34:10,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:34:10,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3534 transitions. [2023-08-03 21:34:10,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 168.28571428571428) internal successors, (3534), 21 states have internal predecessors, (3534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:10,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 486.0) internal successors, (10692), 22 states have internal predecessors, (10692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:10,524 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 486.0) internal successors, (10692), 22 states have internal predecessors, (10692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:10,524 INFO L175 Difference]: Start difference. First operand has 214 places, 488 transitions, 5391 flow. Second operand 21 states and 3534 transitions. [2023-08-03 21:34:10,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 895 transitions, 11410 flow [2023-08-03 21:34:11,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 895 transitions, 11300 flow, removed 50 selfloop flow, removed 1 redundant places. [2023-08-03 21:34:11,965 INFO L231 Difference]: Finished difference. Result has 245 places, 520 transitions, 6454 flow [2023-08-03 21:34:11,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=486, PETRI_DIFFERENCE_MINUEND_FLOW=5334, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=6454, PETRI_PLACES=245, PETRI_TRANSITIONS=520} [2023-08-03 21:34:11,966 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 177 predicate places. [2023-08-03 21:34:11,966 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 520 transitions, 6454 flow [2023-08-03 21:34:11,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 149.22727272727272) internal successors, (3283), 22 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:11,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:34:11,966 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 21:34:11,971 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 21:34:12,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:34:12,167 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:34:12,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:34:12,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1678417293, now seen corresponding path program 3 times [2023-08-03 21:34:12,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:34:12,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117929861] [2023-08-03 21:34:12,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:34:12,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:34:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:34:12,463 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 21:34:12,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:34:12,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117929861] [2023-08-03 21:34:12,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117929861] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:34:12,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492473839] [2023-08-03 21:34:12,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 21:34:12,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:34:12,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:34:12,465 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 21:34:12,469 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 21:34:12,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-03 21:34:12,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:34:12,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-03 21:34:12,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:34:12,585 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 21:34:12,674 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:34:12,674 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 21:34:12,824 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 21:34:12,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 13 treesize of output 15 [2023-08-03 21:34:12,865 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 21:34:12,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:34:12,898 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 19 treesize of output 21 [2023-08-03 21:34:12,917 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 21:34:12,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:34:12,957 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 19 treesize of output 21 [2023-08-03 21:34:12,993 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:34:12,994 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 25 treesize of output 11 [2023-08-03 21:34:13,033 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 21:34:13,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:34:13,149 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:34:13,150 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 29 treesize of output 30 [2023-08-03 21:34:13,158 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:34:13,158 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 48 treesize of output 38 [2023-08-03 21:34:13,163 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 21:34:15,225 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_968 (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_968) |c_~#a~0.base|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-03 21:34:18,068 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 21:34:18,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492473839] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:34:18,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:34:18,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-03 21:34:18,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349757159] [2023-08-03 21:34:18,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:34:18,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-03 21:34:18,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:34:18,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-03 21:34:18,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=265, Unknown=2, NotChecked=36, Total=420 [2023-08-03 21:34:18,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 486 [2023-08-03 21:34:18,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 520 transitions, 6454 flow. Second operand has 21 states, 21 states have (on average 151.38095238095238) internal successors, (3179), 21 states have internal predecessors, (3179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:18,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:34:18,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 486 [2023-08-03 21:34:18,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:34:20,397 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 21:34:22,406 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 21:34:23,295 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((v_ArrVal_973 Int) (v_ArrVal_974 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_145| Int)) (let ((.cse1 (* |v_t_funThread1of2ForFork0_~i~0#1_145| 28))) (or (= (select (store .cse0 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_973) (+ .cse1 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_974) |c_~#a~0.base|) (+ .cse1 |c_~#a~0.offset| (- 24))) 0))))) (forall ((v_ArrVal_974 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_145| Int)) (let ((.cse2 (* |v_t_funThread1of2ForFork0_~i~0#1_145| 28))) (or (= (select .cse0 (+ .cse2 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_974) |c_~#a~0.base|) (+ .cse2 |c_~#a~0.offset| (- 24))) 0))))))) is different from false [2023-08-03 21:34:29,677 INFO L124 PetriNetUnfolderBase]: 18689/35399 cut-off events. [2023-08-03 21:34:29,677 INFO L125 PetriNetUnfolderBase]: For 443024/443233 co-relation queries the response was YES. [2023-08-03 21:34:29,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203509 conditions, 35399 events. 18689/35399 cut-off events. For 443024/443233 co-relation queries the response was YES. Maximal size of possible extension queue 1631. Compared 336134 event pairs, 3947 based on Foata normal form. 56/34405 useless extension candidates. Maximal degree in co-relation 200504. Up to 20029 conditions per place. [2023-08-03 21:34:29,950 INFO L140 encePairwiseOnDemand]: 456/486 looper letters, 545 selfloop transitions, 182 changer transitions 100/836 dead transitions. [2023-08-03 21:34:29,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 836 transitions, 11453 flow [2023-08-03 21:34:29,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-03 21:34:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-03 21:34:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2304 transitions. [2023-08-03 21:34:29,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3646723646723647 [2023-08-03 21:34:29,953 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2304 transitions. [2023-08-03 21:34:29,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2304 transitions. [2023-08-03 21:34:29,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:34:29,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2304 transitions. [2023-08-03 21:34:29,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 177.23076923076923) internal successors, (2304), 13 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:29,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 486.0) internal successors, (6804), 14 states have internal predecessors, (6804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:29,959 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 486.0) internal successors, (6804), 14 states have internal predecessors, (6804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:29,959 INFO L175 Difference]: Start difference. First operand has 245 places, 520 transitions, 6454 flow. Second operand 13 states and 2304 transitions. [2023-08-03 21:34:29,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 836 transitions, 11453 flow [2023-08-03 21:34:33,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 836 transitions, 11042 flow, removed 192 selfloop flow, removed 3 redundant places. [2023-08-03 21:34:33,040 INFO L231 Difference]: Finished difference. Result has 256 places, 569 transitions, 7586 flow [2023-08-03 21:34:33,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=486, PETRI_DIFFERENCE_MINUEND_FLOW=6153, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7586, PETRI_PLACES=256, PETRI_TRANSITIONS=569} [2023-08-03 21:34:33,040 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 188 predicate places. [2023-08-03 21:34:33,040 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 569 transitions, 7586 flow [2023-08-03 21:34:33,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 151.38095238095238) internal successors, (3179), 21 states have internal predecessors, (3179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:33,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:34:33,041 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 21:34:33,047 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 21:34:33,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:34:33,241 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:34:33,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:34:33,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1267804302, now seen corresponding path program 1 times [2023-08-03 21:34:33,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:34:33,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373861104] [2023-08-03 21:34:33,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:34:33,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:34:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:34:33,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 21:34:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:34:33,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 21:34:33,274 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 21:34:33,274 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-03 21:34:33,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 21:34:33,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-03 21:34:33,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-03 21:34:33,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-03 21:34:33,274 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1] [2023-08-03 21:34:33,275 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-08-03 21:34:33,277 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 21:34:33,277 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 21:34:33,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 09:34:33 BasicIcfg [2023-08-03 21:34:33,315 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 21:34:33,315 INFO L158 Benchmark]: Toolchain (without parser) took 258375.48ms. Allocated memory was 530.6MB in the beginning and 3.3GB in the end (delta: 2.7GB). Free memory was 486.8MB in the beginning and 2.1GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-03 21:34:33,315 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 343.9MB. Free memory is still 293.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 21:34:33,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.67ms. Allocated memory is still 530.6MB. Free memory was 486.5MB in the beginning and 457.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-03 21:34:33,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.93ms. Allocated memory is still 530.6MB. Free memory was 457.1MB in the beginning and 454.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 21:34:33,316 INFO L158 Benchmark]: Boogie Preprocessor took 24.57ms. Allocated memory is still 530.6MB. Free memory was 454.4MB in the beginning and 452.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 21:34:33,316 INFO L158 Benchmark]: RCFGBuilder took 454.53ms. Allocated memory is still 530.6MB. Free memory was 452.3MB in the beginning and 493.0MB in the end (delta: -40.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 21:34:33,316 INFO L158 Benchmark]: TraceAbstraction took 257467.09ms. Allocated memory was 530.6MB in the beginning and 3.3GB in the end (delta: 2.7GB). Free memory was 493.0MB in the beginning and 2.1GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-03 21:34:33,317 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 343.9MB. Free memory is still 293.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 394.67ms. Allocated memory is still 530.6MB. Free memory was 486.5MB in the beginning and 457.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 30.93ms. Allocated memory is still 530.6MB. Free memory was 457.1MB in the beginning and 454.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.57ms. Allocated memory is still 530.6MB. Free memory was 454.4MB in the beginning and 452.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 454.53ms. Allocated memory is still 530.6MB. Free memory was 452.3MB in the beginning and 493.0MB in the end (delta: -40.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 257467.09ms. Allocated memory was 530.6MB in the beginning and 3.3GB in the end (delta: 2.7GB). Free memory was 493.0MB in the beginning and 2.1GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. 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.2s, 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: 2.6s, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 226 PlacesBefore, 68 PlacesAfterwards, 266 TransitionsBefore, 100 TransitionsAfterwards, 33228 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 141 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 31 ConcurrentYvCompositions, 8 ChoiceCompositions, 220 TotalNumberOfCompositions, 57613 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 27336, independent: 26891, independent conditional: 0, independent unconditional: 26891, dependent: 445, dependent conditional: 0, dependent unconditional: 445, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 16337, independent: 16238, independent conditional: 0, independent unconditional: 16238, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27336, independent: 10653, independent conditional: 0, independent unconditional: 10653, dependent: 346, dependent conditional: 0, dependent unconditional: 346, unknown: 16337, unknown conditional: 0, unknown unconditional: 16337] , Statistics on independence cache: Total cache size (in pairs): 496, Positive cache size: 452, Positive conditional cache size: 0, Positive unconditional cache size: 452, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 929]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L934] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L935-L938] 0 struct s { int datum; pthread_mutex_t mutex; } a[10]; [L950] 0 int i = 0; VAL [__global_lock={3:0}, a={4:0}, i=0] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=1] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=2] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=3] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=4] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=5] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=6] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=7] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=8] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=9] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=10] [L950] COND FALSE 0 !(i < 10) [L952] 0 int i = __VERIFIER_nondet_int(); [L953] CALL 0 assume_abort_if_not(0 <= i && i < 10) [L932] COND FALSE 0 !(!cond) [L953] RET 0 assume_abort_if_not(0 <= i && i < 10) [L954] 0 pthread_t t_ids[2]; [L954] 0 int i=0; VAL [__global_lock={3:0}, a={4:0}, i=0, i=10, i=9, t_ids={5:0}] [L954] COND TRUE 0 i<2 [L954] FCALL, FORK 0 pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0)) VAL [__global_lock={3:0}, a={4:0}, i=0, i=10, i=9, pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0))=6, t_ids={5:0}] [L954] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=1, i=10, i=9, t_ids={5:0}] [L954] COND TRUE 0 i<2 [L940] 1 int i = __VERIFIER_nondet_int(); [L941] CALL 1 assume_abort_if_not(0 <= i && i < 9) [L932] COND FALSE 1 !(!cond) [L941] RET 1 assume_abort_if_not(0 <= i && i < 9) [L942] 1 struct s *p = &a[i]; [L944] 1 i++ VAL [__global_lock={3:0}, a={4:0}, arg={0:0}, arg={0:0}, i=9, p={4:224}] [L945] COND TRUE 1 __VERIFIER_nondet_int() [L954] FCALL, FORK 0 pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0)) VAL [__global_lock={3:0}, a={4:0}, i=1, i=10, i=9, pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0))=7, t_ids={5:0}] [L954] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=10, i=2, i=9, t_ids={5:0}] [L945] EXPR 1 a[i].datum [L945] 1 (a[i].datum)++ VAL [(a[i].datum)++=0, __global_lock={3:0}, a={4:0}, a[i].datum=0, arg={0:0}, arg={0:0}, i=9, p={4:224}] [L954] COND FALSE 0 !(i<2) [L956] COND FALSE 0 !(__VERIFIER_nondet_int()) [L945] 1 (a[i].datum)++ [L956] EXPR 0 a[i].datum [L956] CALL 0 __VERIFIER_assert((a[i].datum) == 0) [L929] COND TRUE 0 !(cond) [L929] 0 reach_error() VAL [\old(cond)=0, __global_lock={3:0}, a={4:0}, cond=0] - UnprovableResult [Line: 929]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency 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: 3.7s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 326 IncrementalHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 2 mSDtfsCounter, 326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=3, InterpolantAutomatonStates: 21, 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.3s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 14/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 for thread instance sufficiency 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: 5.7s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 676 IncrementalHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 9 mSDtfsCounter, 676 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=0, InterpolantAutomatonStates: 26, 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.2s InterpolantComputationTime, 114 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 177/215 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 1 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: 248.0s, OverallIterations: 14, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 147.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 240 mSolverCounterUnknown, 5610 SdHoareTripleChecker+Valid, 77.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5417 mSDsluCounter, 749 SdHoareTripleChecker+Invalid, 75.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5409 IncrementalHoareTripleChecker+Unchecked, 721 mSDsCounter, 826 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12488 IncrementalHoareTripleChecker+Invalid, 18963 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 826 mSolverCounterUnsat, 28 mSDtfsCounter, 12488 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 674 GetRequests, 382 SyntacticMatches, 13 SemanticMatches, 279 ConstructedPredicates, 12 IntricatePredicates, 1 DeprecatedPredicates, 2076 ImplicationChecksByTransitivity, 122.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7586occurred in iteration=13, InterpolantAutomatonStates: 177, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 93.9s InterpolantComputationTime, 567 NumberOfCodeBlocks, 547 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 735 ConstructedInterpolants, 189 QuantifiedInterpolants, 14728 SizeOfPredicates, 82 NumberOfNonLiveVariables, 2166 ConjunctsInSsa, 319 ConjunctsInUnsatCore, 33 InterpolantComputations, 4 PerfectInterpolantSequences, 1199/1312 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 proved your program to be incorrect! [2023-08-03 21:34:33,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...