/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 PROGRAM_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-04 04:00:51,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 04:00:51,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 04:00:51,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 04:00:51,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 04:00:51,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 04:00:51,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 04:00:51,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 04:00:51,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 04:00:51,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 04:00:51,229 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 04:00:51,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 04:00:51,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 04:00:51,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 04:00:51,231 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 04:00:51,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 04:00:51,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 04:00:51,232 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 04:00:51,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 04:00:51,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 04:00:51,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 04:00:51,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 04:00:51,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 04:00:51,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 04:00:51,234 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 04:00:51,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 04:00:51,234 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 04:00:51,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 04:00:51,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 04:00:51,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 04:00:51,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 04:00:51,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 04:00:51,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 04:00:51,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 04:00:51,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 04:00:51,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 04:00:51,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 04:00:51,237 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 04:00:51,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 04:00:51,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 04:00:51,237 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 04:00:51,237 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 -> PROGRAM_FIRST [2023-08-04 04:00:51,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 04:00:51,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 04:00:51,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 04:00:51,473 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 04:00:51,473 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 04:00:51,474 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-04 04:00:52,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 04:00:52,829 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 04:00:52,830 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-04 04:00:52,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9401bcad/909bc5499587418c85187c0b372b41c2/FLAG1bec216c8 [2023-08-04 04:00:52,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9401bcad/909bc5499587418c85187c0b372b41c2 [2023-08-04 04:00:52,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 04:00:52,875 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 04:00:52,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 04:00:52,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 04:00:52,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 04:00:52,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 04:00:52" (1/1) ... [2023-08-04 04:00:52,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b8f54ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:00:52, skipping insertion in model container [2023-08-04 04:00:52,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 04:00:52" (1/1) ... [2023-08-04 04:00:52,931 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 04:00:53,295 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-04 04:00:53,322 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 04:00:53,335 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 04:00:53,349 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 04:00:53,350 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 04:00:53,358 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-04 04:00:53,365 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-04 04:00:53,374 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 04:00:53,418 INFO L206 MainTranslator]: Completed translation [2023-08-04 04:00:53,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:00:53 WrapperNode [2023-08-04 04:00:53,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 04:00:53,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 04:00:53,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 04:00:53,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 04:00:53,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:00:53" (1/1) ... [2023-08-04 04:00:53,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:00:53" (1/1) ... [2023-08-04 04:00:53,487 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 193 [2023-08-04 04:00:53,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 04:00:53,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 04:00:53,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 04:00:53,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 04:00:53,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:00:53" (1/1) ... [2023-08-04 04:00:53,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:00:53" (1/1) ... [2023-08-04 04:00:53,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:00:53" (1/1) ... [2023-08-04 04:00:53,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:00:53" (1/1) ... [2023-08-04 04:00:53,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:00:53" (1/1) ... [2023-08-04 04:00:53,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:00:53" (1/1) ... [2023-08-04 04:00:53,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:00:53" (1/1) ... [2023-08-04 04:00:53,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:00:53" (1/1) ... [2023-08-04 04:00:53,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 04:00:53,533 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 04:00:53,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 04:00:53,533 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 04:00:53,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:00:53" (1/1) ... [2023-08-04 04:00:53,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 04:00:53,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:00:53,561 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-04 04:00:53,567 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-04 04:00:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 04:00:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 04:00:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 04:00:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 04:00:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-04 04:00:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 04:00:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-04 04:00:53,593 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-04 04:00:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 04:00:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 04:00:53,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 04:00:53,595 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 04:00:53,748 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 04:00:53,749 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 04:00:53,943 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 04:00:53,949 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 04:00:53,949 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-04 04:00:53,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 04:00:53 BoogieIcfgContainer [2023-08-04 04:00:53,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 04:00:53,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 04:00:53,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 04:00:53,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 04:00:53,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 04:00:52" (1/3) ... [2023-08-04 04:00:53,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a537ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 04:00:53, skipping insertion in model container [2023-08-04 04:00:53,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:00:53" (2/3) ... [2023-08-04 04:00:53,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a537ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 04:00:53, skipping insertion in model container [2023-08-04 04:00:53,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 04:00:53" (3/3) ... [2023-08-04 04:00:53,958 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_77-tricky_address4_racing_bound2.i [2023-08-04 04:00:53,965 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 04:00:53,972 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 04:00:53,973 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 04:00:53,973 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 04:00:54,047 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-04 04:00:54,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 193 transitions, 394 flow [2023-08-04 04:00:54,147 INFO L124 PetriNetUnfolderBase]: 45/263 cut-off events. [2023-08-04 04:00:54,148 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-04 04:00:54,159 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-04 04:00:54,159 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 193 transitions, 394 flow [2023-08-04 04:00:54,164 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 188 transitions, 381 flow [2023-08-04 04:00:54,167 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:00:54,178 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-04 04:00:54,180 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-04 04:00:54,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 188 transitions, 381 flow [2023-08-04 04:00:54,224 INFO L124 PetriNetUnfolderBase]: 44/258 cut-off events. [2023-08-04 04:00:54,224 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:00:54,226 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-04 04:00:54,231 INFO L119 LiptonReduction]: Number of co-enabled transitions 10792 [2023-08-04 04:00:56,806 INFO L134 LiptonReduction]: Checked pairs total: 17790 [2023-08-04 04:00:56,806 INFO L136 LiptonReduction]: Total number of compositions: 164 [2023-08-04 04:00:56,818 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 04:00:56,822 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;@1f7874c0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:00:56,823 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 04:00:56,826 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:00:56,826 INFO L124 PetriNetUnfolderBase]: 4/19 cut-off events. [2023-08-04 04:00:56,826 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:00:56,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:00:56,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 04:00:56,827 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:00:56,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:00:56,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1355205613, now seen corresponding path program 1 times [2023-08-04 04:00:56,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:00:56,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404980814] [2023-08-04 04:00:56,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:00:56,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:00:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:00:57,012 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-04 04:00:57,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:00:57,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404980814] [2023-08-04 04:00:57,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404980814] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:00:57,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:00:57,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:00:57,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186477606] [2023-08-04 04:00:57,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:00:57,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:00:57,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:00:57,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:00:57,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:00:57,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 357 [2023-08-04 04:00:57,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:57,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:00:57,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 357 [2023-08-04 04:00:57,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:00:57,182 INFO L124 PetriNetUnfolderBase]: 272/614 cut-off events. [2023-08-04 04:00:57,182 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:00:57,184 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-04 04:00:57,187 INFO L140 encePairwiseOnDemand]: 332/357 looper letters, 34 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-04 04:00:57,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 167 flow [2023-08-04 04:00:57,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:00:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:00:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2023-08-04 04:00:57,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976657329598506 [2023-08-04 04:00:57,204 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 533 transitions. [2023-08-04 04:00:57,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 533 transitions. [2023-08-04 04:00:57,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:00:57,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 533 transitions. [2023-08-04 04:00:57,214 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-04 04:00:57,219 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-04 04:00:57,220 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-04 04:00:57,221 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 533 transitions. [2023-08-04 04:00:57,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 167 flow [2023-08-04 04:00:57,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 167 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:00:57,226 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 105 flow [2023-08-04 04:00:57,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2023-08-04 04:00:57,231 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-08-04 04:00:57,231 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 105 flow [2023-08-04 04:00:57,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:57,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:00:57,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:00:57,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 04:00:57,232 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:00:57,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:00:57,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1202044733, now seen corresponding path program 1 times [2023-08-04 04:00:57,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:00:57,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487921635] [2023-08-04 04:00:57,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:00:57,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:00:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:00:57,316 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-04 04:00:57,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:00:57,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487921635] [2023-08-04 04:00:57,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487921635] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:00:57,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613648997] [2023-08-04 04:00:57,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:00:57,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:00:57,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:00:57,320 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-04 04:00:57,382 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-04 04:00:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:00:57,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 04:00:57,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:00:57,467 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-04 04:00:57,467 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:00:57,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613648997] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:00:57,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 04:00:57,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 04:00:57,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967211906] [2023-08-04 04:00:57,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:00:57,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:00:57,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:00:57,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:00:57,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:00:57,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 357 [2023-08-04 04:00:57,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:57,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:00:57,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 357 [2023-08-04 04:00:57,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:00:57,585 INFO L124 PetriNetUnfolderBase]: 255/592 cut-off events. [2023-08-04 04:00:57,586 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:00:57,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 592 events. 255/592 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3266 event pairs, 0 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 1120. Up to 497 conditions per place. [2023-08-04 04:00:57,589 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 49 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-04 04:00:57,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 237 flow [2023-08-04 04:00:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:00:57,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:00:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2023-08-04 04:00:57,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2023-08-04 04:00:57,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2023-08-04 04:00:57,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2023-08-04 04:00:57,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:00:57,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2023-08-04 04:00:57,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:57,595 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-04 04:00:57,595 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-04 04:00:57,596 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 105 flow. Second operand 3 states and 525 transitions. [2023-08-04 04:00:57,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 237 flow [2023-08-04 04:00:57,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 233 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 04:00:57,598 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 109 flow [2023-08-04 04:00:57,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2023-08-04 04:00:57,599 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2023-08-04 04:00:57,599 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 109 flow [2023-08-04 04:00:57,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:57,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:00:57,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:00:57,610 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-04 04:00:57,811 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-04 04:00:57,811 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:00:57,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:00:57,812 INFO L85 PathProgramCache]: Analyzing trace with hash -96419517, now seen corresponding path program 1 times [2023-08-04 04:00:57,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:00:57,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240142628] [2023-08-04 04:00:57,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:00:57,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:00:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:00:57,907 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-04 04:00:57,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:00:57,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240142628] [2023-08-04 04:00:57,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240142628] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:00:57,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038939281] [2023-08-04 04:00:57,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:00:57,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:00:57,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:00:57,913 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-04 04:00:57,915 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-04 04:00:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:00:57,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 04:00:57,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:00:58,006 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-04 04:00:58,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:00:58,021 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-04 04:00:58,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038939281] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:00:58,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:00:58,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 04:00:58,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041024659] [2023-08-04 04:00:58,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:00:58,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 04:00:58,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:00:58,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 04:00:58,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 04:00:58,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 357 [2023-08-04 04:00:58,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 109 flow. Second operand has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:58,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:00:58,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 357 [2023-08-04 04:00:58,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:00:58,163 INFO L124 PetriNetUnfolderBase]: 271/599 cut-off events. [2023-08-04 04:00:58,164 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-04 04:00:58,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1176 conditions, 599 events. 271/599 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2938 event pairs, 238 based on Foata normal form. 3/529 useless extension candidates. Maximal degree in co-relation 1149. Up to 513 conditions per place. [2023-08-04 04:00:58,166 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 34 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-08-04 04:00:58,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 199 flow [2023-08-04 04:00:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 04:00:58,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 04:00:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 984 transitions. [2023-08-04 04:00:58,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45938375350140054 [2023-08-04 04:00:58,171 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 984 transitions. [2023-08-04 04:00:58,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 984 transitions. [2023-08-04 04:00:58,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:00:58,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 984 transitions. [2023-08-04 04:00:58,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:58,176 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-04 04:00:58,178 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-04 04:00:58,178 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 109 flow. Second operand 6 states and 984 transitions. [2023-08-04 04:00:58,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 199 flow [2023-08-04 04:00:58,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 04:00:58,181 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 141 flow [2023-08-04 04:00:58,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-08-04 04:00:58,183 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2023-08-04 04:00:58,183 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 141 flow [2023-08-04 04:00:58,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:58,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:00:58,184 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:00:58,192 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-04 04:00:58,389 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-04 04:00:58,390 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:00:58,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:00:58,390 INFO L85 PathProgramCache]: Analyzing trace with hash -888320147, now seen corresponding path program 2 times [2023-08-04 04:00:58,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:00:58,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299757188] [2023-08-04 04:00:58,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:00:58,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:00:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:00:58,500 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-04 04:00:58,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:00:58,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299757188] [2023-08-04 04:00:58,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299757188] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:00:58,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067482674] [2023-08-04 04:00:58,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:00:58,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:00:58,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:00:58,503 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-04 04:00:58,532 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-04 04:00:58,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-04 04:00:58,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:00:58,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-04 04:00:58,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:00:58,615 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-04 04:00:58,670 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:00:58,671 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-04 04:00:58,690 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-04 04:00:58,747 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-04 04:00:58,748 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:00:58,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067482674] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:00:58,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 04:00:58,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-04 04:00:58,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549563672] [2023-08-04 04:00:58,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:00:58,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 04:00:58,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:00:58,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 04:00:58,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-04 04:00:58,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 357 [2023-08-04 04:00:58,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 151.33333333333334) internal successors, (908), 6 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:58,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:00:58,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 357 [2023-08-04 04:00:58,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:00:59,069 INFO L124 PetriNetUnfolderBase]: 260/618 cut-off events. [2023-08-04 04:00:59,070 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-04 04:00:59,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 618 events. 260/618 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3247 event pairs, 31 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 1180. Up to 334 conditions per place. [2023-08-04 04:00:59,072 INFO L140 encePairwiseOnDemand]: 350/357 looper letters, 42 selfloop transitions, 6 changer transitions 25/81 dead transitions. [2023-08-04 04:00:59,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 357 flow [2023-08-04 04:00:59,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 04:00:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 04:00:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2023-08-04 04:00:59,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4599439775910364 [2023-08-04 04:00:59,075 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 821 transitions. [2023-08-04 04:00:59,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 821 transitions. [2023-08-04 04:00:59,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:00:59,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 821 transitions. [2023-08-04 04:00:59,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.2) internal successors, (821), 5 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:59,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:59,081 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:59,081 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 141 flow. Second operand 5 states and 821 transitions. [2023-08-04 04:00:59,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 357 flow [2023-08-04 04:00:59,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 343 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 04:00:59,083 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 145 flow [2023-08-04 04:00:59,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2023-08-04 04:00:59,084 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2023-08-04 04:00:59,084 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 145 flow [2023-08-04 04:00:59,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 151.33333333333334) internal successors, (908), 6 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:59,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:00:59,085 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:00:59,096 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-04 04:00:59,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:00:59,291 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:00:59,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:00:59,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1713486904, now seen corresponding path program 1 times [2023-08-04 04:00:59,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:00:59,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577590068] [2023-08-04 04:00:59,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:00:59,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:00:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:00:59,385 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-04 04:00:59,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:00:59,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577590068] [2023-08-04 04:00:59,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577590068] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:00:59,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67612978] [2023-08-04 04:00:59,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:00:59,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:00:59,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:00:59,387 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-04 04:00:59,393 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-04 04:00:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:00:59,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 04:00:59,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:00:59,514 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-04 04:00:59,514 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:00:59,567 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-04 04:00:59,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67612978] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:00:59,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:00:59,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-04 04:00:59,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301616459] [2023-08-04 04:00:59,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:00:59,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-04 04:00:59,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:00:59,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-04 04:00:59,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-04 04:00:59,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 357 [2023-08-04 04:00:59,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 145 flow. Second operand has 14 states, 14 states have (on average 155.21428571428572) internal successors, (2173), 14 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:59,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:00:59,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 357 [2023-08-04 04:00:59,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:00:59,692 INFO L124 PetriNetUnfolderBase]: 23/76 cut-off events. [2023-08-04 04:00:59,693 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2023-08-04 04:00:59,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 76 events. 23/76 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 141 event pairs, 0 based on Foata normal form. 18/91 useless extension candidates. Maximal degree in co-relation 155. Up to 46 conditions per place. [2023-08-04 04:00:59,693 INFO L140 encePairwiseOnDemand]: 352/357 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2023-08-04 04:00:59,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 234 flow [2023-08-04 04:00:59,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-04 04:00:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-04 04:00:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2188 transitions. [2023-08-04 04:00:59,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4377751100440176 [2023-08-04 04:00:59,699 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2188 transitions. [2023-08-04 04:00:59,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2188 transitions. [2023-08-04 04:00:59,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:00:59,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2188 transitions. [2023-08-04 04:00:59,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 156.28571428571428) internal successors, (2188), 14 states have internal predecessors, (2188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:59,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 357.0) internal successors, (5355), 15 states have internal predecessors, (5355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:59,713 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 357.0) internal successors, (5355), 15 states have internal predecessors, (5355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:59,713 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 145 flow. Second operand 14 states and 2188 transitions. [2023-08-04 04:00:59,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 234 flow [2023-08-04 04:00:59,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 213 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-04 04:00:59,715 INFO L231 Difference]: Finished difference. Result has 45 places, 0 transitions, 0 flow [2023-08-04 04:00:59,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=0, PETRI_PLACES=45, PETRI_TRANSITIONS=0} [2023-08-04 04:00:59,715 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2023-08-04 04:00:59,715 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 0 transitions, 0 flow [2023-08-04 04:00:59,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 155.21428571428572) internal successors, (2173), 14 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:59,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 04:00:59,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 04:00:59,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 04:00:59,727 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-04 04:00:59,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:00:59,925 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-08-04 04:00:59,926 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 04:00:59,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 193 transitions, 394 flow [2023-08-04 04:00:59,951 INFO L124 PetriNetUnfolderBase]: 45/263 cut-off events. [2023-08-04 04:00:59,952 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-04 04:00:59,953 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-04 04:00:59,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 193 transitions, 394 flow [2023-08-04 04:00:59,954 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 188 transitions, 381 flow [2023-08-04 04:00:59,954 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:00:59,954 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-04 04:00:59,955 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-04 04:00:59,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 188 transitions, 381 flow [2023-08-04 04:00:59,973 INFO L124 PetriNetUnfolderBase]: 44/258 cut-off events. [2023-08-04 04:00:59,973 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:00:59,974 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-04 04:00:59,979 INFO L119 LiptonReduction]: Number of co-enabled transitions 10792 [2023-08-04 04:01:02,411 INFO L134 LiptonReduction]: Checked pairs total: 17496 [2023-08-04 04:01:02,411 INFO L136 LiptonReduction]: Total number of compositions: 162 [2023-08-04 04:01:02,413 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 04:01:02,414 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;@1f7874c0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:01:02,414 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 04:01:02,417 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:01:02,417 INFO L124 PetriNetUnfolderBase]: 7/31 cut-off events. [2023-08-04 04:01:02,417 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:01:02,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:01:02,417 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-04 04:01:02,418 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 04:01:02,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:01:02,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1690553009, now seen corresponding path program 1 times [2023-08-04 04:01:02,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:01:02,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247976421] [2023-08-04 04:01:02,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:01:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:02,439 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-04 04:01:02,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:01:02,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247976421] [2023-08-04 04:01:02,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247976421] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:01:02,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:01:02,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:01:02,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085697613] [2023-08-04 04:01:02,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:01:02,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:01:02,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:01:02,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:01:02,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:01:02,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 355 [2023-08-04 04:01:02,456 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-04 04:01:02,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:01:02,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 355 [2023-08-04 04:01:02,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:01:02,532 INFO L124 PetriNetUnfolderBase]: 272/614 cut-off events. [2023-08-04 04:01:02,533 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:01:02,533 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 3050 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-04 04:01:02,534 INFO L140 encePairwiseOnDemand]: 330/355 looper letters, 20 selfloop transitions, 2 changer transitions 18/45 dead transitions. [2023-08-04 04:01:02,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 167 flow [2023-08-04 04:01:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:01:02,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:01:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2023-08-04 04:01:02,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5004694835680751 [2023-08-04 04:01:02,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 533 transitions. [2023-08-04 04:01:02,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 533 transitions. [2023-08-04 04:01:02,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:01:02,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 533 transitions. [2023-08-04 04:01:02,537 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-04 04:01:02,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:02,539 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:02,539 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 533 transitions. [2023-08-04 04:01:02,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 167 flow [2023-08-04 04:01:02,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 167 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:01:02,541 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 69 flow [2023-08-04 04:01:02,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, 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-04 04:01:02,541 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-08-04 04:01:02,541 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 69 flow [2023-08-04 04:01:02,542 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-04 04:01:02,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:01:02,542 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-04 04:01:02,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 04:01:02,542 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 04:01:02,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:01:02,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1112596279, now seen corresponding path program 1 times [2023-08-04 04:01:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:01:02,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672798017] [2023-08-04 04:01:02,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:02,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:01:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:02,570 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-04 04:01:02,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:01:02,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672798017] [2023-08-04 04:01:02,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672798017] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:01:02,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481873196] [2023-08-04 04:01:02,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:02,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:01:02,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:01:02,572 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-04 04:01:02,598 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-04 04:01:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:02,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 04:01:02,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:01:02,651 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-04 04:01:02,652 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:01:02,664 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-04 04:01:02,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481873196] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:01:02,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:01:02,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 04:01:02,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714189749] [2023-08-04 04:01:02,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:01:02,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 04:01:02,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:01:02,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 04:01:02,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 04:01:02,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 355 [2023-08-04 04:01:02,681 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-04 04:01:02,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:01:02,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 355 [2023-08-04 04:01:02,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:01:02,731 INFO L124 PetriNetUnfolderBase]: 47/129 cut-off events. [2023-08-04 04:01:02,732 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:01:02,732 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-04 04:01:02,732 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 20 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-08-04 04:01:02,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 131 flow [2023-08-04 04:01:02,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 04:01:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 04:01:02,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 970 transitions. [2023-08-04 04:01:02,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45539906103286387 [2023-08-04 04:01:02,735 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 970 transitions. [2023-08-04 04:01:02,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 970 transitions. [2023-08-04 04:01:02,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:01:02,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 970 transitions. [2023-08-04 04:01:02,738 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-04 04:01:02,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 355.0) internal successors, (2485), 7 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:02,741 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 355.0) internal successors, (2485), 7 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:02,741 INFO L175 Difference]: Start difference. First operand has 47 places, 27 transitions, 69 flow. Second operand 6 states and 970 transitions. [2023-08-04 04:01:02,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 131 flow [2023-08-04 04:01:02,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 127 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 04:01:02,742 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2023-08-04 04:01:02,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, 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-04 04:01:02,743 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-08-04 04:01:02,743 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2023-08-04 04:01:02,744 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-04 04:01:02,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:01:02,744 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-04 04:01:02,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 04:01:02,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:01:02,949 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 04:01:02,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:01:02,949 INFO L85 PathProgramCache]: Analyzing trace with hash -374883279, now seen corresponding path program 2 times [2023-08-04 04:01:02,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:01:02,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471969994] [2023-08-04 04:01:02,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:02,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:01:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:03,026 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-04 04:01:03,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:01:03,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471969994] [2023-08-04 04:01:03,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471969994] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:01:03,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021133819] [2023-08-04 04:01:03,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:01:03,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:01:03,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:01:03,028 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-04 04:01:03,052 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-04 04:01:03,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 04:01:03,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:01:03,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 04:01:03,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:01:03,122 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-04 04:01:03,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:01:03,163 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-04 04:01:03,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021133819] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:01:03,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:01:03,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-04 04:01:03,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215927234] [2023-08-04 04:01:03,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:01:03,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-04 04:01:03,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:01:03,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-04 04:01:03,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-04 04:01:03,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 355 [2023-08-04 04:01:03,199 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-04 04:01:03,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:01:03,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 355 [2023-08-04 04:01:03,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:01:03,251 INFO L124 PetriNetUnfolderBase]: 47/135 cut-off events. [2023-08-04 04:01:03,252 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-04 04:01:03,252 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-04 04:01:03,252 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 20 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2023-08-04 04:01:03,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 199 flow [2023-08-04 04:01:03,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 04:01:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 04:01:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1921 transitions. [2023-08-04 04:01:03,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4509389671361502 [2023-08-04 04:01:03,259 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1921 transitions. [2023-08-04 04:01:03,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1921 transitions. [2023-08-04 04:01:03,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:01:03,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1921 transitions. [2023-08-04 04:01:03,264 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-04 04:01:03,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 355.0) internal successors, (4615), 13 states have internal predecessors, (4615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:03,271 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 355.0) internal successors, (4615), 13 states have internal predecessors, (4615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:03,271 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 12 states and 1921 transitions. [2023-08-04 04:01:03,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 199 flow [2023-08-04 04:01:03,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 185 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 04:01:03,274 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 171 flow [2023-08-04 04:01:03,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, 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-04 04:01:03,276 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-08-04 04:01:03,276 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 171 flow [2023-08-04 04:01:03,277 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-04 04:01:03,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:01:03,277 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-04 04:01:03,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 04:01:03,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:01:03,482 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 04:01:03,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:01:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash 832355953, now seen corresponding path program 3 times [2023-08-04 04:01:03,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:01:03,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471979958] [2023-08-04 04:01:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:03,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:01:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 04:01:03,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 04:01:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 04:01:03,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 04:01:03,539 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 04:01:03,539 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-04 04:01:03,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 04:01:03,540 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-04 04:01:03,540 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-04 04:01:03,540 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 04:01:03,541 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 04:01:03,572 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-04 04:01:03,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 266 transitions, 550 flow [2023-08-04 04:01:03,638 INFO L124 PetriNetUnfolderBase]: 75/430 cut-off events. [2023-08-04 04:01:03,638 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-04 04:01:03,642 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-04 04:01:03,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 266 transitions, 550 flow [2023-08-04 04:01:03,646 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 266 transitions, 550 flow [2023-08-04 04:01:03,646 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:01:03,647 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 266 transitions, 550 flow [2023-08-04 04:01:03,647 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 266 transitions, 550 flow [2023-08-04 04:01:03,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 266 transitions, 550 flow [2023-08-04 04:01:03,689 INFO L124 PetriNetUnfolderBase]: 75/430 cut-off events. [2023-08-04 04:01:03,689 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-04 04:01:03,693 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-04 04:01:03,710 INFO L119 LiptonReduction]: Number of co-enabled transitions 33228 [2023-08-04 04:01:06,757 INFO L134 LiptonReduction]: Checked pairs total: 57444 [2023-08-04 04:01:06,758 INFO L136 LiptonReduction]: Total number of compositions: 223 [2023-08-04 04:01:06,759 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 04:01:06,760 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;@1f7874c0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:01:06,760 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 04:01:06,762 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:01:06,762 INFO L124 PetriNetUnfolderBase]: 7/25 cut-off events. [2023-08-04 04:01:06,762 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:01:06,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:01:06,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 04:01:06,763 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-04 04:01:06,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:01:06,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1267872476, now seen corresponding path program 1 times [2023-08-04 04:01:06,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:01:06,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284201584] [2023-08-04 04:01:06,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:06,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:01:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:06,781 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-04 04:01:06,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:01:06,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284201584] [2023-08-04 04:01:06,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284201584] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:01:06,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:01:06,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:01:06,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882026567] [2023-08-04 04:01:06,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:01:06,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:01:06,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:01:06,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:01:06,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:01:06,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 489 [2023-08-04 04:01:06,790 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-04 04:01:06,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:01:06,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 489 [2023-08-04 04:01:06,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:01:08,115 INFO L124 PetriNetUnfolderBase]: 10521/16515 cut-off events. [2023-08-04 04:01:08,115 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-08-04 04:01:08,139 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 560. Compared 109597 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-04 04:01:08,194 INFO L140 encePairwiseOnDemand]: 455/489 looper letters, 56 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-04 04:01:08,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 274 flow [2023-08-04 04:01:08,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:01:08,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:01:08,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 738 transitions. [2023-08-04 04:01:08,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030674846625767 [2023-08-04 04:01:08,197 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 738 transitions. [2023-08-04 04:01:08,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 738 transitions. [2023-08-04 04:01:08,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:01:08,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 738 transitions. [2023-08-04 04:01:08,199 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-04 04:01:08,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:08,202 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:08,202 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 218 flow. Second operand 3 states and 738 transitions. [2023-08-04 04:01:08,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 274 flow [2023-08-04 04:01:08,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 274 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:01:08,205 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-08-04 04:01:08,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, 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-04 04:01:08,206 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-04 04:01:08,206 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-08-04 04:01:08,207 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-04 04:01:08,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:01:08,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:01:08,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 04:01:08,207 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-04 04:01:08,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:01:08,207 INFO L85 PathProgramCache]: Analyzing trace with hash 339768936, now seen corresponding path program 1 times [2023-08-04 04:01:08,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:01:08,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424589297] [2023-08-04 04:01:08,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:08,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:01:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:08,241 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-04 04:01:08,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:01:08,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424589297] [2023-08-04 04:01:08,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424589297] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:01:08,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161344538] [2023-08-04 04:01:08,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:08,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:01:08,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:01:08,243 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-04 04:01:08,253 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-04 04:01:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:08,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 04:01:08,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:01:08,330 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-04 04:01:08,330 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:01:08,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161344538] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:01:08,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 04:01:08,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 04:01:08,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374979966] [2023-08-04 04:01:08,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:01:08,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:01:08,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:01:08,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:01:08,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:01:08,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 489 [2023-08-04 04:01:08,340 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-04 04:01:08,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:01:08,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 489 [2023-08-04 04:01:08,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:01:09,525 INFO L124 PetriNetUnfolderBase]: 10399/16491 cut-off events. [2023-08-04 04:01:09,525 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2023-08-04 04:01:09,551 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 572. Compared 111617 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-04 04:01:09,607 INFO L140 encePairwiseOnDemand]: 486/489 looper letters, 74 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-08-04 04:01:09,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 356 flow [2023-08-04 04:01:09,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:01:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:01:09,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2023-08-04 04:01:09,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49352419904567146 [2023-08-04 04:01:09,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 724 transitions. [2023-08-04 04:01:09,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 724 transitions. [2023-08-04 04:01:09,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:01:09,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 724 transitions. [2023-08-04 04:01:09,612 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-04 04:01:09,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:09,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:09,614 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 168 flow. Second operand 3 states and 724 transitions. [2023-08-04 04:01:09,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 356 flow [2023-08-04 04:01:09,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 88 transitions, 352 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 04:01:09,619 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-08-04 04:01:09,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, 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-04 04:01:09,620 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-04 04:01:09,620 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-08-04 04:01:09,620 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-04 04:01:09,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:01:09,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:01:09,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-04 04:01:09,825 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-04 04:01:09,826 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-04 04:01:09,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:01:09,826 INFO L85 PathProgramCache]: Analyzing trace with hash -953345288, now seen corresponding path program 1 times [2023-08-04 04:01:09,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:01:09,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549221477] [2023-08-04 04:01:09,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:09,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:01:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:09,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-04 04:01:09,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:01:09,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549221477] [2023-08-04 04:01:09,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549221477] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:01:09,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10092627] [2023-08-04 04:01:09,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:09,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:01:09,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:01:09,860 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-04 04:01:09,862 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-04 04:01:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:09,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 04:01:09,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:01:09,965 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-04 04:01:09,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:01:09,978 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-04 04:01:09,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10092627] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:01:09,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:01:09,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 04:01:09,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579999732] [2023-08-04 04:01:09,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:01:09,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 04:01:09,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:01:09,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 04:01:09,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 04:01:09,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 489 [2023-08-04 04:01:09,998 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-04 04:01:09,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:01:09,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 489 [2023-08-04 04:01:09,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:01:11,347 INFO L124 PetriNetUnfolderBase]: 10623/16504 cut-off events. [2023-08-04 04:01:11,347 INFO L125 PetriNetUnfolderBase]: For 685/685 co-relation queries the response was YES. [2023-08-04 04:01:11,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32633 conditions, 16504 events. 10623/16504 cut-off events. For 685/685 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 108095 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-04 04:01:11,411 INFO L140 encePairwiseOnDemand]: 486/489 looper letters, 57 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-04 04:01:11,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 312 flow [2023-08-04 04:01:11,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 04:01:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 04:01:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1354 transitions. [2023-08-04 04:01:11,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4614860259032038 [2023-08-04 04:01:11,415 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1354 transitions. [2023-08-04 04:01:11,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1354 transitions. [2023-08-04 04:01:11,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:01:11,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1354 transitions. [2023-08-04 04:01:11,430 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-04 04:01:11,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:11,435 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:11,435 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 176 flow. Second operand 6 states and 1354 transitions. [2023-08-04 04:01:11,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 312 flow [2023-08-04 04:01:11,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:01:11,439 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-08-04 04:01:11,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, 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-04 04:01:11,439 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-08-04 04:01:11,440 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-08-04 04:01:11,441 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-04 04:01:11,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:01:11,441 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:01:11,449 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-04 04:01:11,646 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-04 04:01:11,646 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-04 04:01:11,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:01:11,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1739017580, now seen corresponding path program 2 times [2023-08-04 04:01:11,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:01:11,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840781478] [2023-08-04 04:01:11,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:11,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:01:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:11,719 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-04 04:01:11,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:01:11,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840781478] [2023-08-04 04:01:11,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840781478] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:01:11,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240847009] [2023-08-04 04:01:11,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:01:11,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:01:11,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:01:11,721 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-04 04:01:11,724 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-04 04:01:11,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-04 04:01:11,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:01:11,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-04 04:01:11,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:01:11,819 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-04 04:01:11,861 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:01:11,861 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-04 04:01:11,882 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-04 04:01:12,010 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-04 04:01:12,010 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:01:12,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240847009] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:01:12,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 04:01:12,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-04 04:01:12,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836001996] [2023-08-04 04:01:12,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:01:12,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 04:01:12,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:01:12,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 04:01:12,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-04 04:01:12,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 489 [2023-08-04 04:01:12,188 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-04 04:01:12,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:01:12,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 489 [2023-08-04 04:01:12,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:01:13,345 INFO L124 PetriNetUnfolderBase]: 10764/16984 cut-off events. [2023-08-04 04:01:13,346 INFO L125 PetriNetUnfolderBase]: For 685/685 co-relation queries the response was YES. [2023-08-04 04:01:13,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33923 conditions, 16984 events. 10764/16984 cut-off events. For 685/685 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 115318 event pairs, 2807 based on Foata normal form. 0/14965 useless extension candidates. Maximal degree in co-relation 33887. Up to 12964 conditions per place. [2023-08-04 04:01:13,400 INFO L140 encePairwiseOnDemand]: 479/489 looper letters, 123 selfloop transitions, 14 changer transitions 14/163 dead transitions. [2023-08-04 04:01:13,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 163 transitions, 721 flow [2023-08-04 04:01:13,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 04:01:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 04:01:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1388 transitions. [2023-08-04 04:01:13,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730743012951602 [2023-08-04 04:01:13,404 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1388 transitions. [2023-08-04 04:01:13,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1388 transitions. [2023-08-04 04:01:13,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:01:13,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1388 transitions. [2023-08-04 04:01:13,407 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-04 04:01:13,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:13,411 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:13,411 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 210 flow. Second operand 6 states and 1388 transitions. [2023-08-04 04:01:13,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 163 transitions, 721 flow [2023-08-04 04:01:13,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 163 transitions, 707 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 04:01:13,414 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 293 flow [2023-08-04 04:01:13,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, 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-04 04:01:13,415 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 20 predicate places. [2023-08-04 04:01:13,415 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 293 flow [2023-08-04 04:01:13,415 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-04 04:01:13,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:01:13,415 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:01:13,423 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-04 04:01:13,621 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-04 04:01:13,622 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-04 04:01:13,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:01:13,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1058932086, now seen corresponding path program 1 times [2023-08-04 04:01:13,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:01:13,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791295827] [2023-08-04 04:01:13,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:13,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:01:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:13,678 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-04 04:01:13,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:01:13,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791295827] [2023-08-04 04:01:13,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791295827] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:01:13,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222673572] [2023-08-04 04:01:13,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:13,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:01:13,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:01:13,681 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-04 04:01:13,707 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-04 04:01:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:13,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 04:01:13,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:01:13,811 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-04 04:01:13,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:01:13,863 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-04 04:01:13,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222673572] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:01:13,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:01:13,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-04 04:01:13,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238460394] [2023-08-04 04:01:13,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:01:13,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-04 04:01:13,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:01:13,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-04 04:01:13,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-04 04:01:13,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 489 [2023-08-04 04:01:13,916 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-04 04:01:13,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:01:13,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 489 [2023-08-04 04:01:13,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:01:15,281 INFO L124 PetriNetUnfolderBase]: 10542/17255 cut-off events. [2023-08-04 04:01:15,281 INFO L125 PetriNetUnfolderBase]: For 5243/5243 co-relation queries the response was YES. [2023-08-04 04:01:15,313 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 122909 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-04 04:01:15,458 INFO L140 encePairwiseOnDemand]: 483/489 looper letters, 117 selfloop transitions, 15 changer transitions 0/144 dead transitions. [2023-08-04 04:01:15,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 144 transitions, 735 flow [2023-08-04 04:01:15,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-04 04:01:15,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-04 04:01:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3077 transitions. [2023-08-04 04:01:15,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44945953841659364 [2023-08-04 04:01:15,466 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3077 transitions. [2023-08-04 04:01:15,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3077 transitions. [2023-08-04 04:01:15,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:01:15,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3077 transitions. [2023-08-04 04:01:15,472 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-04 04:01:15,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 489.0) internal successors, (7335), 15 states have internal predecessors, (7335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:15,481 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 489.0) internal successors, (7335), 15 states have internal predecessors, (7335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:15,481 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 293 flow. Second operand 14 states and 3077 transitions. [2023-08-04 04:01:15,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 144 transitions, 735 flow [2023-08-04 04:01:15,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 144 transitions, 735 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:01:15,493 INFO L231 Difference]: Finished difference. Result has 103 places, 93 transitions, 375 flow [2023-08-04 04:01:15,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, 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-04 04:01:15,493 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 35 predicate places. [2023-08-04 04:01:15,493 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 93 transitions, 375 flow [2023-08-04 04:01:15,494 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-04 04:01:15,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:01:15,494 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-04 04:01:15,503 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-04 04:01:15,699 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,SelfDestructingSolverStorable13 [2023-08-04 04:01:15,700 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-04 04:01:15,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:01:15,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1799710142, now seen corresponding path program 1 times [2023-08-04 04:01:15,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:01:15,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007305277] [2023-08-04 04:01:15,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:15,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:01:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:15,927 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-04 04:01:15,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:01:15,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007305277] [2023-08-04 04:01:15,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007305277] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:01:15,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:01:15,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 04:01:15,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047578748] [2023-08-04 04:01:15,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:01:15,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:01:15,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:01:15,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:01:15,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:01:16,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 489 [2023-08-04 04:01:16,061 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-04 04:01:16,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:01:16,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 489 [2023-08-04 04:01:16,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:01:16,789 INFO L124 PetriNetUnfolderBase]: 5594/10272 cut-off events. [2023-08-04 04:01:16,789 INFO L125 PetriNetUnfolderBase]: For 5257/5257 co-relation queries the response was YES. [2023-08-04 04:01:16,804 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 76224 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-04 04:01:16,817 INFO L140 encePairwiseOnDemand]: 468/489 looper letters, 118 selfloop transitions, 21 changer transitions 2/151 dead transitions. [2023-08-04 04:01:16,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 151 transitions, 865 flow [2023-08-04 04:01:16,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:01:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:01:16,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 898 transitions. [2023-08-04 04:01:16,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591002044989775 [2023-08-04 04:01:16,820 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 898 transitions. [2023-08-04 04:01:16,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 898 transitions. [2023-08-04 04:01:16,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:01:16,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 898 transitions. [2023-08-04 04:01:16,823 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-04 04:01:16,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 489.0) internal successors, (2445), 5 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:16,825 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 489.0) internal successors, (2445), 5 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:16,825 INFO L175 Difference]: Start difference. First operand has 103 places, 93 transitions, 375 flow. Second operand 4 states and 898 transitions. [2023-08-04 04:01:16,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 151 transitions, 865 flow [2023-08-04 04:01:16,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 151 transitions, 792 flow, removed 26 selfloop flow, removed 10 redundant places. [2023-08-04 04:01:16,841 INFO L231 Difference]: Finished difference. Result has 97 places, 104 transitions, 411 flow [2023-08-04 04:01:16,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, 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-04 04:01:16,842 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 29 predicate places. [2023-08-04 04:01:16,842 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 104 transitions, 411 flow [2023-08-04 04:01:16,842 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-04 04:01:16,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:01:16,842 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-04 04:01:16,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 04:01:16,843 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-04 04:01:16,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:01:16,843 INFO L85 PathProgramCache]: Analyzing trace with hash 641537200, now seen corresponding path program 1 times [2023-08-04 04:01:16,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:01:16,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081953294] [2023-08-04 04:01:16,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:16,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:01:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:17,530 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-04 04:01:17,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:01:17,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081953294] [2023-08-04 04:01:17,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081953294] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:01:17,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879217876] [2023-08-04 04:01:17,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:17,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:01:17,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:01:17,532 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-04 04:01:17,534 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-04 04:01:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:17,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-04 04:01:17,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:01:17,662 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-04 04:01:17,743 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:01:17,744 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-04 04:01:17,765 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-04 04:01:17,791 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-04 04:01:17,818 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-04 04:01:17,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:01:17,856 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-04 04:01:17,878 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-04 04:01:17,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:01:17,927 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-04 04:01:17,982 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:01:17,982 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-04 04:01:18,047 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-04 04:01:18,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:01:18,117 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_77| Int) (v_ArrVal_464 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_77| 28))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_77| 1) (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_464) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| (- 24))))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_77|) (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2023-08-04 04:01:18,131 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 Int) (|v_t_funThread2of2ForFork0_~i~0#1_77| Int) (v_ArrVal_464 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_77| 28))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_77| 1) (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_464) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| (- 24))))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_77|) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_463) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2023-08-04 04:01:18,186 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:01:18,187 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-04 04:01:18,196 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:01:18,196 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-04 04:01:18,202 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-04 04:01:36,405 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_458 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_77| Int)) (or (forall ((|v_t_funThread1of2ForFork0_~i~0#1_87| Int) (v_ArrVal_463 Int) (|~#a~0.offset| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_458) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_87| 28) |~#a~0.offset|) v_ArrVal_463) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_77| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_77| |v_t_funThread1of2ForFork0_~i~0#1_87|))) (< |v_t_funThread2of2ForFork0_~i~0#1_77| 1) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_77|)))) is different from false [2023-08-04 04:01:40,061 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-04 04:01:40,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879217876] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:01:40,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:01:40,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-08-04 04:01:40,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144905843] [2023-08-04 04:01:40,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:01:40,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-04 04:01:40,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:01:40,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-04 04:01:40,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=237, Unknown=9, NotChecked=108, Total=462 [2023-08-04 04:01:40,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 489 [2023-08-04 04:01:40,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 104 transitions, 411 flow. Second operand has 22 states, 22 states have (on average 151.3181818181818) internal successors, (3329), 22 states have internal predecessors, (3329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:40,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:01:40,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 489 [2023-08-04 04:01:40,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:01:42,359 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-04 04:01:44,375 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-04 04:01:47,568 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-04 04:01:49,325 INFO L124 PetriNetUnfolderBase]: 7656/13911 cut-off events. [2023-08-04 04:01:49,325 INFO L125 PetriNetUnfolderBase]: For 8779/8807 co-relation queries the response was YES. [2023-08-04 04:01:49,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38706 conditions, 13911 events. 7656/13911 cut-off events. For 8779/8807 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 107516 event pairs, 796 based on Foata normal form. 13/12706 useless extension candidates. Maximal degree in co-relation 37575. Up to 7469 conditions per place. [2023-08-04 04:01:49,379 INFO L140 encePairwiseOnDemand]: 475/489 looper letters, 276 selfloop transitions, 76 changer transitions 102/463 dead transitions. [2023-08-04 04:01:49,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 463 transitions, 2698 flow [2023-08-04 04:01:49,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-04 04:01:49,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-04 04:01:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2623 transitions. [2023-08-04 04:01:49,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3576005453306067 [2023-08-04 04:01:49,388 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2623 transitions. [2023-08-04 04:01:49,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2623 transitions. [2023-08-04 04:01:49,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:01:49,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2623 transitions. [2023-08-04 04:01:49,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 174.86666666666667) internal successors, (2623), 15 states have internal predecessors, (2623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:49,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 489.0) internal successors, (7824), 16 states have internal predecessors, (7824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:49,403 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 489.0) internal successors, (7824), 16 states have internal predecessors, (7824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:49,403 INFO L175 Difference]: Start difference. First operand has 97 places, 104 transitions, 411 flow. Second operand 15 states and 2623 transitions. [2023-08-04 04:01:49,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 463 transitions, 2698 flow [2023-08-04 04:01:49,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 463 transitions, 2697 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:01:49,429 INFO L231 Difference]: Finished difference. Result has 113 places, 167 transitions, 893 flow [2023-08-04 04:01:49,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=893, PETRI_PLACES=113, PETRI_TRANSITIONS=167} [2023-08-04 04:01:49,429 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 45 predicate places. [2023-08-04 04:01:49,430 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 167 transitions, 893 flow [2023-08-04 04:01:49,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 151.3181818181818) internal successors, (3329), 22 states have internal predecessors, (3329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:49,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:01:49,431 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-04 04:01:49,439 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-04 04:01:49,636 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-04 04:01:49,637 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-04 04:01:49,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:01:49,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1241005934, now seen corresponding path program 2 times [2023-08-04 04:01:49,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:01:49,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685457773] [2023-08-04 04:01:49,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:49,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:01:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:50,159 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-04 04:01:50,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:01:50,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685457773] [2023-08-04 04:01:50,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685457773] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:01:50,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995896743] [2023-08-04 04:01:50,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:01:50,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:01:50,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:01:50,161 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-04 04:01:50,164 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-04 04:01:50,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 04:01:50,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:01:50,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-04 04:01:50,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:01:50,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 04:01:50,442 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:01:50,442 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-04 04:01:50,463 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-04 04:01:50,495 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-04 04:01:50,528 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-04 04:01:50,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:01:50,574 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-04 04:01:50,610 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:01:50,610 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-04 04:01:50,641 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-04 04:01:50,688 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-04 04:01:50,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:01:50,841 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:01:50,841 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-04 04:01:50,850 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:01:50,851 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-04 04:01:50,856 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-04 04:01:50,874 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:01:50,875 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-04 04:01:50,877 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-04 04:02:04,931 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_545 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_79| Int) (|~#a~0.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_545) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_79| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-04 04:02:07,526 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-04 04:02:07,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995896743] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:02:07,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:02:07,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-04 04:02:07,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641513359] [2023-08-04 04:02:07,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:02:07,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-04 04:02:07,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:02:07,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-04 04:02:07,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=286, Unknown=3, NotChecked=36, Total=420 [2023-08-04 04:02:07,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 489 [2023-08-04 04:02:07,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 167 transitions, 893 flow. Second operand has 21 states, 21 states have (on average 151.33333333333334) internal successors, (3178), 21 states have internal predecessors, (3178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:07,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:02:07,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 489 [2023-08-04 04:02:07,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:02:24,030 WARN L233 SmtUtils]: Spent 16.23s 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-04 04:02:26,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:02:28,073 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-04 04:02:30,099 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-04 04:02:32,572 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-04 04:02:34,604 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-04 04:02:38,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:02:40,667 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-04 04:02:42,526 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-04 04:02:44,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:02:46,586 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-04 04:02:47,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:02:49,361 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-04 04:02:51,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:02:52,481 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 [0, 1] [2023-08-04 04:02:55,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:02:57,825 INFO L124 PetriNetUnfolderBase]: 10919/20049 cut-off events. [2023-08-04 04:02:57,825 INFO L125 PetriNetUnfolderBase]: For 23852/23894 co-relation queries the response was YES. [2023-08-04 04:02:57,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62054 conditions, 20049 events. 10919/20049 cut-off events. For 23852/23894 co-relation queries the response was YES. Maximal size of possible extension queue 829. Compared 168471 event pairs, 1855 based on Foata normal form. 60/18134 useless extension candidates. Maximal degree in co-relation 60576. Up to 8385 conditions per place. [2023-08-04 04:02:57,900 INFO L140 encePairwiseOnDemand]: 468/489 looper letters, 359 selfloop transitions, 130 changer transitions 122/620 dead transitions. [2023-08-04 04:02:57,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 620 transitions, 4120 flow [2023-08-04 04:02:57,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-04 04:02:57,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-04 04:02:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3314 transitions. [2023-08-04 04:02:57,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.356689269185233 [2023-08-04 04:02:57,908 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3314 transitions. [2023-08-04 04:02:57,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3314 transitions. [2023-08-04 04:02:57,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:02:57,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3314 transitions. [2023-08-04 04:02:57,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 174.42105263157896) internal successors, (3314), 19 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:57,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 489.0) internal successors, (9780), 20 states have internal predecessors, (9780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:57,925 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 489.0) internal successors, (9780), 20 states have internal predecessors, (9780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:57,925 INFO L175 Difference]: Start difference. First operand has 113 places, 167 transitions, 893 flow. Second operand 19 states and 3314 transitions. [2023-08-04 04:02:57,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 620 transitions, 4120 flow [2023-08-04 04:02:58,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 620 transitions, 4120 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:02:58,057 INFO L231 Difference]: Finished difference. Result has 140 places, 245 transitions, 1864 flow [2023-08-04 04:02:58,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1864, PETRI_PLACES=140, PETRI_TRANSITIONS=245} [2023-08-04 04:02:58,057 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 72 predicate places. [2023-08-04 04:02:58,057 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 245 transitions, 1864 flow [2023-08-04 04:02:58,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 151.33333333333334) internal successors, (3178), 21 states have internal predecessors, (3178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:58,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:58,059 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-04 04:02:58,064 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-04 04:02:58,264 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-04 04:02:58,265 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-04 04:02:58,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:58,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1575418841, now seen corresponding path program 1 times [2023-08-04 04:02:58,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:58,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389368920] [2023-08-04 04:02:58,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:58,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:58,780 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-04 04:02:58,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:02:58,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389368920] [2023-08-04 04:02:58,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389368920] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:02:58,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421262231] [2023-08-04 04:02:58,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:58,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:02:58,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:02:58,785 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-04 04:02:58,788 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-04 04:02:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:58,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-04 04:02:58,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:02:58,915 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-04 04:02:58,981 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:02:58,982 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-04 04:02:59,002 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-04 04:02:59,024 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-04 04:02:59,046 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-04 04:02:59,099 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:02:59,100 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-04 04:02:59,162 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-04 04:02:59,219 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-04 04:02:59,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:02:59,322 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-04 04:02:59,327 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-04 04:03:03,381 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_631 (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_631) |c_~#a~0.base|))) is different from false [2023-08-04 04:03:03,456 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-04 04:03:03,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421262231] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:03:03,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:03:03,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2023-08-04 04:03:03,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835710981] [2023-08-04 04:03:03,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:03:03,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-04 04:03:03,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:03:03,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-04 04:03:03,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=204, Unknown=1, NotChecked=30, Total=306 [2023-08-04 04:03:03,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 489 [2023-08-04 04:03:03,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 245 transitions, 1864 flow. Second operand has 18 states, 18 states have (on average 150.72222222222223) internal successors, (2713), 18 states have internal predecessors, (2713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:03,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:03:03,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 489 [2023-08-04 04:03:03,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:03:07,299 INFO L124 PetriNetUnfolderBase]: 13235/24497 cut-off events. [2023-08-04 04:03:07,300 INFO L125 PetriNetUnfolderBase]: For 67410/67450 co-relation queries the response was YES. [2023-08-04 04:03:07,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88561 conditions, 24497 events. 13235/24497 cut-off events. For 67410/67450 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 213665 event pairs, 3594 based on Foata normal form. 53/22219 useless extension candidates. Maximal degree in co-relation 87416. Up to 12474 conditions per place. [2023-08-04 04:03:07,403 INFO L140 encePairwiseOnDemand]: 468/489 looper letters, 398 selfloop transitions, 106 changer transitions 110/623 dead transitions. [2023-08-04 04:03:07,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 623 transitions, 5132 flow [2023-08-04 04:03:07,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-04 04:03:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-04 04:03:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3074 transitions. [2023-08-04 04:03:07,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34923880936150875 [2023-08-04 04:03:07,409 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3074 transitions. [2023-08-04 04:03:07,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3074 transitions. [2023-08-04 04:03:07,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:03:07,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3074 transitions. [2023-08-04 04:03:07,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 170.77777777777777) internal successors, (3074), 18 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:07,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 489.0) internal successors, (9291), 19 states have internal predecessors, (9291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:07,421 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 489.0) internal successors, (9291), 19 states have internal predecessors, (9291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:07,421 INFO L175 Difference]: Start difference. First operand has 140 places, 245 transitions, 1864 flow. Second operand 18 states and 3074 transitions. [2023-08-04 04:03:07,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 623 transitions, 5132 flow [2023-08-04 04:03:07,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 623 transitions, 5124 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-04 04:03:07,763 INFO L231 Difference]: Finished difference. Result has 169 places, 295 transitions, 2702 flow [2023-08-04 04:03:07,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1856, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2702, PETRI_PLACES=169, PETRI_TRANSITIONS=295} [2023-08-04 04:03:07,763 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 101 predicate places. [2023-08-04 04:03:07,763 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 295 transitions, 2702 flow [2023-08-04 04:03:07,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 150.72222222222223) internal successors, (2713), 18 states have internal predecessors, (2713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:07,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:03:07,764 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-04 04:03:07,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-04 04:03:07,969 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-04 04:03:07,969 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-04 04:03:07,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:03:07,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1405618938, now seen corresponding path program 3 times [2023-08-04 04:03:07,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:03:07,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466929223] [2023-08-04 04:03:07,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:03:07,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:03:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:03:08,293 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-04 04:03:08,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:03:08,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466929223] [2023-08-04 04:03:08,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466929223] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:03:08,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596184855] [2023-08-04 04:03:08,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 04:03:08,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:03:08,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:03:08,295 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-04 04:03:08,298 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-04 04:03:08,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-04 04:03:08,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:03:08,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-04 04:03:08,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:03:08,450 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-04 04:03:08,609 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-04 04:03:08,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-08-04 04:03:08,641 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-04 04:03:08,684 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-04 04:03:08,707 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-04 04:03:08,749 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:03:08,750 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-04 04:03:08,789 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-04 04:03:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 04:03:08,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:03:08,906 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-04 04:03:08,909 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-04 04:03:21,061 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-04 04:03:21,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596184855] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:03:21,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:03:21,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-04 04:03:21,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747400883] [2023-08-04 04:03:21,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:03:21,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-04 04:03:21,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:03:21,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-04 04:03:21,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=196, Unknown=4, NotChecked=0, Total=272 [2023-08-04 04:03:23,138 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-04 04:03:25,171 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-04 04:03:27,204 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-04 04:03:29,239 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-04 04:03:31,314 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-04 04:03:33,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:03:35,367 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-04 04:03:37,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 [1] [2023-08-04 04:03:39,412 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-04 04:03:41,437 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-04 04:03:43,462 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-04 04:03:45,489 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-04 04:03:47,596 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-04 04:03:49,631 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-04 04:03:51,657 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-04 04:03:53,684 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-04 04:03:55,710 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-04 04:03:57,746 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-04 04:03:59,766 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-04 04:04:01,882 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-04 04:04:03,962 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-04 04:04:06,000 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-04 04:04:08,024 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-04 04:04:10,091 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-04 04:04:12,126 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-04 04:04:12,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 489 [2023-08-04 04:04:12,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 295 transitions, 2702 flow. Second operand has 17 states, 17 states have (on average 151.7058823529412) internal successors, (2579), 17 states have internal predecessors, (2579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:12,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:04:12,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 489 [2023-08-04 04:04:12,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:04:15,586 INFO L124 PetriNetUnfolderBase]: 14927/27748 cut-off events. [2023-08-04 04:04:15,587 INFO L125 PetriNetUnfolderBase]: For 131601/131665 co-relation queries the response was YES. [2023-08-04 04:04:15,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112889 conditions, 27748 events. 14927/27748 cut-off events. For 131601/131665 co-relation queries the response was YES. Maximal size of possible extension queue 1120. Compared 247539 event pairs, 3791 based on Foata normal form. 60/25208 useless extension candidates. Maximal degree in co-relation 111684. Up to 14944 conditions per place. [2023-08-04 04:04:15,789 INFO L140 encePairwiseOnDemand]: 472/489 looper letters, 370 selfloop transitions, 103 changer transitions 131/613 dead transitions. [2023-08-04 04:04:15,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 613 transitions, 6158 flow [2023-08-04 04:04:15,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-04 04:04:15,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-04 04:04:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2271 transitions. [2023-08-04 04:04:15,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3572439830108542 [2023-08-04 04:04:15,792 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2271 transitions. [2023-08-04 04:04:15,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2271 transitions. [2023-08-04 04:04:15,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:04:15,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2271 transitions. [2023-08-04 04:04:15,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 174.69230769230768) internal successors, (2271), 13 states have internal predecessors, (2271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:15,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 489.0) internal successors, (6846), 14 states have internal predecessors, (6846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:15,800 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 489.0) internal successors, (6846), 14 states have internal predecessors, (6846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:15,800 INFO L175 Difference]: Start difference. First operand has 169 places, 295 transitions, 2702 flow. Second operand 13 states and 2271 transitions. [2023-08-04 04:04:15,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 613 transitions, 6158 flow [2023-08-04 04:04:16,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 613 transitions, 6069 flow, removed 36 selfloop flow, removed 2 redundant places. [2023-08-04 04:04:16,995 INFO L231 Difference]: Finished difference. Result has 185 places, 314 transitions, 3197 flow [2023-08-04 04:04:16,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=2621, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3197, PETRI_PLACES=185, PETRI_TRANSITIONS=314} [2023-08-04 04:04:16,996 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 117 predicate places. [2023-08-04 04:04:16,996 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 314 transitions, 3197 flow [2023-08-04 04:04:16,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 151.7058823529412) internal successors, (2579), 17 states have internal predecessors, (2579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:16,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:04:16,997 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-04 04:04:17,004 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-04 04:04:17,201 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-04 04:04:17,201 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-04 04:04:17,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:04:17,201 INFO L85 PathProgramCache]: Analyzing trace with hash 843443091, now seen corresponding path program 2 times [2023-08-04 04:04:17,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:04:17,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279035897] [2023-08-04 04:04:17,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:04:17,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:04:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:04:17,617 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-04 04:04:17,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:04:17,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279035897] [2023-08-04 04:04:17,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279035897] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:04:17,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045471215] [2023-08-04 04:04:17,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:04:17,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:04:17,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:04:17,620 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-04 04:04:17,622 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-04 04:04:17,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 04:04:17,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:04:17,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-04 04:04:17,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:04:17,785 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-04 04:04:17,928 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-04 04:04:17,928 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-08-04 04:04:17,968 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-04 04:04:18,011 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-04 04:04:18,030 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-04 04:04:18,061 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:04:18,062 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-04 04:04:18,096 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-04 04:04:18,140 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-04 04:04:18,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:04:18,199 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-04 04:04:18,203 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2023-08-04 04:04:20,231 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (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_801) |c_~#a~0.base|))) is different from false [2023-08-04 04:04:20,319 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-04 04:04:20,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045471215] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:04:20,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:04:20,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2023-08-04 04:04:20,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779359543] [2023-08-04 04:04:20,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:04:20,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-04 04:04:20,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:04:20,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-04 04:04:20,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=230, Unknown=1, NotChecked=32, Total=342 [2023-08-04 04:04:20,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 489 [2023-08-04 04:04:20,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 314 transitions, 3197 flow. Second operand has 19 states, 19 states have (on average 149.6315789473684) internal successors, (2843), 19 states have internal predecessors, (2843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:20,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:04:20,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 489 [2023-08-04 04:04:20,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:04:23,316 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-04 04:04:25,330 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-04 04:04:27,336 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-04 04:04:31,637 INFO L124 PetriNetUnfolderBase]: 16128/30289 cut-off events. [2023-08-04 04:04:31,637 INFO L125 PetriNetUnfolderBase]: For 171649/171733 co-relation queries the response was YES. [2023-08-04 04:04:31,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127407 conditions, 30289 events. 16128/30289 cut-off events. For 171649/171733 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 276945 event pairs, 4030 based on Foata normal form. 63/27592 useless extension candidates. Maximal degree in co-relation 126183. Up to 15623 conditions per place. [2023-08-04 04:04:31,861 INFO L140 encePairwiseOnDemand]: 468/489 looper letters, 421 selfloop transitions, 111 changer transitions 144/685 dead transitions. [2023-08-04 04:04:31,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 685 transitions, 6945 flow [2023-08-04 04:04:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-04 04:04:31,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-04 04:04:31,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3383 transitions. [2023-08-04 04:04:31,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34591002044989777 [2023-08-04 04:04:31,864 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3383 transitions. [2023-08-04 04:04:31,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3383 transitions. [2023-08-04 04:04:31,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:04:31,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3383 transitions. [2023-08-04 04:04:31,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 169.15) internal successors, (3383), 20 states have internal predecessors, (3383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:31,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 489.0) internal successors, (10269), 21 states have internal predecessors, (10269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:31,872 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 489.0) internal successors, (10269), 21 states have internal predecessors, (10269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:31,872 INFO L175 Difference]: Start difference. First operand has 185 places, 314 transitions, 3197 flow. Second operand 20 states and 3383 transitions. [2023-08-04 04:04:31,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 685 transitions, 6945 flow [2023-08-04 04:04:32,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 685 transitions, 6716 flow, removed 58 selfloop flow, removed 6 redundant places. [2023-08-04 04:04:32,734 INFO L231 Difference]: Finished difference. Result has 205 places, 334 transitions, 3736 flow [2023-08-04 04:04:32,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=3037, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3736, PETRI_PLACES=205, PETRI_TRANSITIONS=334} [2023-08-04 04:04:32,735 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 137 predicate places. [2023-08-04 04:04:32,735 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 334 transitions, 3736 flow [2023-08-04 04:04:32,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 149.6315789473684) internal successors, (2843), 19 states have internal predecessors, (2843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:32,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:04:32,736 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-04 04:04:32,740 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-04 04:04:32,939 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-04 04:04:32,939 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-04 04:04:32,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:04:32,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1333605401, now seen corresponding path program 3 times [2023-08-04 04:04:32,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:04:32,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119486997] [2023-08-04 04:04:32,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:04:32,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:04:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:04:33,523 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-04 04:04:33,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:04:33,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119486997] [2023-08-04 04:04:33,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119486997] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:04:33,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582436893] [2023-08-04 04:04:33,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 04:04:33,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:04:33,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:04:33,525 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-04 04:04:33,529 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-04 04:04:33,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-04 04:04:33,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:04:33,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-04 04:04:33,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:04:33,678 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-04 04:04:33,777 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:04:33,778 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-04 04:04:33,805 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-04 04:04:33,837 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-04 04:04:33,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-04 04:04:33,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:04:33,905 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-04 04:04:33,931 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-04 04:04:33,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:04:33,967 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-04 04:04:34,010 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:04:34,010 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-04 04:04:34,056 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-04 04:04:34,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:04:34,131 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_891 Int) (v_ArrVal_892 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_97| Int)) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_97| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_892) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 (- 24))) 0)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_891) (+ |c_~#a~0.offset| .cse0)) 0)))) is different from false [2023-08-04 04:04:34,162 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:04:34,162 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-04 04:04:34,172 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:04:34,172 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-04 04:04:34,177 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-04 04:04:36,234 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_886 (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_886) |c_~#a~0.base|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-04 04:04:38,651 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-04 04:04:38,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582436893] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:04:38,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:04:38,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-08-04 04:04:38,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852292494] [2023-08-04 04:04:38,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:04:38,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-04 04:04:38,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:04:38,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-04 04:04:38,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=266, Unknown=2, NotChecked=74, Total=462 [2023-08-04 04:04:38,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 489 [2023-08-04 04:04:38,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 334 transitions, 3736 flow. Second operand has 22 states, 22 states have (on average 149.27272727272728) internal successors, (3284), 22 states have internal predecessors, (3284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:38,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:04:38,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 489 [2023-08-04 04:04:38,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:04:41,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 04:04:43,079 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-04 04:04:48,454 INFO L124 PetriNetUnfolderBase]: 16405/31049 cut-off events. [2023-08-04 04:04:48,454 INFO L125 PetriNetUnfolderBase]: For 195351/195484 co-relation queries the response was YES. [2023-08-04 04:04:48,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133861 conditions, 31049 events. 16405/31049 cut-off events. For 195351/195484 co-relation queries the response was YES. Maximal size of possible extension queue 1287. Compared 287216 event pairs, 3584 based on Foata normal form. 13/28272 useless extension candidates. Maximal degree in co-relation 132623. Up to 16717 conditions per place. [2023-08-04 04:04:48,785 INFO L140 encePairwiseOnDemand]: 472/489 looper letters, 380 selfloop transitions, 165 changer transitions 112/666 dead transitions. [2023-08-04 04:04:48,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 666 transitions, 7564 flow [2023-08-04 04:04:48,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-04 04:04:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-04 04:04:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2416 transitions. [2023-08-04 04:04:48,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35290680689453696 [2023-08-04 04:04:48,788 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2416 transitions. [2023-08-04 04:04:48,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2416 transitions. [2023-08-04 04:04:48,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:04:48,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2416 transitions. [2023-08-04 04:04:48,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 172.57142857142858) internal successors, (2416), 14 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:48,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 489.0) internal successors, (7335), 15 states have internal predecessors, (7335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:48,796 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 489.0) internal successors, (7335), 15 states have internal predecessors, (7335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:48,796 INFO L175 Difference]: Start difference. First operand has 205 places, 334 transitions, 3736 flow. Second operand 14 states and 2416 transitions. [2023-08-04 04:04:48,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 666 transitions, 7564 flow [2023-08-04 04:04:50,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 666 transitions, 7030 flow, removed 192 selfloop flow, removed 9 redundant places. [2023-08-04 04:04:50,453 INFO L231 Difference]: Finished difference. Result has 209 places, 379 transitions, 4499 flow [2023-08-04 04:04:50,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=3395, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4499, PETRI_PLACES=209, PETRI_TRANSITIONS=379} [2023-08-04 04:04:50,453 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 141 predicate places. [2023-08-04 04:04:50,454 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 379 transitions, 4499 flow [2023-08-04 04:04:50,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 149.27272727272728) internal successors, (3284), 22 states have internal predecessors, (3284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:50,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:04:50,454 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-04 04:04:50,458 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-04 04:04:50,654 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-04 04:04:50,655 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-04 04:04:50,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:04:50,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1372677484, now seen corresponding path program 4 times [2023-08-04 04:04:50,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:04:50,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821284612] [2023-08-04 04:04:50,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:04:50,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:04:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:04:51,251 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-04 04:04:51,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:04:51,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821284612] [2023-08-04 04:04:51,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821284612] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:04:51,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354230421] [2023-08-04 04:04:51,252 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-04 04:04:51,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:04:51,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:04:51,253 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 04:04:51,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-04 04:04:51,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-04 04:04:51,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:04:51,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-04 04:04:51,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:04:51,403 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-04 04:04:51,476 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:04:51,477 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-04 04:04:51,495 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-04 04:04:51,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-04 04:04:51,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:04:51,551 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-04 04:04:51,593 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-04 04:04:51,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:04:51,627 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-04 04:04:51,658 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-04 04:04:51,702 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:04:51,702 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-04 04:04:51,734 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-04 04:04:51,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:04:51,825 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_89| Int) (v_ArrVal_976 Int)) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_89| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_976)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_979) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_978) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 (- 24))) 0))))) is different from false [2023-08-04 04:04:51,871 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:04:51,871 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-04 04:04:51,879 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:04:51,879 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-04 04:04:51,883 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-04 04:04:51,950 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_99| Int) (v_ArrVal_979 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_89| Int) (v_ArrVal_976 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_99| 28) |~#a~0.offset|) v_ArrVal_976)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_979) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_89| 28) |~#a~0.offset|)) 0))) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_99| Int) (v_ArrVal_979 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_89| Int) (v_ArrVal_976 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_99| 28) |~#a~0.offset|) v_ArrVal_976)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_979) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_89| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_89| |v_t_funThread1of2ForFork0_~i~0#1_99|))))) is different from false [2023-08-04 04:04:52,018 WARN L839 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_99| Int) (v_ArrVal_979 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_89| Int) (v_ArrVal_976 Int) (v_ArrVal_972 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_972))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_99| 28) |~#a~0.offset|) v_ArrVal_976))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_979) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_89| 28) |~#a~0.offset|)) 0))) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_99| Int) (v_ArrVal_979 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_89| Int) (v_ArrVal_976 Int) (v_ArrVal_972 (Array Int Int))) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_972))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_99| 28) |~#a~0.offset|) v_ArrVal_976))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_979) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_89| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_89| |v_t_funThread1of2ForFork0_~i~0#1_99|)))) is different from false [2023-08-04 04:05:00,083 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:05:00,268 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-04 04:05:00,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354230421] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:05:00,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:05:00,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-08-04 04:05:00,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661949792] [2023-08-04 04:05:00,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:05:00,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-04 04:05:00,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:05:00,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-04 04:05:00,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=269, Unknown=6, NotChecked=114, Total=506 [2023-08-04 04:05:00,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 489 [2023-08-04 04:05:00,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 379 transitions, 4499 flow. Second operand has 23 states, 23 states have (on average 151.2173913043478) internal successors, (3478), 23 states have internal predecessors, (3478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:05:00,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:05:00,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 489 [2023-08-04 04:05:00,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:05:02,450 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-04 04:05:04,460 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-04 04:05:06,475 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-04 04:05:11,918 INFO L124 PetriNetUnfolderBase]: 16533/31457 cut-off events. [2023-08-04 04:05:11,919 INFO L125 PetriNetUnfolderBase]: For 206234/206318 co-relation queries the response was YES. [2023-08-04 04:05:12,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140743 conditions, 31457 events. 16533/31457 cut-off events. For 206234/206318 co-relation queries the response was YES. Maximal size of possible extension queue 1324. Compared 293553 event pairs, 3997 based on Foata normal form. 10/28671 useless extension candidates. Maximal degree in co-relation 139375. Up to 18272 conditions per place. [2023-08-04 04:05:12,206 INFO L140 encePairwiseOnDemand]: 473/489 looper letters, 364 selfloop transitions, 171 changer transitions 138/682 dead transitions. [2023-08-04 04:05:12,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 682 transitions, 8168 flow [2023-08-04 04:05:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 04:05:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 04:05:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2106 transitions. [2023-08-04 04:05:12,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588957055214724 [2023-08-04 04:05:12,209 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2106 transitions. [2023-08-04 04:05:12,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2106 transitions. [2023-08-04 04:05:12,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:05:12,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2106 transitions. [2023-08-04 04:05:12,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 175.5) internal successors, (2106), 12 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:05:12,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 489.0) internal successors, (6357), 13 states have internal predecessors, (6357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:05:12,214 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 489.0) internal successors, (6357), 13 states have internal predecessors, (6357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:05:12,214 INFO L175 Difference]: Start difference. First operand has 209 places, 379 transitions, 4499 flow. Second operand 12 states and 2106 transitions. [2023-08-04 04:05:12,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 682 transitions, 8168 flow [2023-08-04 04:05:14,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 682 transitions, 7989 flow, removed 47 selfloop flow, removed 4 redundant places. [2023-08-04 04:05:14,310 INFO L231 Difference]: Finished difference. Result has 221 places, 394 transitions, 4970 flow [2023-08-04 04:05:14,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=4320, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4970, PETRI_PLACES=221, PETRI_TRANSITIONS=394} [2023-08-04 04:05:14,311 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 153 predicate places. [2023-08-04 04:05:14,311 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 394 transitions, 4970 flow [2023-08-04 04:05:14,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 151.2173913043478) internal successors, (3478), 23 states have internal predecessors, (3478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:05:14,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:05:14,311 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-04 04:05:14,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-04 04:05:14,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:05:14,515 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-04 04:05:14,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:05:14,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1137459737, now seen corresponding path program 1 times [2023-08-04 04:05:14,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:05:14,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861031997] [2023-08-04 04:05:14,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:05:14,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:05:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 04:05:14,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 04:05:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 04:05:14,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 04:05:14,554 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 04:05:14,555 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 04:05:14,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 04:05:14,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 04:05:14,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 04:05:14,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-04 04:05:14,555 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1] [2023-08-04 04:05:14,556 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 04:05:14,557 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 04:05:14,557 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 04:05:14,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 04:05:14 BasicIcfg [2023-08-04 04:05:14,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 04:05:14,603 INFO L158 Benchmark]: Toolchain (without parser) took 261728.12ms. Allocated memory was 520.1MB in the beginning and 6.5GB in the end (delta: 6.0GB). Free memory was 462.7MB in the beginning and 4.6GB in the end (delta: -4.1GB). Peak memory consumption was 1.9GB. Max. memory is 16.0GB. [2023-08-04 04:05:14,603 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 333.4MB. Free memory was 280.2MB in the beginning and 280.0MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 04:05:14,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.75ms. Allocated memory is still 520.1MB. Free memory was 462.7MB in the beginning and 432.5MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-04 04:05:14,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.86ms. Allocated memory is still 520.1MB. Free memory was 432.5MB in the beginning and 430.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 04:05:14,604 INFO L158 Benchmark]: Boogie Preprocessor took 44.60ms. Allocated memory is still 520.1MB. Free memory was 430.4MB in the beginning and 428.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 04:05:14,604 INFO L158 Benchmark]: RCFGBuilder took 418.09ms. Allocated memory is still 520.1MB. Free memory was 428.3MB in the beginning and 409.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-04 04:05:14,604 INFO L158 Benchmark]: TraceAbstraction took 260649.55ms. Allocated memory was 520.1MB in the beginning and 6.5GB in the end (delta: 6.0GB). Free memory was 408.2MB in the beginning and 4.6GB in the end (delta: -4.2GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. [2023-08-04 04:05:14,605 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.11ms. Allocated memory is still 333.4MB. Free memory was 280.2MB in the beginning and 280.0MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 541.75ms. Allocated memory is still 520.1MB. Free memory was 462.7MB in the beginning and 432.5MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 67.86ms. Allocated memory is still 520.1MB. Free memory was 432.5MB in the beginning and 430.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 44.60ms. Allocated memory is still 520.1MB. Free memory was 430.4MB in the beginning and 428.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 418.09ms. Allocated memory is still 520.1MB. Free memory was 428.3MB in the beginning and 409.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 260649.55ms. Allocated memory was 520.1MB in the beginning and 6.5GB in the end (delta: 6.0GB). Free memory was 408.2MB in the beginning and 4.6GB in the end (delta: -4.2GB). Peak memory consumption was 1.8GB. 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.6s, 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.5s, 161 PlacesBefore, 45 PlacesAfterwards, 188 TransitionsBefore, 66 TransitionsAfterwards, 10792 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 98 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 18 ConcurrentYvCompositions, 6 ChoiceCompositions, 162 TotalNumberOfCompositions, 17496 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8947, independent: 8676, independent conditional: 0, independent unconditional: 8676, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5414, independent: 5353, independent conditional: 0, independent unconditional: 5353, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8947, independent: 3323, independent conditional: 0, independent unconditional: 3323, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 5414, unknown conditional: 0, unknown unconditional: 5414] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 181, Positive conditional cache size: 0, Positive unconditional cache size: 181, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 226 PlacesBefore, 68 PlacesAfterwards, 266 TransitionsBefore, 100 TransitionsAfterwards, 33228 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 145 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 30 ConcurrentYvCompositions, 8 ChoiceCompositions, 223 TotalNumberOfCompositions, 57444 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28305, independent: 27868, independent conditional: 0, independent unconditional: 27868, dependent: 437, dependent conditional: 0, dependent unconditional: 437, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 16620, independent: 16512, independent conditional: 0, independent unconditional: 16512, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 28305, independent: 11356, independent conditional: 0, independent unconditional: 11356, dependent: 329, dependent conditional: 0, dependent unconditional: 329, unknown: 16620, unknown conditional: 0, unknown unconditional: 16620] , Statistics on independence cache: Total cache size (in pairs): 739, Positive cache size: 696, Positive conditional cache size: 0, Positive unconditional cache size: 696, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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=1, i=10, 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=1, i=10, pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0))=-2, t_ids={5:0}] [L954] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=1, i=1, i=10, 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=1, p={4:0}] [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=1, i=10, pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0))=-1, t_ids={5:0}] [L954] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=1, i=10, i=2, 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=1, p={4:0}] [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 with 1 thread instances CFG has 3 procedures, 222 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.9s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 366 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 275 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 2 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=4, InterpolantAutomatonStates: 31, 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.7s InterpolantComputationTime, 100 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 321 SizeOfPredicates, 3 NumberOfNonLiveVariables, 526 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 23/58 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 281 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 251.0s, OverallIterations: 14, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 166.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 175 mSolverCounterUnknown, 5256 SdHoareTripleChecker+Valid, 112.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5001 mSDsluCounter, 1446 SdHoareTripleChecker+Invalid, 110.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4458 IncrementalHoareTripleChecker+Unchecked, 1415 mSDsCounter, 723 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11879 IncrementalHoareTripleChecker+Invalid, 17235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 723 mSolverCounterUnsat, 31 mSDtfsCounter, 11879 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 638 GetRequests, 385 SyntacticMatches, 15 SemanticMatches, 238 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1476 ImplicationChecksByTransitivity, 90.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4970occurred in iteration=13, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 77.2s InterpolantComputationTime, 567 NumberOfCodeBlocks, 547 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 735 ConstructedInterpolants, 191 QuantifiedInterpolants, 14183 SizeOfPredicates, 84 NumberOfNonLiveVariables, 2166 ConjunctsInSsa, 329 ConjunctsInUnsatCore, 33 InterpolantComputations, 4 PerfectInterpolantSequences, 1253/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 - 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.6s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, 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.2s 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 RESULT: Ultimate proved your program to be incorrect! [2023-08-04 04:05:14,699 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...