/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_75-tricky_address2_racefree_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 21:26:37,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 21:26:37,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 21:26:37,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 21:26:37,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 21:26:37,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 21:26:37,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 21:26:37,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 21:26:37,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 21:26:37,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 21:26:37,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 21:26:37,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 21:26:37,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 21:26:37,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 21:26:37,155 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 21:26:37,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 21:26:37,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 21:26:37,156 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 21:26:37,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 21:26:37,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 21:26:37,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 21:26:37,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 21:26:37,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 21:26:37,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 21:26:37,158 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 21:26:37,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 21:26:37,158 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 21:26:37,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 21:26:37,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 21:26:37,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 21:26:37,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:26:37,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 21:26:37,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 21:26:37,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 21:26:37,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 21:26:37,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 21:26:37,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 21:26:37,161 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 21:26:37,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 21:26:37,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 21:26:37,162 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 21:26:37,162 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-03 21:26:37,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 21:26:37,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 21:26:37,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 21:26:37,430 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 21:26:37,430 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 21:26:37,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_75-tricky_address2_racefree_bound2.i [2023-08-03 21:26:38,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 21:26:38,802 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 21:26:38,802 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_75-tricky_address2_racefree_bound2.i [2023-08-03 21:26:38,822 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24774bcff/51fd3b0622ff4cbd9583c192c6a31245/FLAGe9959b9db [2023-08-03 21:26:38,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24774bcff/51fd3b0622ff4cbd9583c192c6a31245 [2023-08-03 21:26:38,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 21:26:38,838 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 21:26:38,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 21:26:38,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 21:26:38,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 21:26:38,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:26:38" (1/1) ... [2023-08-03 21:26:38,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77035ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:38, skipping insertion in model container [2023-08-03 21:26:38,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:26:38" (1/1) ... [2023-08-03 21:26:38,887 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 21:26:39,249 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_75-tricky_address2_racefree_bound2.i[41323,41336] [2023-08-03 21:26:39,280 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:26:39,302 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 21:26:39,322 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-03 21:26:39,324 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-03 21:26:39,330 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-03 21:26:39,338 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_75-tricky_address2_racefree_bound2.i[41323,41336] [2023-08-03 21:26:39,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:26:39,405 INFO L206 MainTranslator]: Completed translation [2023-08-03 21:26:39,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:39 WrapperNode [2023-08-03 21:26:39,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 21:26:39,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 21:26:39,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 21:26:39,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 21:26:39,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:39" (1/1) ... [2023-08-03 21:26:39,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:39" (1/1) ... [2023-08-03 21:26:39,468 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 190 [2023-08-03 21:26:39,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 21:26:39,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 21:26:39,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 21:26:39,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 21:26:39,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:39" (1/1) ... [2023-08-03 21:26:39,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:39" (1/1) ... [2023-08-03 21:26:39,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:39" (1/1) ... [2023-08-03 21:26:39,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:39" (1/1) ... [2023-08-03 21:26:39,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:39" (1/1) ... [2023-08-03 21:26:39,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:39" (1/1) ... [2023-08-03 21:26:39,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:39" (1/1) ... [2023-08-03 21:26:39,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:39" (1/1) ... [2023-08-03 21:26:39,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 21:26:39,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 21:26:39,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 21:26:39,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 21:26:39,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:39" (1/1) ... [2023-08-03 21:26:39,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:26:39,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:39,564 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-03 21:26:39,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-03 21:26:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 21:26:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 21:26:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 21:26:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 21:26:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-03 21:26:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 21:26:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-03 21:26:39,616 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-03 21:26:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 21:26:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 21:26:39,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 21:26:39,618 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 21:26:39,783 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 21:26:39,786 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 21:26:40,006 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 21:26:40,012 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 21:26:40,013 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-03 21:26:40,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:26:40 BoogieIcfgContainer [2023-08-03 21:26:40,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 21:26:40,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 21:26:40,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 21:26:40,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 21:26:40,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 09:26:38" (1/3) ... [2023-08-03 21:26:40,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2e5c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:26:40, skipping insertion in model container [2023-08-03 21:26:40,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:39" (2/3) ... [2023-08-03 21:26:40,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2e5c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:26:40, skipping insertion in model container [2023-08-03 21:26:40,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:26:40" (3/3) ... [2023-08-03 21:26:40,029 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_75-tricky_address2_racefree_bound2.i [2023-08-03 21:26:40,035 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 21:26:40,041 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 21:26:40,041 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 21:26:40,041 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 21:26:40,109 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-03 21:26:40,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 190 transitions, 388 flow [2023-08-03 21:26:40,213 INFO L124 PetriNetUnfolderBase]: 45/260 cut-off events. [2023-08-03 21:26:40,213 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-03 21:26:40,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 260 events. 45/260 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 817 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-03 21:26:40,220 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 190 transitions, 388 flow [2023-08-03 21:26:40,226 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 185 transitions, 375 flow [2023-08-03 21:26:40,229 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:26:40,238 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-03 21:26:40,240 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-03 21:26:40,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 185 transitions, 375 flow [2023-08-03 21:26:40,312 INFO L124 PetriNetUnfolderBase]: 44/255 cut-off events. [2023-08-03 21:26:40,313 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:26:40,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 255 events. 44/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-03 21:26:40,322 INFO L119 LiptonReduction]: Number of co-enabled transitions 10336 [2023-08-03 21:26:43,011 INFO L134 LiptonReduction]: Checked pairs total: 15158 [2023-08-03 21:26:43,011 INFO L136 LiptonReduction]: Total number of compositions: 151 [2023-08-03 21:26:43,033 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 21:26:43,040 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;@771140f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:26:43,040 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-03 21:26:43,047 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:26:43,047 INFO L124 PetriNetUnfolderBase]: 7/31 cut-off events. [2023-08-03 21:26:43,048 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:26:43,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:43,048 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-03 21:26:43,049 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:26:43,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:43,053 INFO L85 PathProgramCache]: Analyzing trace with hash -164803575, now seen corresponding path program 1 times [2023-08-03 21:26:43,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:43,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823764647] [2023-08-03 21:26:43,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:43,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 21:26:43,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:43,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823764647] [2023-08-03 21:26:43,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823764647] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:26:43,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:26:43,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:26:43,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298115731] [2023-08-03 21:26:43,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:26:43,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:26:43,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:43,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:26:43,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:26:43,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2023-08-03 21:26:43,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 65 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:43,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:43,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2023-08-03 21:26:43,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:43,459 INFO L124 PetriNetUnfolderBase]: 301/651 cut-off events. [2023-08-03 21:26:43,460 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:26:43,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 651 events. 301/651 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3189 event pairs, 266 based on Foata normal form. 107/643 useless extension candidates. Maximal degree in co-relation 1189. Up to 588 conditions per place. [2023-08-03 21:26:43,463 INFO L140 encePairwiseOnDemand]: 318/341 looper letters, 20 selfloop transitions, 2 changer transitions 19/46 dead transitions. [2023-08-03 21:26:43,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 173 flow [2023-08-03 21:26:43,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:26:43,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:26:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2023-08-03 21:26:43,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512218963831867 [2023-08-03 21:26:43,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2023-08-03 21:26:43,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2023-08-03 21:26:43,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:43,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2023-08-03 21:26:43,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:43,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:43,500 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:43,501 INFO L175 Difference]: Start difference. First operand has 45 places, 65 transitions, 135 flow. Second operand 3 states and 524 transitions. [2023-08-03 21:26:43,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 173 flow [2023-08-03 21:26:43,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:26:43,506 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 69 flow [2023-08-03 21:26:43,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2023-08-03 21:26:43,511 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-08-03 21:26:43,512 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 69 flow [2023-08-03 21:26:43,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:43,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:43,512 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-03 21:26:43,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 21:26:43,513 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:26:43,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:43,513 INFO L85 PathProgramCache]: Analyzing trace with hash 716448256, now seen corresponding path program 1 times [2023-08-03 21:26:43,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:43,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988600799] [2023-08-03 21:26:43,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:43,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 21:26:43,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:43,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988600799] [2023-08-03 21:26:43,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988600799] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:26:43,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885368123] [2023-08-03 21:26:43,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:43,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:43,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:43,658 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:26:43,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 21:26:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:43,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:26:43,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:26:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 21:26:43,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:26:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 21:26:43,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885368123] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:26:43,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:26:43,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-03 21:26:43,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637891751] [2023-08-03 21:26:43,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:26:43,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 21:26:43,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:43,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 21:26:43,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-03 21:26:43,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 341 [2023-08-03 21:26:43,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 69 flow. Second operand has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:43,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:43,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 341 [2023-08-03 21:26:43,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:43,886 INFO L124 PetriNetUnfolderBase]: 47/128 cut-off events. [2023-08-03 21:26:43,887 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:26:43,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 128 events. 47/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 359 event pairs, 42 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 243. Up to 108 conditions per place. [2023-08-03 21:26:43,888 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 20 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-08-03 21:26:43,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 131 flow [2023-08-03 21:26:43,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 21:26:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 21:26:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 952 transitions. [2023-08-03 21:26:43,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46529814271749753 [2023-08-03 21:26:43,891 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 952 transitions. [2023-08-03 21:26:43,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 952 transitions. [2023-08-03 21:26:43,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:43,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 952 transitions. [2023-08-03 21:26:43,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.66666666666666) internal successors, (952), 6 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:43,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:43,898 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:43,898 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 69 flow. Second operand 6 states and 952 transitions. [2023-08-03 21:26:43,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 131 flow [2023-08-03 21:26:43,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 127 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 21:26:43,899 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2023-08-03 21:26:43,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-08-03 21:26:43,900 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-08-03 21:26:43,900 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2023-08-03 21:26:43,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:43,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:43,901 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-03 21:26:43,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 21:26:44,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:44,108 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:26:44,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:44,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1278120393, now seen corresponding path program 2 times [2023-08-03 21:26:44,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:44,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317101971] [2023-08-03 21:26:44,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:44,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 21:26:44,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:44,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317101971] [2023-08-03 21:26:44,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317101971] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:26:44,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366232826] [2023-08-03 21:26:44,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:26:44,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:44,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:44,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:26:44,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 21:26:44,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:26:44,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:26:44,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 21:26:44,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:26:44,364 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 21:26:44,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:26:44,422 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 21:26:44,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366232826] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:26:44,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:26:44,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-03 21:26:44,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133567188] [2023-08-03 21:26:44,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:26:44,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 21:26:44,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:44,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 21:26:44,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-03 21:26:44,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 341 [2023-08-03 21:26:44,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 101 flow. Second operand has 13 states, 13 states have (on average 155.30769230769232) internal successors, (2019), 13 states have internal predecessors, (2019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:44,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:44,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 341 [2023-08-03 21:26:44,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:44,558 INFO L124 PetriNetUnfolderBase]: 47/134 cut-off events. [2023-08-03 21:26:44,558 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-03 21:26:44,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 134 events. 47/134 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 359 event pairs, 42 based on Foata normal form. 6/116 useless extension candidates. Maximal degree in co-relation 234. Up to 108 conditions per place. [2023-08-03 21:26:44,559 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 20 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2023-08-03 21:26:44,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 199 flow [2023-08-03 21:26:44,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-03 21:26:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-03 21:26:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1885 transitions. [2023-08-03 21:26:44,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46065493646138805 [2023-08-03 21:26:44,564 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1885 transitions. [2023-08-03 21:26:44,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1885 transitions. [2023-08-03 21:26:44,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:44,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1885 transitions. [2023-08-03 21:26:44,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 157.08333333333334) internal successors, (1885), 12 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:44,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 341.0) internal successors, (4433), 13 states have internal predecessors, (4433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:44,577 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 341.0) internal successors, (4433), 13 states have internal predecessors, (4433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:44,577 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 12 states and 1885 transitions. [2023-08-03 21:26:44,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 199 flow [2023-08-03 21:26:44,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 185 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-03 21:26:44,579 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 171 flow [2023-08-03 21:26:44,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=171, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2023-08-03 21:26:44,580 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-08-03 21:26:44,580 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 171 flow [2023-08-03 21:26:44,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 155.30769230769232) internal successors, (2019), 13 states have internal predecessors, (2019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:44,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:44,581 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-03 21:26:44,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 21:26:44,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-03 21:26:44,787 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:26:44,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:44,787 INFO L85 PathProgramCache]: Analyzing trace with hash 766826089, now seen corresponding path program 3 times [2023-08-03 21:26:44,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:44,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711395047] [2023-08-03 21:26:44,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:44,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:26:44,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 21:26:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:26:44,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 21:26:44,857 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 21:26:44,858 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-03 21:26:44,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-03 21:26:44,860 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-03 21:26:44,861 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (1/2) [2023-08-03 21:26:44,862 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 21:26:44,862 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 21:26:44,888 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-03 21:26:44,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:44,933 INFO L124 PetriNetUnfolderBase]: 75/424 cut-off events. [2023-08-03 21:26:44,933 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 21:26:44,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-08-03 21:26:44,937 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:44,940 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:44,940 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:26:44,940 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:44,940 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:44,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:44,980 INFO L124 PetriNetUnfolderBase]: 75/424 cut-off events. [2023-08-03 21:26:44,981 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 21:26:44,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-08-03 21:26:45,000 INFO L119 LiptonReduction]: Number of co-enabled transitions 31416 [2023-08-03 21:26:48,032 INFO L134 LiptonReduction]: Checked pairs total: 55124 [2023-08-03 21:26:48,032 INFO L136 LiptonReduction]: Total number of compositions: 218 [2023-08-03 21:26:48,034 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 21:26:48,035 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;@771140f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:26:48,035 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-03 21:26:48,042 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:26:48,042 INFO L124 PetriNetUnfolderBase]: 38/115 cut-off events. [2023-08-03 21:26:48,042 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-03 21:26:48,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:48,042 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 21:26:48,042 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:26:48,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:48,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1123911026, now seen corresponding path program 1 times [2023-08-03 21:26:48,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:48,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736667547] [2023-08-03 21:26:48,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:48,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:48,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:26:48,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:48,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736667547] [2023-08-03 21:26:48,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736667547] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:26:48,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:26:48,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:26:48,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607062735] [2023-08-03 21:26:48,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:26:48,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:26:48,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:48,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:26:48,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:26:48,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 478 [2023-08-03 21:26:48,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 100 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:48,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:48,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 478 [2023-08-03 21:26:48,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:49,374 INFO L124 PetriNetUnfolderBase]: 9872/15757 cut-off events. [2023-08-03 21:26:49,374 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-08-03 21:26:49,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30205 conditions, 15757 events. 9872/15757 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 104377 event pairs, 9112 based on Foata normal form. 2730/16056 useless extension candidates. Maximal degree in co-relation 12164. Up to 14349 conditions per place. [2023-08-03 21:26:49,414 INFO L140 encePairwiseOnDemand]: 444/478 looper letters, 36 selfloop transitions, 2 changer transitions 23/70 dead transitions. [2023-08-03 21:26:49,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 272 flow [2023-08-03 21:26:49,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:26:49,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:26:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2023-08-03 21:26:49,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50139470013947 [2023-08-03 21:26:49,416 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 719 transitions. [2023-08-03 21:26:49,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 719 transitions. [2023-08-03 21:26:49,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:49,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 719 transitions. [2023-08-03 21:26:49,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:49,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:49,421 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:49,421 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 218 flow. Second operand 3 states and 719 transitions. [2023-08-03 21:26:49,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 272 flow [2023-08-03 21:26:49,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:26:49,426 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 116 flow [2023-08-03 21:26:49,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2023-08-03 21:26:49,427 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-03 21:26:49,428 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 116 flow [2023-08-03 21:26:49,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:49,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:49,428 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-03 21:26:49,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-03 21:26:49,428 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:26:49,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:49,429 INFO L85 PathProgramCache]: Analyzing trace with hash -207077384, now seen corresponding path program 1 times [2023-08-03 21:26:49,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:49,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506906623] [2023-08-03 21:26:49,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:49,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:49,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:26:49,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:49,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506906623] [2023-08-03 21:26:49,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506906623] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:26:49,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752756605] [2023-08-03 21:26:49,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:49,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:49,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:49,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:26:49,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 21:26:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:49,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:26:49,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:26:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:26:49,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:26:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:26:49,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752756605] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:26:49,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:26:49,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-03 21:26:49,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53433462] [2023-08-03 21:26:49,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:26:49,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 21:26:49,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:49,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 21:26:49,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-03 21:26:49,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 478 [2023-08-03 21:26:49,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 47 transitions, 116 flow. Second operand has 7 states, 7 states have (on average 210.71428571428572) internal successors, (1475), 7 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:49,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:49,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 478 [2023-08-03 21:26:49,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:49,867 INFO L124 PetriNetUnfolderBase]: 1738/2923 cut-off events. [2023-08-03 21:26:49,867 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-08-03 21:26:49,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5649 conditions, 2923 events. 1738/2923 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 16152 event pairs, 1617 based on Foata normal form. 0/2391 useless extension candidates. Maximal degree in co-relation 5636. Up to 2647 conditions per place. [2023-08-03 21:26:49,880 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 36 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2023-08-03 21:26:49,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 210 flow [2023-08-03 21:26:49,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 21:26:49,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 21:26:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1298 transitions. [2023-08-03 21:26:49,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4525801952580195 [2023-08-03 21:26:49,884 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1298 transitions. [2023-08-03 21:26:49,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1298 transitions. [2023-08-03 21:26:49,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:49,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1298 transitions. [2023-08-03 21:26:49,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 216.33333333333334) internal successors, (1298), 6 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:49,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:49,892 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:49,892 INFO L175 Difference]: Start difference. First operand has 71 places, 47 transitions, 116 flow. Second operand 6 states and 1298 transitions. [2023-08-03 21:26:49,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 210 flow [2023-08-03 21:26:49,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 204 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-03 21:26:49,895 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 146 flow [2023-08-03 21:26:49,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-03 21:26:49,898 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2023-08-03 21:26:49,898 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 146 flow [2023-08-03 21:26:49,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.71428571428572) internal successors, (1475), 7 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:49,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:49,899 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 21:26:49,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-03 21:26:50,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:50,105 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:26:50,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:50,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1964701426, now seen corresponding path program 2 times [2023-08-03 21:26:50,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:50,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498242139] [2023-08-03 21:26:50,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:50,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:26:50,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:50,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498242139] [2023-08-03 21:26:50,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498242139] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:26:50,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633517214] [2023-08-03 21:26:50,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:26:50,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:50,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:50,236 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:26:50,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 21:26:50,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:26:50,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:26:50,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 21:26:50,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:26:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:26:50,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:26:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:26:50,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633517214] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:26:50,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:26:50,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-03 21:26:50,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785607400] [2023-08-03 21:26:50,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:26:50,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 21:26:50,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:50,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 21:26:50,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-03 21:26:50,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 478 [2023-08-03 21:26:50,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 146 flow. Second operand has 13 states, 13 states have (on average 210.3846153846154) internal successors, (2735), 13 states have internal predecessors, (2735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:50,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:50,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 478 [2023-08-03 21:26:50,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:50,728 INFO L124 PetriNetUnfolderBase]: 1738/2929 cut-off events. [2023-08-03 21:26:50,728 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2023-08-03 21:26:50,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5680 conditions, 2929 events. 1738/2929 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 16191 event pairs, 1617 based on Foata normal form. 6/2404 useless extension candidates. Maximal degree in co-relation 5621. Up to 2647 conditions per place. [2023-08-03 21:26:50,747 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 36 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2023-08-03 21:26:50,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 56 transitions, 276 flow [2023-08-03 21:26:50,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-03 21:26:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-03 21:26:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2561 transitions. [2023-08-03 21:26:50,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4464783821478382 [2023-08-03 21:26:50,755 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2561 transitions. [2023-08-03 21:26:50,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2561 transitions. [2023-08-03 21:26:50,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:50,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2561 transitions. [2023-08-03 21:26:50,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 213.41666666666666) internal successors, (2561), 12 states have internal predecessors, (2561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:50,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 478.0) internal successors, (6214), 13 states have internal predecessors, (6214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:50,768 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 478.0) internal successors, (6214), 13 states have internal predecessors, (6214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:50,768 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 146 flow. Second operand 12 states and 2561 transitions. [2023-08-03 21:26:50,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 56 transitions, 276 flow [2023-08-03 21:26:50,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 56 transitions, 262 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-03 21:26:50,771 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 216 flow [2023-08-03 21:26:50,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=216, PETRI_PLACES=74, PETRI_TRANSITIONS=56} [2023-08-03 21:26:50,773 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2023-08-03 21:26:50,773 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 216 flow [2023-08-03 21:26:50,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 210.3846153846154) internal successors, (2735), 13 states have internal predecessors, (2735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:50,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:50,775 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 21:26:50,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-03 21:26:50,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:50,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:26:50,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:50,981 INFO L85 PathProgramCache]: Analyzing trace with hash -193054414, now seen corresponding path program 3 times [2023-08-03 21:26:50,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:50,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857660322] [2023-08-03 21:26:50,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:50,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 21:26:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857660322] [2023-08-03 21:26:51,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857660322] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:26:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798787066] [2023-08-03 21:26:51,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 21:26:51,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:51,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:51,057 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:26:51,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-03 21:26:51,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-03 21:26:51,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:26:51,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 21:26:51,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:26:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 21:26:51,170 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:26:51,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798787066] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:26:51,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:26:51,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 21:26:51,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210211332] [2023-08-03 21:26:51,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:26:51,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:26:51,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:51,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:26:51,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 21:26:51,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 478 [2023-08-03 21:26:51,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 56 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:51,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:51,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 478 [2023-08-03 21:26:51,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:51,437 INFO L124 PetriNetUnfolderBase]: 1201/2046 cut-off events. [2023-08-03 21:26:51,437 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-08-03 21:26:51,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4126 conditions, 2046 events. 1201/2046 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10802 event pairs, 112 based on Foata normal form. 0/1832 useless extension candidates. Maximal degree in co-relation 4049. Up to 1410 conditions per place. [2023-08-03 21:26:51,442 INFO L140 encePairwiseOnDemand]: 474/478 looper letters, 0 selfloop transitions, 0 changer transitions 103/103 dead transitions. [2023-08-03 21:26:51,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 103 transitions, 498 flow [2023-08-03 21:26:51,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:26:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:26:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1131 transitions. [2023-08-03 21:26:51,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47322175732217575 [2023-08-03 21:26:51,446 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1131 transitions. [2023-08-03 21:26:51,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1131 transitions. [2023-08-03 21:26:51,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:51,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1131 transitions. [2023-08-03 21:26:51,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 226.2) internal successors, (1131), 5 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:51,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:51,452 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:51,452 INFO L175 Difference]: Start difference. First operand has 74 places, 56 transitions, 216 flow. Second operand 5 states and 1131 transitions. [2023-08-03 21:26:51,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 103 transitions, 498 flow [2023-08-03 21:26:51,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 103 transitions, 449 flow, removed 19 selfloop flow, removed 6 redundant places. [2023-08-03 21:26:51,456 INFO L231 Difference]: Finished difference. Result has 71 places, 0 transitions, 0 flow [2023-08-03 21:26:51,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=71, PETRI_TRANSITIONS=0} [2023-08-03 21:26:51,457 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-03 21:26:51,457 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 0 transitions, 0 flow [2023-08-03 21:26:51,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:51,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-03 21:26:51,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-03 21:26:51,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:51,663 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-03 21:26:51,663 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE (1/2) [2023-08-03 21:26:51,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:51,705 INFO L124 PetriNetUnfolderBase]: 75/424 cut-off events. [2023-08-03 21:26:51,705 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 21:26:51,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-08-03 21:26:51,710 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:51,713 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:51,713 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:26:51,713 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:51,714 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:51,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:51,751 INFO L124 PetriNetUnfolderBase]: 75/424 cut-off events. [2023-08-03 21:26:51,752 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 21:26:51,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-08-03 21:26:51,767 INFO L119 LiptonReduction]: Number of co-enabled transitions 31416 [2023-08-03 21:26:54,560 INFO L134 LiptonReduction]: Checked pairs total: 54087 [2023-08-03 21:26:54,561 INFO L136 LiptonReduction]: Total number of compositions: 212 [2023-08-03 21:26:54,562 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 21:26:54,562 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;@771140f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:26:54,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 21:26:54,590 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:26:54,590 INFO L124 PetriNetUnfolderBase]: 7/25 cut-off events. [2023-08-03 21:26:54,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:26:54,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:54,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 21:26:54,591 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:26:54,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:54,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1743075921, now seen corresponding path program 1 times [2023-08-03 21:26:54,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:54,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100806232] [2023-08-03 21:26:54,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:54,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:26:54,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:54,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100806232] [2023-08-03 21:26:54,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100806232] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:26:54,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:26:54,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:26:54,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864007205] [2023-08-03 21:26:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:26:54,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:26:54,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:54,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:26:54,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:26:54,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 472 [2023-08-03 21:26:54,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 100 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:54,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:54,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 472 [2023-08-03 21:26:54,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:55,564 INFO L124 PetriNetUnfolderBase]: 9849/15756 cut-off events. [2023-08-03 21:26:55,564 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-08-03 21:26:55,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30204 conditions, 15756 events. 9849/15756 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 104685 event pairs, 9112 based on Foata normal form. 2729/16053 useless extension candidates. Maximal degree in co-relation 12153. Up to 14349 conditions per place. [2023-08-03 21:26:55,714 INFO L140 encePairwiseOnDemand]: 438/472 looper letters, 55 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-03 21:26:55,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 272 flow [2023-08-03 21:26:55,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:26:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:26:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2023-08-03 21:26:55,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.507768361581921 [2023-08-03 21:26:55,718 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 719 transitions. [2023-08-03 21:26:55,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 719 transitions. [2023-08-03 21:26:55,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:55,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 719 transitions. [2023-08-03 21:26:55,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:55,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:55,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:55,723 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 218 flow. Second operand 3 states and 719 transitions. [2023-08-03 21:26:55,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 272 flow [2023-08-03 21:26:55,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:26:55,725 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-08-03 21:26:55,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2023-08-03 21:26:55,725 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-03 21:26:55,725 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-08-03 21:26:55,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:55,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:55,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:26:55,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 21:26:55,726 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:26:55,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:55,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1643433822, now seen corresponding path program 1 times [2023-08-03 21:26:55,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:55,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520553176] [2023-08-03 21:26:55,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:55,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:26:55,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:55,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520553176] [2023-08-03 21:26:55,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520553176] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:26:55,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:26:55,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 21:26:55,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548151319] [2023-08-03 21:26:55,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:26:55,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:26:55,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:55,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:26:55,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:26:55,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 472 [2023-08-03 21:26:55,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:55,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:55,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 472 [2023-08-03 21:26:55,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:56,730 INFO L124 PetriNetUnfolderBase]: 9675/15650 cut-off events. [2023-08-03 21:26:56,730 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-08-03 21:26:56,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30110 conditions, 15650 events. 9675/15650 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 106510 event pairs, 4312 based on Foata normal form. 0/13238 useless extension candidates. Maximal degree in co-relation 30097. Up to 14317 conditions per place. [2023-08-03 21:26:56,806 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 72 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-03 21:26:56,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 350 flow [2023-08-03 21:26:56,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:26:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:26:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2023-08-03 21:26:56,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4971751412429379 [2023-08-03 21:26:56,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2023-08-03 21:26:56,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2023-08-03 21:26:56,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:56,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2023-08-03 21:26:56,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:56,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:56,813 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:56,813 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 168 flow. Second operand 3 states and 704 transitions. [2023-08-03 21:26:56,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 350 flow [2023-08-03 21:26:56,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 87 transitions, 346 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 21:26:56,816 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-08-03 21:26:56,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2023-08-03 21:26:56,817 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-03 21:26:56,817 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-08-03 21:26:56,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:56,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:56,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:26:56,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-03 21:26:56,830 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:26:56,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1988470643, now seen corresponding path program 1 times [2023-08-03 21:26:56,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:56,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527766161] [2023-08-03 21:26:56,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:56,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:26:56,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:56,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527766161] [2023-08-03 21:26:56,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527766161] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:26:56,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511803532] [2023-08-03 21:26:56,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:56,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:56,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:56,868 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:26:56,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-03 21:26:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:56,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:26:56,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:26:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:26:56,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:26:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:26:56,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511803532] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:26:56,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:26:56,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-03 21:26:56,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612698497] [2023-08-03 21:26:56,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:26:56,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 21:26:56,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:56,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 21:26:56,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-03 21:26:56,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 472 [2023-08-03 21:26:56,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:56,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:56,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 472 [2023-08-03 21:26:56,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:57,786 INFO L124 PetriNetUnfolderBase]: 9912/15619 cut-off events. [2023-08-03 21:26:57,786 INFO L125 PetriNetUnfolderBase]: For 612/612 co-relation queries the response was YES. [2023-08-03 21:26:57,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30593 conditions, 15619 events. 9912/15619 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 101455 event pairs, 9112 based on Foata normal form. 3/13422 useless extension candidates. Maximal degree in co-relation 30565. Up to 14334 conditions per place. [2023-08-03 21:26:57,851 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 56 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-03 21:26:57,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 310 flow [2023-08-03 21:26:57,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 21:26:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 21:26:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1317 transitions. [2023-08-03 21:26:57,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4650423728813559 [2023-08-03 21:26:57,854 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1317 transitions. [2023-08-03 21:26:57,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1317 transitions. [2023-08-03 21:26:57,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:57,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1317 transitions. [2023-08-03 21:26:57,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 219.5) internal successors, (1317), 6 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:57,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:57,861 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:57,861 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 176 flow. Second operand 6 states and 1317 transitions. [2023-08-03 21:26:57,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 310 flow [2023-08-03 21:26:57,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:26:57,864 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-08-03 21:26:57,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2023-08-03 21:26:57,865 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-08-03 21:26:57,865 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-08-03 21:26:57,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:57,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:57,866 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:26:57,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-03 21:26:58,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:58,071 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:26:58,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:58,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1129668096, now seen corresponding path program 2 times [2023-08-03 21:26:58,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:58,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593230789] [2023-08-03 21:26:58,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:58,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:26:58,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:58,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593230789] [2023-08-03 21:26:58,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593230789] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:26:58,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520372878] [2023-08-03 21:26:58,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:26:58,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:58,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:58,142 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:26:58,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-03 21:26:58,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-03 21:26:58,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:26:58,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-03 21:26:58,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:26:58,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-03 21:26:58,314 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:26:58,315 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 21:26:58,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:26:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-03 21:26:58,397 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:26:58,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520372878] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:26:58,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:26:58,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-03 21:26:58,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743774028] [2023-08-03 21:26:58,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:26:58,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-03 21:26:58,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:58,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-03 21:26:58,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-03 21:26:58,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 472 [2023-08-03 21:26:58,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:58,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:58,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 472 [2023-08-03 21:26:58,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:59,471 INFO L124 PetriNetUnfolderBase]: 9970/16245 cut-off events. [2023-08-03 21:26:59,471 INFO L125 PetriNetUnfolderBase]: For 651/651 co-relation queries the response was YES. [2023-08-03 21:26:59,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31932 conditions, 16245 events. 9970/16245 cut-off events. For 651/651 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 113990 event pairs, 1964 based on Foata normal form. 0/14309 useless extension candidates. Maximal degree in co-relation 31896. Up to 11872 conditions per place. [2023-08-03 21:26:59,521 INFO L140 encePairwiseOnDemand]: 462/472 looper letters, 122 selfloop transitions, 14 changer transitions 14/163 dead transitions. [2023-08-03 21:26:59,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 163 transitions, 719 flow [2023-08-03 21:26:59,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 21:26:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 21:26:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1357 transitions. [2023-08-03 21:26:59,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2023-08-03 21:26:59,525 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1357 transitions. [2023-08-03 21:26:59,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1357 transitions. [2023-08-03 21:26:59,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:59,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1357 transitions. [2023-08-03 21:26:59,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 226.16666666666666) internal successors, (1357), 6 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:59,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:59,531 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:59,531 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 210 flow. Second operand 6 states and 1357 transitions. [2023-08-03 21:26:59,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 163 transitions, 719 flow [2023-08-03 21:26:59,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 163 transitions, 705 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-03 21:26:59,535 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 293 flow [2023-08-03 21:26:59,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2023-08-03 21:26:59,535 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 20 predicate places. [2023-08-03 21:26:59,535 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 293 flow [2023-08-03 21:26:59,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:59,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:59,536 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:26:59,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-03 21:26:59,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:59,746 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:26:59,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:59,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1168022395, now seen corresponding path program 1 times [2023-08-03 21:26:59,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:59,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006877800] [2023-08-03 21:26:59,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:59,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-03 21:26:59,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:59,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006877800] [2023-08-03 21:26:59,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006877800] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:26:59,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590660101] [2023-08-03 21:26:59,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:59,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:59,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:59,833 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:26:59,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-03 21:26:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:59,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 21:26:59,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:26:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:26:59,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:27:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:27:00,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590660101] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:27:00,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:27:00,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-03 21:27:00,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062118742] [2023-08-03 21:27:00,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:27:00,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-03 21:27:00,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:27:00,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-03 21:27:00,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-03 21:27:00,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 472 [2023-08-03 21:27:00,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 293 flow. Second operand has 14 states, 14 states have (on average 207.14285714285714) internal successors, (2900), 14 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:27:00,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:27:00,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 472 [2023-08-03 21:27:00,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:27:01,293 INFO L124 PetriNetUnfolderBase]: 9731/15690 cut-off events. [2023-08-03 21:27:01,293 INFO L125 PetriNetUnfolderBase]: For 4748/4748 co-relation queries the response was YES. [2023-08-03 21:27:01,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34918 conditions, 15690 events. 9731/15690 cut-off events. For 4748/4748 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 108690 event pairs, 626 based on Foata normal form. 22/14794 useless extension candidates. Maximal degree in co-relation 34859. Up to 13530 conditions per place. [2023-08-03 21:27:01,350 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 113 selfloop transitions, 15 changer transitions 0/141 dead transitions. [2023-08-03 21:27:01,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 141 transitions, 721 flow [2023-08-03 21:27:01,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-03 21:27:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-03 21:27:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2989 transitions. [2023-08-03 21:27:01,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523305084745763 [2023-08-03 21:27:01,358 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2989 transitions. [2023-08-03 21:27:01,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2989 transitions. [2023-08-03 21:27:01,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:27:01,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2989 transitions. [2023-08-03 21:27:01,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 213.5) internal successors, (2989), 14 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:27:01,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 472.0) internal successors, (7080), 15 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:27:01,373 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 472.0) internal successors, (7080), 15 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:27:01,374 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 293 flow. Second operand 14 states and 2989 transitions. [2023-08-03 21:27:01,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 141 transitions, 721 flow [2023-08-03 21:27:01,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 141 transitions, 721 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:27:01,385 INFO L231 Difference]: Finished difference. Result has 103 places, 93 transitions, 375 flow [2023-08-03 21:27:01,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=375, PETRI_PLACES=103, PETRI_TRANSITIONS=93} [2023-08-03 21:27:01,386 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 35 predicate places. [2023-08-03 21:27:01,386 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 93 transitions, 375 flow [2023-08-03 21:27:01,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 207.14285714285714) internal successors, (2900), 14 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:27:01,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:27:01,387 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:27:01,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-03 21:27:01,595 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,SelfDestructingSolverStorable12 [2023-08-03 21:27:01,596 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:27:01,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:27:01,596 INFO L85 PathProgramCache]: Analyzing trace with hash -157552559, now seen corresponding path program 1 times [2023-08-03 21:27:01,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:27:01,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950574010] [2023-08-03 21:27:01,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:27:01,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:27:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:27:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 21:27:01,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:27:01,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950574010] [2023-08-03 21:27:01,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950574010] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:27:01,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:27:01,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 21:27:01,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908084754] [2023-08-03 21:27:01,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:27:01,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:27:01,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:27:01,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:27:01,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:27:01,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 472 [2023-08-03 21:27:01,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 93 transitions, 375 flow. Second operand has 5 states, 5 states have (on average 194.4) internal successors, (972), 5 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:27:01,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:27:01,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 472 [2023-08-03 21:27:01,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:27:02,727 INFO L124 PetriNetUnfolderBase]: 5551/10214 cut-off events. [2023-08-03 21:27:02,727 INFO L125 PetriNetUnfolderBase]: For 5231/5231 co-relation queries the response was YES. [2023-08-03 21:27:02,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24257 conditions, 10214 events. 5551/10214 cut-off events. For 5231/5231 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 75747 event pairs, 2137 based on Foata normal form. 1470/10788 useless extension candidates. Maximal degree in co-relation 24183. Up to 5361 conditions per place. [2023-08-03 21:27:02,773 INFO L140 encePairwiseOnDemand]: 451/472 looper letters, 118 selfloop transitions, 21 changer transitions 2/151 dead transitions. [2023-08-03 21:27:02,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 151 transitions, 865 flow [2023-08-03 21:27:02,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:27:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:27:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 878 transitions. [2023-08-03 21:27:02,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4650423728813559 [2023-08-03 21:27:02,776 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 878 transitions. [2023-08-03 21:27:02,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 878 transitions. [2023-08-03 21:27:02,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:27:02,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 878 transitions. [2023-08-03 21:27:02,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 219.5) internal successors, (878), 4 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:27:02,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 472.0) internal successors, (2360), 5 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:27:02,781 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 472.0) internal successors, (2360), 5 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:27:02,781 INFO L175 Difference]: Start difference. First operand has 103 places, 93 transitions, 375 flow. Second operand 4 states and 878 transitions. [2023-08-03 21:27:02,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 151 transitions, 865 flow [2023-08-03 21:27:02,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 151 transitions, 792 flow, removed 26 selfloop flow, removed 10 redundant places. [2023-08-03 21:27:02,795 INFO L231 Difference]: Finished difference. Result has 97 places, 104 transitions, 411 flow [2023-08-03 21:27:02,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=411, PETRI_PLACES=97, PETRI_TRANSITIONS=104} [2023-08-03 21:27:02,796 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 29 predicate places. [2023-08-03 21:27:02,796 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 104 transitions, 411 flow [2023-08-03 21:27:02,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 194.4) internal successors, (972), 5 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:27:02,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:27:02,797 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:27:02,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-03 21:27:02,797 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:27:02,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:27:02,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1329455216, now seen corresponding path program 1 times [2023-08-03 21:27:02,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:27:02,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713378611] [2023-08-03 21:27:02,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:27:02,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:27:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:27:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 21:27:03,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:27:03,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713378611] [2023-08-03 21:27:03,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713378611] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:27:03,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904881941] [2023-08-03 21:27:03,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:27:03,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:27:03,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:27:03,428 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:27:03,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-03 21:27:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:27:03,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-03 21:27:03,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:27:03,563 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-03 21:27:03,623 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:27:03,624 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 21:27:03,643 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:27:03,670 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:27:03,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-03 21:27:03,739 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:27:03,740 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 21:27:03,812 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-03 21:27:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 21:27:03,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:27:03,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-08-03 21:27:03,996 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2023-08-03 21:27:14,126 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_91| Int) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_109| Int) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_447 Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_91| 0) (= |v_t_funThread1of2ForFork0_~i~0#1_109| |v_t_funThread2of2ForFork0_~i~0#1_91|) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_91|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_443) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_91| 28) |~#a~0.offset|) v_ArrVal_447) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_109| 28) |~#a~0.offset|)) 0))) is different from false [2023-08-03 21:27:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-03 21:27:14,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904881941] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:27:14,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:27:14,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-08-03 21:27:14,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577927242] [2023-08-03 21:27:14,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:27:14,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-03 21:27:14,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:27:14,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-03 21:27:14,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=259, Unknown=3, NotChecked=34, Total=380 [2023-08-03 21:27:14,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 472 [2023-08-03 21:27:14,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 104 transitions, 411 flow. Second operand has 20 states, 20 states have (on average 149.65) internal successors, (2993), 20 states have internal predecessors, (2993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:27:14,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:27:14,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 472 [2023-08-03 21:27:14,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:27:32,611 WARN L233 SmtUtils]: Spent 18.09s on a formula simplification. DAG size of input: 43 DAG size of output: 34 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:27:34,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:36,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:38,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:40,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:42,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:44,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:46,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:48,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:50,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:52,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:55,381 INFO L124 PetriNetUnfolderBase]: 9573/17384 cut-off events. [2023-08-03 21:27:55,382 INFO L125 PetriNetUnfolderBase]: For 10801/10841 co-relation queries the response was YES. [2023-08-03 21:27:55,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48457 conditions, 17384 events. 9573/17384 cut-off events. For 10801/10841 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 138663 event pairs, 2028 based on Foata normal form. 53/15867 useless extension candidates. Maximal degree in co-relation 47258. Up to 7381 conditions per place. [2023-08-03 21:27:55,449 INFO L140 encePairwiseOnDemand]: 451/472 looper letters, 310 selfloop transitions, 61 changer transitions 88/468 dead transitions. [2023-08-03 21:27:55,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 468 transitions, 2706 flow [2023-08-03 21:27:55,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-03 21:27:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-03 21:27:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2746 transitions. [2023-08-03 21:27:55,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3636122881355932 [2023-08-03 21:27:55,457 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2746 transitions. [2023-08-03 21:27:55,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2746 transitions. [2023-08-03 21:27:55,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:27:55,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2746 transitions. [2023-08-03 21:27:55,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 171.625) internal successors, (2746), 16 states have internal predecessors, (2746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:27:55,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 472.0) internal successors, (8024), 17 states have internal predecessors, (8024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:27:55,474 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 472.0) internal successors, (8024), 17 states have internal predecessors, (8024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:27:55,474 INFO L175 Difference]: Start difference. First operand has 97 places, 104 transitions, 411 flow. Second operand 16 states and 2746 transitions. [2023-08-03 21:27:55,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 468 transitions, 2706 flow [2023-08-03 21:27:55,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 468 transitions, 2705 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:27:55,509 INFO L231 Difference]: Finished difference. Result has 121 places, 151 transitions, 902 flow [2023-08-03 21:27:55,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=902, PETRI_PLACES=121, PETRI_TRANSITIONS=151} [2023-08-03 21:27:55,510 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 53 predicate places. [2023-08-03 21:27:55,510 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 151 transitions, 902 flow [2023-08-03 21:27:55,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 149.65) internal successors, (2993), 20 states have internal predecessors, (2993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:27:55,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:27:55,511 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:27:55,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-03 21:27:55,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-03 21:27:55,716 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:27:55,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:27:55,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1136854136, now seen corresponding path program 1 times [2023-08-03 21:27:55,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:27:55,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890463385] [2023-08-03 21:27:55,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:27:55,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:27:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:27:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 21:27:56,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:27:56,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890463385] [2023-08-03 21:27:56,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890463385] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:27:56,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236458633] [2023-08-03 21:27:56,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:27:56,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:27:56,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:27:56,230 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:27:56,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-03 21:27:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:27:56,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-03 21:27:56,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:27:56,357 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-03 21:27:56,457 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:27:56,457 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 21:27:56,475 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:27:56,508 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:27:56,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-03 21:27:56,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:27:56,563 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 21:27:56,594 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:27:56,594 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 21:27:56,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-03 21:27:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 21:27:56,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:27:56,806 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_93| Int) (v_ArrVal_532 Int) (v_ArrVal_531 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_531) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0)) 0)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_532) (+ |c_~#a~0.offset| .cse0)) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_93| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_93|)))) is different from false [2023-08-03 21:27:56,840 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:27:56,840 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-03 21:27:56,850 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:27:56,850 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-03 21:27:56,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-03 21:28:11,067 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_93| Int) (v_ArrVal_528 (Array Int Int))) (or (forall ((v_ArrVal_532 Int) (|v_t_funThread1of2ForFork0_~i~0#1_111| Int) (|~#a~0.offset| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_528) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_111| 28) |~#a~0.offset|) v_ArrVal_532) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28) |~#a~0.offset|)) 0) (= |v_t_funThread1of2ForFork0_~i~0#1_111| |v_t_funThread2of2ForFork0_~i~0#1_93|))) (< |v_t_funThread2of2ForFork0_~i~0#1_93| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_93|)))) is different from false [2023-08-03 21:28:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-03 21:28:14,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236458633] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:28:14,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:28:14,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-08-03 21:28:14,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553862863] [2023-08-03 21:28:14,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:28:14,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-03 21:28:14,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:28:14,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-03 21:28:14,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=286, Unknown=4, NotChecked=74, Total=462 [2023-08-03 21:28:15,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 472 [2023-08-03 21:28:15,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 151 transitions, 902 flow. Second operand has 22 states, 22 states have (on average 149.36363636363637) internal successors, (3286), 22 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:15,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:28:15,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 472 [2023-08-03 21:28:15,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:28:20,919 INFO L124 PetriNetUnfolderBase]: 12995/24016 cut-off events. [2023-08-03 21:28:20,919 INFO L125 PetriNetUnfolderBase]: For 47397/47481 co-relation queries the response was YES. [2023-08-03 21:28:20,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81325 conditions, 24016 events. 12995/24016 cut-off events. For 47397/47481 co-relation queries the response was YES. Maximal size of possible extension queue 905. Compared 207070 event pairs, 1978 based on Foata normal form. 106/22046 useless extension candidates. Maximal degree in co-relation 79906. Up to 10144 conditions per place. [2023-08-03 21:28:21,035 INFO L140 encePairwiseOnDemand]: 453/472 looper letters, 393 selfloop transitions, 106 changer transitions 167/675 dead transitions. [2023-08-03 21:28:21,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 675 transitions, 4980 flow [2023-08-03 21:28:21,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-03 21:28:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-03 21:28:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3611 transitions. [2023-08-03 21:28:21,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36430589184826473 [2023-08-03 21:28:21,045 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3611 transitions. [2023-08-03 21:28:21,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3611 transitions. [2023-08-03 21:28:21,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:28:21,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3611 transitions. [2023-08-03 21:28:21,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 171.95238095238096) internal successors, (3611), 21 states have internal predecessors, (3611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:21,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 472.0) internal successors, (10384), 22 states have internal predecessors, (10384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:21,064 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 472.0) internal successors, (10384), 22 states have internal predecessors, (10384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:21,064 INFO L175 Difference]: Start difference. First operand has 121 places, 151 transitions, 902 flow. Second operand 21 states and 3611 transitions. [2023-08-03 21:28:21,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 675 transitions, 4980 flow [2023-08-03 21:28:21,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 675 transitions, 4976 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 21:28:21,312 INFO L231 Difference]: Finished difference. Result has 155 places, 222 transitions, 1914 flow [2023-08-03 21:28:21,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1914, PETRI_PLACES=155, PETRI_TRANSITIONS=222} [2023-08-03 21:28:21,312 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 87 predicate places. [2023-08-03 21:28:21,312 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 222 transitions, 1914 flow [2023-08-03 21:28:21,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 149.36363636363637) internal successors, (3286), 22 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:21,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:28:21,313 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:28:21,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-03 21:28:21,514 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,SelfDestructingSolverStorable15 [2023-08-03 21:28:21,514 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:28:21,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:28:21,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1418637064, now seen corresponding path program 2 times [2023-08-03 21:28:21,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:28:21,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592644540] [2023-08-03 21:28:21,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:28:21,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:28:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:28:22,443 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 21:28:22,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:28:22,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592644540] [2023-08-03 21:28:22,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592644540] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:28:22,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878124546] [2023-08-03 21:28:22,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:28:22,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:28:22,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:28:22,445 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:28:22,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-03 21:28:22,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:28:22,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:28:22,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-03 21:28:22,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:28:22,593 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-03 21:28:22,689 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:28:22,689 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 21:28:22,717 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:28:22,748 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:28:22,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 16 treesize of output 12 [2023-08-03 21:28:22,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:28:22,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 19 treesize of output 21 [2023-08-03 21:28:22,874 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-03 21:28:22,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:28:22,915 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 21:28:22,963 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:28:22,964 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 21:28:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 21:28:23,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:28:23,067 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_95| Int) (v_ArrVal_620 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_95| 28))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_620) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0))))) is different from false [2023-08-03 21:28:23,153 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:28:23,154 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-03 21:28:23,164 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:28:23,164 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-03 21:28:23,170 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-03 21:28:31,468 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_113| Int) (v_ArrVal_614 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_95| Int) (v_ArrVal_619 Int) (|~#a~0.offset| Int)) (or (= |v_t_funThread1of2ForFork0_~i~0#1_113| |v_t_funThread2of2ForFork0_~i~0#1_95|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_614) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_113| 28) |~#a~0.offset|) v_ArrVal_619) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_95| 28) |~#a~0.offset|)) 0)))) is different from false [2023-08-03 21:28:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-03 21:28:36,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878124546] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:28:36,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:28:36,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2023-08-03 21:28:36,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257584389] [2023-08-03 21:28:36,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:28:36,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-03 21:28:36,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:28:36,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-03 21:28:36,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=349, Unknown=3, NotChecked=82, Total=552 [2023-08-03 21:28:36,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 472 [2023-08-03 21:28:36,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 222 transitions, 1914 flow. Second operand has 24 states, 24 states have (on average 147.20833333333334) internal successors, (3533), 24 states have internal predecessors, (3533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:36,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:28:36,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 472 [2023-08-03 21:28:36,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:28:42,298 INFO L124 PetriNetUnfolderBase]: 15202/28355 cut-off events. [2023-08-03 21:28:42,298 INFO L125 PetriNetUnfolderBase]: For 154983/155083 co-relation queries the response was YES. [2023-08-03 21:28:42,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120772 conditions, 28355 events. 15202/28355 cut-off events. For 154983/155083 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 253927 event pairs, 2815 based on Foata normal form. 56/25969 useless extension candidates. Maximal degree in co-relation 118922. Up to 12700 conditions per place. [2023-08-03 21:28:42,533 INFO L140 encePairwiseOnDemand]: 452/472 looper letters, 331 selfloop transitions, 163 changer transitions 133/636 dead transitions. [2023-08-03 21:28:42,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 636 transitions, 6046 flow [2023-08-03 21:28:42,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-03 21:28:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-03 21:28:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2735 transitions. [2023-08-03 21:28:42,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3621557203389831 [2023-08-03 21:28:42,539 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2735 transitions. [2023-08-03 21:28:42,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2735 transitions. [2023-08-03 21:28:42,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:28:42,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2735 transitions. [2023-08-03 21:28:42,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 170.9375) internal successors, (2735), 16 states have internal predecessors, (2735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:42,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 472.0) internal successors, (8024), 17 states have internal predecessors, (8024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:42,549 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 472.0) internal successors, (8024), 17 states have internal predecessors, (8024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:42,549 INFO L175 Difference]: Start difference. First operand has 155 places, 222 transitions, 1914 flow. Second operand 16 states and 2735 transitions. [2023-08-03 21:28:42,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 636 transitions, 6046 flow [2023-08-03 21:28:44,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 636 transitions, 5684 flow, removed 164 selfloop flow, removed 5 redundant places. [2023-08-03 21:28:44,133 INFO L231 Difference]: Finished difference. Result has 174 places, 296 transitions, 3263 flow [2023-08-03 21:28:44,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1756, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3263, PETRI_PLACES=174, PETRI_TRANSITIONS=296} [2023-08-03 21:28:44,133 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 106 predicate places. [2023-08-03 21:28:44,133 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 296 transitions, 3263 flow [2023-08-03 21:28:44,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 147.20833333333334) internal successors, (3533), 24 states have internal predecessors, (3533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:44,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:28:44,134 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:28:44,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-03 21:28:44,339 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,SelfDestructingSolverStorable16 [2023-08-03 21:28:44,339 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:28:44,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:28:44,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1026671056, now seen corresponding path program 2 times [2023-08-03 21:28:44,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:28:44,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642195310] [2023-08-03 21:28:44,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:28:44,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:28:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:28:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 21:28:44,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:28:44,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642195310] [2023-08-03 21:28:44,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642195310] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:28:44,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763573979] [2023-08-03 21:28:44,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:28:44,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:28:44,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:28:44,963 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:28:44,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-03 21:28:45,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:28:45,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:28:45,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-03 21:28:45,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:28:45,116 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-03 21:28:45,249 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:28:45,249 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 21:28:45,286 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:28:45,323 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:28:45,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-03 21:28:45,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:28:45,421 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 21:28:45,471 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:28:45,472 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 21:28:45,511 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-03 21:28:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 21:28:45,573 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:28:45,665 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_704 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_115| Int)) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_115| 28))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_704) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0)) 0))))) (forall ((v_ArrVal_704 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_704) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 4)) 0)))) is different from false [2023-08-03 21:28:45,704 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:28:45,704 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-03 21:28:45,716 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:28:45,717 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-03 21:28:45,723 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-03 21:28:45,749 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:28:45,749 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-03 21:28:45,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2023-08-03 21:28:55,807 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_701 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_115| Int) (|~#a~0.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_701) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_115| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-03 21:28:59,405 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-03 21:28:59,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763573979] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:28:59,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:28:59,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-03 21:28:59,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682605650] [2023-08-03 21:28:59,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:28:59,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-03 21:28:59,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:28:59,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-03 21:28:59,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=261, Unknown=2, NotChecked=70, Total=420 [2023-08-03 21:28:59,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 472 [2023-08-03 21:28:59,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 296 transitions, 3263 flow. Second operand has 21 states, 21 states have (on average 149.33333333333334) internal successors, (3136), 21 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:59,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:28:59,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 472 [2023-08-03 21:28:59,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:29:11,714 WARN L233 SmtUtils]: Spent 12.17s on a formula simplification. DAG size of input: 41 DAG size of output: 27 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:29:13,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:29:15,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:29:17,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:29:19,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-03 21:29:32,181 WARN L233 SmtUtils]: Spent 10.39s on a formula simplification. DAG size of input: 39 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:29:34,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:29:36,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:29:38,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:29:40,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:29:42,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:29:46,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:29:48,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:29:51,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:30:09,225 WARN L233 SmtUtils]: Spent 18.19s on a formula simplification. DAG size of input: 49 DAG size of output: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:30:11,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:30:13,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:30:15,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:30:19,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:30:21,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:30:23,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:30:25,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:30:27,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 [1] [2023-08-03 21:30:38,979 INFO L124 PetriNetUnfolderBase]: 19420/37045 cut-off events. [2023-08-03 21:30:38,980 INFO L125 PetriNetUnfolderBase]: For 236174/236314 co-relation queries the response was YES. [2023-08-03 21:30:39,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166843 conditions, 37045 events. 19420/37045 cut-off events. For 236174/236314 co-relation queries the response was YES. Maximal size of possible extension queue 1442. Compared 355241 event pairs, 4874 based on Foata normal form. 64/33845 useless extension candidates. Maximal degree in co-relation 164596. Up to 17110 conditions per place. [2023-08-03 21:30:39,306 INFO L140 encePairwiseOnDemand]: 452/472 looper letters, 491 selfloop transitions, 186 changer transitions 177/863 dead transitions. [2023-08-03 21:30:39,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 863 transitions, 9381 flow [2023-08-03 21:30:39,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-03 21:30:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-03 21:30:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4055 transitions. [2023-08-03 21:30:39,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3579625706214689 [2023-08-03 21:30:39,310 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4055 transitions. [2023-08-03 21:30:39,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4055 transitions. [2023-08-03 21:30:39,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:30:39,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4055 transitions. [2023-08-03 21:30:39,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 168.95833333333334) internal successors, (4055), 24 states have internal predecessors, (4055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:39,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 472.0) internal successors, (11800), 25 states have internal predecessors, (11800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:39,324 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 472.0) internal successors, (11800), 25 states have internal predecessors, (11800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:39,324 INFO L175 Difference]: Start difference. First operand has 174 places, 296 transitions, 3263 flow. Second operand 24 states and 4055 transitions. [2023-08-03 21:30:39,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 863 transitions, 9381 flow [2023-08-03 21:30:41,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 863 transitions, 9049 flow, removed 166 selfloop flow, removed 0 redundant places. [2023-08-03 21:30:41,771 INFO L231 Difference]: Finished difference. Result has 208 places, 383 transitions, 4892 flow [2023-08-03 21:30:41,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=3063, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4892, PETRI_PLACES=208, PETRI_TRANSITIONS=383} [2023-08-03 21:30:41,772 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 140 predicate places. [2023-08-03 21:30:41,772 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 383 transitions, 4892 flow [2023-08-03 21:30:41,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 149.33333333333334) internal successors, (3136), 21 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:41,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:30:41,772 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:30:41,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-03 21:30:41,973 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,SelfDestructingSolverStorable17 [2023-08-03 21:30:41,973 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:30:41,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:30:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash -227300932, now seen corresponding path program 3 times [2023-08-03 21:30:41,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:30:41,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629014453] [2023-08-03 21:30:41,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:41,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:30:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 21:30:42,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:30:42,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629014453] [2023-08-03 21:30:42,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629014453] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:30:42,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734901564] [2023-08-03 21:30:42,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 21:30:42,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:30:42,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:30:42,978 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:30:43,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-03 21:30:43,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-03 21:30:43,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:30:43,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-03 21:30:43,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:30:43,194 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-03 21:30:43,363 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:30:43,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 21:30:43,397 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:30:43,428 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-03 21:30:43,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:30:43,505 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 21:30:43,574 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-03 21:30:43,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:30:43,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 21:30:43,689 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-03 21:30:43,765 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:30:43,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 21:30:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 21:30:43,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:30:43,986 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_99| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_99| 28))) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_99|) (< |v_t_funThread2of2ForFork0_~i~0#1_99| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_792) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_793) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2023-08-03 21:30:44,151 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:30:44,151 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-03 21:30:44,167 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:30:44,168 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-03 21:30:44,175 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-03 21:30:46,233 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_99| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_99|) (< |v_t_funThread2of2ForFork0_~i~0#1_99| 0) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_117| Int) (v_ArrVal_790 Int) (|~#a~0.offset| Int) (v_ArrVal_793 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~i~0#1_117| |v_t_funThread2of2ForFork0_~i~0#1_99|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_117| 28) |~#a~0.offset|) v_ArrVal_790)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_793) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_99| 28) |~#a~0.offset|)) 0))))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_117| Int) (v_ArrVal_790 Int) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_99| Int) (v_ArrVal_793 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_117| 28) |~#a~0.offset|) v_ArrVal_790)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_793) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_99| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_99|) (< |v_t_funThread2of2ForFork0_~i~0#1_99| 0)))))) is different from false [2023-08-03 21:30:48,289 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((|v_t_funThread1of2ForFork0_~i~0#1_117| Int) (v_ArrVal_790 Int) (|~#a~0.offset| Int) (v_ArrVal_793 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_99| Int) (v_ArrVal_786 (Array Int Int))) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_99|) (< |v_t_funThread2of2ForFork0_~i~0#1_99| 0) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_786))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_117| 28) |~#a~0.offset|) v_ArrVal_790))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_793) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_99| 28) |~#a~0.offset|)) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_99| Int) (v_ArrVal_786 (Array Int Int))) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_99|) (< |v_t_funThread2of2ForFork0_~i~0#1_99| 0) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_117| Int) (v_ArrVal_790 Int) (|~#a~0.offset| Int) (v_ArrVal_793 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~i~0#1_117| |v_t_funThread2of2ForFork0_~i~0#1_99|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_786))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_117| 28) |~#a~0.offset|) v_ArrVal_790))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_793) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_99| 28) |~#a~0.offset|)) 0)))))) is different from false [2023-08-03 21:30:56,388 WARN L233 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:30:56,817 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-03 21:30:56,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734901564] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:30:56,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:30:56,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2023-08-03 21:30:56,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802811878] [2023-08-03 21:30:56,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:30:56,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-03 21:30:56,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:30:56,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-03 21:30:56,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=328, Unknown=5, NotChecked=120, Total=552 [2023-08-03 21:30:57,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 472 [2023-08-03 21:30:57,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 383 transitions, 4892 flow. Second operand has 24 states, 24 states have (on average 149.20833333333334) internal successors, (3581), 24 states have internal predecessors, (3581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:57,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:30:57,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 472 [2023-08-03 21:30:57,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:31:23,261 WARN L233 SmtUtils]: Spent 26.14s on a formula simplification. DAG size of input: 60 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:31:25,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:31:27,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 21:31:29,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 21:31:31,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 21:31:33,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 21:31:35,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:31:37,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 21:31:41,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:31:43,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 21:31:45,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:31:47,263 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, 1] [2023-08-03 21:31:49,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:02,372 INFO L124 PetriNetUnfolderBase]: 20256/38746 cut-off events. [2023-08-03 21:32:02,372 INFO L125 PetriNetUnfolderBase]: For 281153/281343 co-relation queries the response was YES. [2023-08-03 21:32:02,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180871 conditions, 38746 events. 20256/38746 cut-off events. For 281153/281343 co-relation queries the response was YES. Maximal size of possible extension queue 1545. Compared 374867 event pairs, 3334 based on Foata normal form. 59/35311 useless extension candidates. Maximal degree in co-relation 178613. Up to 16702 conditions per place. [2023-08-03 21:32:02,903 INFO L140 encePairwiseOnDemand]: 442/472 looper letters, 446 selfloop transitions, 281 changer transitions 214/950 dead transitions. [2023-08-03 21:32:02,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 950 transitions, 10961 flow [2023-08-03 21:32:02,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-03 21:32:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-03 21:32:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4540 transitions. [2023-08-03 21:32:02,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35624607658505963 [2023-08-03 21:32:02,908 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4540 transitions. [2023-08-03 21:32:02,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4540 transitions. [2023-08-03 21:32:02,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:32:02,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4540 transitions. [2023-08-03 21:32:02,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 168.14814814814815) internal successors, (4540), 27 states have internal predecessors, (4540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:02,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 472.0) internal successors, (13216), 28 states have internal predecessors, (13216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:02,924 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 472.0) internal successors, (13216), 28 states have internal predecessors, (13216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:02,924 INFO L175 Difference]: Start difference. First operand has 208 places, 383 transitions, 4892 flow. Second operand 27 states and 4540 transitions. [2023-08-03 21:32:02,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 950 transitions, 10961 flow [2023-08-03 21:32:05,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 950 transitions, 10799 flow, removed 72 selfloop flow, removed 3 redundant places. [2023-08-03 21:32:05,218 INFO L231 Difference]: Finished difference. Result has 245 places, 465 transitions, 6689 flow [2023-08-03 21:32:05,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=4731, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=6689, PETRI_PLACES=245, PETRI_TRANSITIONS=465} [2023-08-03 21:32:05,219 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 177 predicate places. [2023-08-03 21:32:05,219 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 465 transitions, 6689 flow [2023-08-03 21:32:05,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 149.20833333333334) internal successors, (3581), 24 states have internal predecessors, (3581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:05,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:32:05,219 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:32:05,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-03 21:32:05,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:32:05,420 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:32:05,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:32:05,420 INFO L85 PathProgramCache]: Analyzing trace with hash 348077058, now seen corresponding path program 4 times [2023-08-03 21:32:05,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:32:05,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467590466] [2023-08-03 21:32:05,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:32:05,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:32:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:32:06,207 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 21:32:06,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:32:06,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467590466] [2023-08-03 21:32:06,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467590466] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:32:06,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322748207] [2023-08-03 21:32:06,208 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-03 21:32:06,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:32:06,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:32:06,209 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:32:06,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-03 21:32:06,352 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-03 21:32:06,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:32:06,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-03 21:32:06,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:32:06,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-03 21:32:06,477 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:32:06,478 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 21:32:06,511 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:32:06,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:32:06,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-03 21:32:06,627 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:32:06,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 21:32:06,678 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-03 21:32:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 21:32:06,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:32:06,920 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-08-03 21:32:06,928 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2023-08-03 21:32:17,025 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_101| Int) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_119| Int) (v_ArrVal_878 Int) (v_ArrVal_874 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~i~0#1_119| |v_t_funThread2of2ForFork0_~i~0#1_101|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_874) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_119| 28) |~#a~0.offset|) v_ArrVal_878) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_101| 28) |~#a~0.offset|)) 0))) is different from false [2023-08-03 21:32:17,235 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-03 21:32:17,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322748207] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:32:17,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:32:17,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-08-03 21:32:17,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991353293] [2023-08-03 21:32:17,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:32:17,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-03 21:32:17,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:32:17,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-03 21:32:17,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=257, Unknown=5, NotChecked=34, Total=380 [2023-08-03 21:32:17,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 472 [2023-08-03 21:32:17,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 465 transitions, 6689 flow. Second operand has 20 states, 20 states have (on average 149.7) internal successors, (2994), 20 states have internal predecessors, (2994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:17,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:32:17,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 472 [2023-08-03 21:32:17,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:32:27,024 INFO L124 PetriNetUnfolderBase]: 20735/39931 cut-off events. [2023-08-03 21:32:27,024 INFO L125 PetriNetUnfolderBase]: For 440302/440550 co-relation queries the response was YES. [2023-08-03 21:32:27,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217994 conditions, 39931 events. 20735/39931 cut-off events. For 440302/440550 co-relation queries the response was YES. Maximal size of possible extension queue 1590. Compared 391001 event pairs, 5535 based on Foata normal form. 61/36353 useless extension candidates. Maximal degree in co-relation 215311. Up to 20356 conditions per place. [2023-08-03 21:32:27,626 INFO L140 encePairwiseOnDemand]: 454/472 looper letters, 524 selfloop transitions, 191 changer transitions 97/821 dead transitions. [2023-08-03 21:32:27,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 821 transitions, 11314 flow [2023-08-03 21:32:27,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-03 21:32:27,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-03 21:32:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2587 transitions. [2023-08-03 21:32:27,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3653954802259887 [2023-08-03 21:32:27,629 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2587 transitions. [2023-08-03 21:32:27,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2587 transitions. [2023-08-03 21:32:27,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:32:27,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2587 transitions. [2023-08-03 21:32:27,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 172.46666666666667) internal successors, (2587), 15 states have internal predecessors, (2587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:27,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 472.0) internal successors, (7552), 16 states have internal predecessors, (7552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:27,635 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 472.0) internal successors, (7552), 16 states have internal predecessors, (7552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:27,635 INFO L175 Difference]: Start difference. First operand has 245 places, 465 transitions, 6689 flow. Second operand 15 states and 2587 transitions. [2023-08-03 21:32:27,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 821 transitions, 11314 flow [2023-08-03 21:32:31,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 821 transitions, 10569 flow, removed 238 selfloop flow, removed 10 redundant places. [2023-08-03 21:32:31,704 INFO L231 Difference]: Finished difference. Result has 253 places, 488 transitions, 6988 flow [2023-08-03 21:32:31,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=6058, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6988, PETRI_PLACES=253, PETRI_TRANSITIONS=488} [2023-08-03 21:32:31,705 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 185 predicate places. [2023-08-03 21:32:31,705 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 488 transitions, 6988 flow [2023-08-03 21:32:31,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 149.7) internal successors, (2994), 20 states have internal predecessors, (2994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:31,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:32:31,705 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:32:31,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-03 21:32:31,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:32:31,906 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:32:31,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:32:31,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1059432720, now seen corresponding path program 3 times [2023-08-03 21:32:31,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:32:31,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722240549] [2023-08-03 21:32:31,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:32:31,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:32:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:32:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 21:32:32,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:32:32,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722240549] [2023-08-03 21:32:32,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722240549] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:32:32,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297875284] [2023-08-03 21:32:32,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 21:32:32,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:32:32,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:32:32,654 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:32:32,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-03 21:32:32,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-03 21:32:32,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:32:32,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-03 21:32:32,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:32:32,817 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-03 21:32:32,997 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:32:32,998 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 21:32:33,051 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:32:33,098 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:32:33,155 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-03 21:32:33,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:32:33,228 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 21:32:33,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-03 21:32:33,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:32:33,367 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 21:32:33,447 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:32:33,448 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 21:32:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 21:32:33,524 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:32:33,594 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_965 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_121| Int)) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_121| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_965) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2023-08-03 21:32:33,704 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:32:33,705 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-03 21:32:33,720 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:32:33,720 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-03 21:32:33,727 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-03 21:32:39,986 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_103| Int) (v_ArrVal_959 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_121| Int) (v_ArrVal_963 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_959) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_103| 28) |~#a~0.offset|) v_ArrVal_963) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_121| 28) |~#a~0.offset|)) 0) (= |v_t_funThread1of2ForFork0_~i~0#1_121| |v_t_funThread2of2ForFork0_~i~0#1_103|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-03 21:32:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-03 21:32:44,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297875284] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:32:44,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:32:44,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2023-08-03 21:32:44,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700675886] [2023-08-03 21:32:44,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:32:44,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-03 21:32:44,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:32:44,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-03 21:32:44,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=317, Unknown=4, NotChecked=78, Total=506 [2023-08-03 21:32:46,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:48,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:50,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:52,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:54,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:56,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:58,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:33:00,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:33:02,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:33:02,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 472 [2023-08-03 21:33:02,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 488 transitions, 6988 flow. Second operand has 23 states, 23 states have (on average 149.30434782608697) internal successors, (3434), 23 states have internal predecessors, (3434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:02,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:33:02,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 472 [2023-08-03 21:33:02,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:33:10,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:33:16,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:33:22,658 INFO L124 PetriNetUnfolderBase]: 22765/43544 cut-off events. [2023-08-03 21:33:22,659 INFO L125 PetriNetUnfolderBase]: For 502194/502220 co-relation queries the response was YES. [2023-08-03 21:33:23,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239535 conditions, 43544 events. 22765/43544 cut-off events. For 502194/502220 co-relation queries the response was YES. Maximal size of possible extension queue 1818. Compared 429294 event pairs, 5134 based on Foata normal form. 68/39668 useless extension candidates. Maximal degree in co-relation 236777. Up to 22223 conditions per place. [2023-08-03 21:33:23,381 INFO L140 encePairwiseOnDemand]: 447/472 looper letters, 513 selfloop transitions, 273 changer transitions 113/908 dead transitions. [2023-08-03 21:33:23,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 908 transitions, 12390 flow [2023-08-03 21:33:23,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-03 21:33:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-03 21:33:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2945 transitions. [2023-08-03 21:33:23,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36702392821535396 [2023-08-03 21:33:23,385 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2945 transitions. [2023-08-03 21:33:23,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2945 transitions. [2023-08-03 21:33:23,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:33:23,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2945 transitions. [2023-08-03 21:33:23,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 173.23529411764707) internal successors, (2945), 17 states have internal predecessors, (2945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:23,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 472.0) internal successors, (8496), 18 states have internal predecessors, (8496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:23,395 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 472.0) internal successors, (8496), 18 states have internal predecessors, (8496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:23,396 INFO L175 Difference]: Start difference. First operand has 253 places, 488 transitions, 6988 flow. Second operand 17 states and 2945 transitions. [2023-08-03 21:33:23,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 908 transitions, 12390 flow [2023-08-03 21:33:27,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 908 transitions, 12170 flow, removed 17 selfloop flow, removed 7 redundant places. [2023-08-03 21:33:27,467 INFO L231 Difference]: Finished difference. Result has 271 places, 580 transitions, 8935 flow [2023-08-03 21:33:27,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=6768, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=8935, PETRI_PLACES=271, PETRI_TRANSITIONS=580} [2023-08-03 21:33:27,468 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 203 predicate places. [2023-08-03 21:33:27,468 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 580 transitions, 8935 flow [2023-08-03 21:33:27,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 149.30434782608697) internal successors, (3434), 23 states have internal predecessors, (3434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:27,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:33:27,468 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:33:27,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-03 21:33:27,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:33:27,669 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:33:27,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:33:27,670 INFO L85 PathProgramCache]: Analyzing trace with hash -977292580, now seen corresponding path program 1 times [2023-08-03 21:33:27,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:33:27,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701600861] [2023-08-03 21:33:27,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:27,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:33:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 21:33:28,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:33:28,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701600861] [2023-08-03 21:33:28,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701600861] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:33:28,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358370931] [2023-08-03 21:33:28,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:28,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:33:28,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:33:28,281 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:33:28,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-03 21:33:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:28,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-03 21:33:28,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:33:28,431 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-03 21:33:28,531 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:33:28,532 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 21:33:28,561 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:33:28,587 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-03 21:33:28,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:33:28,788 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:33:28,788 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 21:33:28,911 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-03 21:33:29,001 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 21:33:29,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:33:29,254 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-08-03 21:33:29,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2023-08-03 21:33:31,287 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 Int) (|v_t_funThread1of2ForFork0_~i~0#1_123| Int) (v_ArrVal_1048 (Array Int Int)) (|~#a~0.offset| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_123| 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_123|) (= |v_t_funThread1of2ForFork0_~i~0#1_123| |ULTIMATE.start_main_~i~2#1|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1048) |c_~#a~0.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|) v_ArrVal_1050) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_123| 28) |~#a~0.offset|)) 0))) is different from false [2023-08-03 21:33:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-03 21:33:31,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358370931] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:33:31,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:33:31,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2023-08-03 21:33:31,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229920947] [2023-08-03 21:33:31,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:33:31,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-03 21:33:31,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:33:31,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-03 21:33:31,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=302, Unknown=2, NotChecked=36, Total=420 [2023-08-03 21:33:31,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 472 [2023-08-03 21:33:31,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 580 transitions, 8935 flow. Second operand has 21 states, 21 states have (on average 149.71428571428572) internal successors, (3144), 21 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:31,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:33:31,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 472 [2023-08-03 21:33:31,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:33:45,998 INFO L124 PetriNetUnfolderBase]: 27471/52599 cut-off events. [2023-08-03 21:33:45,998 INFO L125 PetriNetUnfolderBase]: For 700236/700322 co-relation queries the response was YES. [2023-08-03 21:33:46,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306918 conditions, 52599 events. 27471/52599 cut-off events. For 700236/700322 co-relation queries the response was YES. Maximal size of possible extension queue 2056. Compared 531684 event pairs, 7512 based on Foata normal form. 76/47619 useless extension candidates. Maximal degree in co-relation 304102. Up to 26185 conditions per place. [2023-08-03 21:33:47,091 INFO L140 encePairwiseOnDemand]: 452/472 looper letters, 736 selfloop transitions, 305 changer transitions 148/1198 dead transitions. [2023-08-03 21:33:47,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 1198 transitions, 19235 flow [2023-08-03 21:33:47,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-03 21:33:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-03 21:33:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3870 transitions. [2023-08-03 21:33:47,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.356484893146647 [2023-08-03 21:33:47,098 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3870 transitions. [2023-08-03 21:33:47,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3870 transitions. [2023-08-03 21:33:47,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:33:47,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3870 transitions. [2023-08-03 21:33:47,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 168.2608695652174) internal successors, (3870), 23 states have internal predecessors, (3870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:47,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 472.0) internal successors, (11328), 24 states have internal predecessors, (11328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:47,114 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 472.0) internal successors, (11328), 24 states have internal predecessors, (11328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:47,114 INFO L175 Difference]: Start difference. First operand has 271 places, 580 transitions, 8935 flow. Second operand 23 states and 3870 transitions. [2023-08-03 21:33:47,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 1198 transitions, 19235 flow [2023-08-03 21:33:54,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 1198 transitions, 18169 flow, removed 343 selfloop flow, removed 4 redundant places. [2023-08-03 21:33:54,974 INFO L231 Difference]: Finished difference. Result has 299 places, 724 transitions, 12053 flow [2023-08-03 21:33:54,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=8185, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=12053, PETRI_PLACES=299, PETRI_TRANSITIONS=724} [2023-08-03 21:33:54,975 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 231 predicate places. [2023-08-03 21:33:54,975 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 724 transitions, 12053 flow [2023-08-03 21:33:54,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 149.71428571428572) internal successors, (3144), 21 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:54,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:33:54,976 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:33:54,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-03 21:33:55,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-03 21:33:55,181 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:33:55,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:33:55,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2105779222, now seen corresponding path program 1 times [2023-08-03 21:33:55,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:33:55,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424029436] [2023-08-03 21:33:55,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:55,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:33:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 21:33:55,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:33:55,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424029436] [2023-08-03 21:33:55,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424029436] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:33:55,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487237123] [2023-08-03 21:33:55,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:55,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:33:55,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:33:55,794 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:33:55,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-03 21:33:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:55,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-03 21:33:55,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:33:55,934 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-03 21:33:56,066 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:33:56,066 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 21:33:56,098 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:33:56,139 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-03 21:33:56,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:33:56,222 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 21:33:56,262 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:33:56,340 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-03 21:33:56,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:33:56,382 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 21:33:56,443 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:33:56,443 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 21:33:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 21:33:56,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:33:56,735 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1137 (Array Int Int)) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1135 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1137) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1134) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_1135) (+ .cse0 |c_~#a~0.offset|)))))) is different from false [2023-08-03 21:33:56,780 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:33:56,781 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-03 21:33:56,798 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:33:56,798 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-03 21:33:56,806 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-03 21:33:56,879 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~i~0#1_125| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_125| 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_125|) (forall ((v_ArrVal_1134 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_1135 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1134) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_125| 28) |~#a~0.offset|) v_ArrVal_1135) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|)) 0) (= |v_t_funThread1of2ForFork0_~i~0#1_125| |ULTIMATE.start_main_~i~2#1|))))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_125| Int) (v_ArrVal_1134 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_1135 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_125| 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_125|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1134) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_125| 28) |~#a~0.offset|) v_ArrVal_1135) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|)) 0))))) is different from false [2023-08-03 21:34:05,068 WARN L233 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:34:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 6 not checked. [2023-08-03 21:34:05,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487237123] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:34:05,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:34:05,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2023-08-03 21:34:05,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820191922] [2023-08-03 21:34:05,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:34:05,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-03 21:34:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:34:05,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-03 21:34:05,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=328, Unknown=4, NotChecked=78, Total=506 [2023-08-03 21:34:05,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 472 [2023-08-03 21:34:05,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 724 transitions, 12053 flow. Second operand has 23 states, 23 states have (on average 149.43478260869566) internal successors, (3437), 23 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:05,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:34:05,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 472 [2023-08-03 21:34:05,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:34:14,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:34:26,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:34:43,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:34:48,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:34:53,579 INFO L124 PetriNetUnfolderBase]: 33573/65317 cut-off events. [2023-08-03 21:34:53,579 INFO L125 PetriNetUnfolderBase]: For 914689/914765 co-relation queries the response was YES. [2023-08-03 21:34:54,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386322 conditions, 65317 events. 33573/65317 cut-off events. For 914689/914765 co-relation queries the response was YES. Maximal size of possible extension queue 2464. Compared 686269 event pairs, 7066 based on Foata normal form. 214/59762 useless extension candidates. Maximal degree in co-relation 381156. Up to 27215 conditions per place. [2023-08-03 21:34:54,835 INFO L140 encePairwiseOnDemand]: 450/472 looper letters, 660 selfloop transitions, 465 changer transitions 449/1583 dead transitions. [2023-08-03 21:34:54,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 1583 transitions, 25541 flow [2023-08-03 21:34:54,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-03 21:34:54,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-03 21:34:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 4880 transitions. [2023-08-03 21:34:54,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3565166569257744 [2023-08-03 21:34:54,843 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 4880 transitions. [2023-08-03 21:34:54,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 4880 transitions. [2023-08-03 21:34:54,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:34:54,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 4880 transitions. [2023-08-03 21:34:54,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 168.27586206896552) internal successors, (4880), 29 states have internal predecessors, (4880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:54,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 472.0) internal successors, (14160), 30 states have internal predecessors, (14160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:54,858 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 472.0) internal successors, (14160), 30 states have internal predecessors, (14160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:54,858 INFO L175 Difference]: Start difference. First operand has 299 places, 724 transitions, 12053 flow. Second operand 29 states and 4880 transitions. [2023-08-03 21:34:54,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 1583 transitions, 25541 flow [2023-08-03 21:35:05,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 1583 transitions, 25154 flow, removed 72 selfloop flow, removed 5 redundant places. [2023-08-03 21:35:05,351 INFO L231 Difference]: Finished difference. Result has 339 places, 822 transitions, 15098 flow [2023-08-03 21:35:05,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=11699, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=344, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=15098, PETRI_PLACES=339, PETRI_TRANSITIONS=822} [2023-08-03 21:35:05,352 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 271 predicate places. [2023-08-03 21:35:05,352 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 822 transitions, 15098 flow [2023-08-03 21:35:05,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 149.43478260869566) internal successors, (3437), 23 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:35:05,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:35:05,352 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:35:05,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-03 21:35:05,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:35:05,553 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:35:05,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:35:05,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2063061824, now seen corresponding path program 2 times [2023-08-03 21:35:05,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:35:05,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942211566] [2023-08-03 21:35:05,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:35:05,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:35:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:35:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:35:18,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:35:18,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942211566] [2023-08-03 21:35:18,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942211566] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:35:18,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227034676] [2023-08-03 21:35:18,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:35:18,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:35:18,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:35:18,713 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:35:18,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-03 21:35:18,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:35:18,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:35:18,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-03 21:35:18,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:35:18,847 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-03 21:35:18,950 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:35:18,950 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 21:35:19,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-03 21:35:19,025 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-03 21:35:19,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:35:19,135 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 21:35:19,205 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:35:19,296 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:35:19,296 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 21:35:19,356 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-03 21:35:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 21:35:19,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:35:19,855 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:35:19,855 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-03 21:35:19,868 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:35:19,869 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-03 21:35:19,876 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-03 21:35:19,910 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (forall ((|v_t_funThread1of2ForFork0_~i~0#1_127| Int) (v_ArrVal_1222 Int) (v_ArrVal_1221 (Array Int Int)) (|~#a~0.offset| Int)) (or (= |v_t_funThread1of2ForFork0_~i~0#1_127| |c_ULTIMATE.start_main_~i~2#1|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1221) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_127| 28) |~#a~0.offset|) v_ArrVal_1222) (+ .cse0 |~#a~0.offset|)) 0))) (or (forall ((|v_t_funThread1of2ForFork0_~i~0#1_127| Int) (v_ArrVal_1222 Int) (v_ArrVal_1221 (Array Int Int)) (|~#a~0.offset| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1221) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_127| 28) |~#a~0.offset|) v_ArrVal_1222) (+ .cse0 |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-08-03 21:35:28,076 WARN L233 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:35:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-03 21:35:28,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227034676] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:35:28,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:35:28,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 7] total 33 [2023-08-03 21:35:28,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111376331] [2023-08-03 21:35:28,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:35:28,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-03 21:35:28,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:35:28,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-03 21:35:28,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=938, Unknown=4, NotChecked=64, Total=1190 [2023-08-03 21:35:28,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 472 [2023-08-03 21:35:28,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 822 transitions, 15098 flow. Second operand has 35 states, 35 states have (on average 136.88571428571427) internal successors, (4791), 35 states have internal predecessors, (4791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:35:28,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:35:28,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 472 [2023-08-03 21:35:28,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:36:08,828 INFO L124 PetriNetUnfolderBase]: 49498/99518 cut-off events. [2023-08-03 21:36:08,828 INFO L125 PetriNetUnfolderBase]: For 1818862/1818992 co-relation queries the response was YES. [2023-08-03 21:36:11,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640819 conditions, 99518 events. 49498/99518 cut-off events. For 1818862/1818992 co-relation queries the response was YES. Maximal size of possible extension queue 4094. Compared 1140827 event pairs, 12916 based on Foata normal form. 456/90786 useless extension candidates. Maximal degree in co-relation 636226. Up to 35191 conditions per place. [2023-08-03 21:36:11,746 INFO L140 encePairwiseOnDemand]: 436/472 looper letters, 1158 selfloop transitions, 773 changer transitions 352/2292 dead transitions. [2023-08-03 21:36:11,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 2292 transitions, 42001 flow [2023-08-03 21:36:11,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-08-03 21:36:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-08-03 21:36:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 6668 transitions. [2023-08-03 21:36:11,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3210708782742681 [2023-08-03 21:36:11,753 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 6668 transitions. [2023-08-03 21:36:11,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 6668 transitions. [2023-08-03 21:36:11,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:36:11,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 6668 transitions. [2023-08-03 21:36:11,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 151.54545454545453) internal successors, (6668), 44 states have internal predecessors, (6668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:36:11,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 472.0) internal successors, (21240), 45 states have internal predecessors, (21240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:36:11,786 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 472.0) internal successors, (21240), 45 states have internal predecessors, (21240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:36:11,786 INFO L175 Difference]: Start difference. First operand has 339 places, 822 transitions, 15098 flow. Second operand 44 states and 6668 transitions. [2023-08-03 21:36:11,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 2292 transitions, 42001 flow [2023-08-03 21:36:43,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 2292 transitions, 39698 flow, removed 864 selfloop flow, removed 9 redundant places. [2023-08-03 21:36:43,054 INFO L231 Difference]: Finished difference. Result has 386 places, 1307 transitions, 26020 flow [2023-08-03 21:36:43,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=14142, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=822, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=366, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=26020, PETRI_PLACES=386, PETRI_TRANSITIONS=1307} [2023-08-03 21:36:43,055 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 318 predicate places. [2023-08-03 21:36:43,055 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 1307 transitions, 26020 flow [2023-08-03 21:36:43,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 136.88571428571427) internal successors, (4791), 35 states have internal predecessors, (4791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:36:43,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:36:43,056 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:36:43,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-03 21:36:43,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:36:43,262 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:36:43,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:36:43,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1448576722, now seen corresponding path program 3 times [2023-08-03 21:36:43,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:36:43,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041013666] [2023-08-03 21:36:43,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:36:43,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:36:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:36:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:36:45,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:36:45,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041013666] [2023-08-03 21:36:45,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041013666] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:36:45,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773494971] [2023-08-03 21:36:45,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 21:36:45,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:36:45,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:36:45,771 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:36:45,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-03 21:36:45,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-03 21:36:45,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:36:45,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-03 21:36:45,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:36:45,942 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-03 21:36:46,154 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-03 21:36:46,154 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-03 21:36:46,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:46,230 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:36:46,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:46,298 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:36:46,371 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-03 21:36:46,454 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:36:46,455 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 21:36:46,562 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-03 21:36:46,657 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 21:36:46,657 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:36:46,844 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-08-03 21:36:46,848 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2023-08-03 21:36:58,925 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1304 (Array Int Int)) (|~#a~0.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1304) |c_~#a~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-08-03 21:36:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-03 21:36:59,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773494971] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:36:59,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:36:59,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 27 [2023-08-03 21:36:59,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886781009] [2023-08-03 21:36:59,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:36:59,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-03 21:36:59,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:36:59,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-03 21:36:59,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=613, Unknown=3, NotChecked=52, Total=812 [2023-08-03 21:36:59,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 472 [2023-08-03 21:36:59,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 1307 transitions, 26020 flow. Second operand has 29 states, 29 states have (on average 138.0344827586207) internal successors, (4003), 29 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:36:59,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:36:59,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 472 [2023-08-03 21:36:59,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:37:46,162 INFO L124 PetriNetUnfolderBase]: 52171/106328 cut-off events. [2023-08-03 21:37:46,162 INFO L125 PetriNetUnfolderBase]: For 2292487/2292739 co-relation queries the response was YES. [2023-08-03 21:37:49,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740030 conditions, 106328 events. 52171/106328 cut-off events. For 2292487/2292739 co-relation queries the response was YES. Maximal size of possible extension queue 4402. Compared 1243809 event pairs, 17192 based on Foata normal form. 179/96810 useless extension candidates. Maximal degree in co-relation 733833. Up to 51298 conditions per place. [2023-08-03 21:37:49,533 INFO L140 encePairwiseOnDemand]: 453/472 looper letters, 1077 selfloop transitions, 434 changer transitions 283/1803 dead transitions. [2023-08-03 21:37:49,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 1803 transitions, 37338 flow [2023-08-03 21:37:49,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-03 21:37:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-03 21:37:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3608 transitions. [2023-08-03 21:37:49,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3185028248587571 [2023-08-03 21:37:49,536 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3608 transitions. [2023-08-03 21:37:49,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3608 transitions. [2023-08-03 21:37:49,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:37:49,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3608 transitions. [2023-08-03 21:37:49,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 150.33333333333334) internal successors, (3608), 24 states have internal predecessors, (3608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:37:49,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 472.0) internal successors, (11800), 25 states have internal predecessors, (11800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:37:49,550 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 472.0) internal successors, (11800), 25 states have internal predecessors, (11800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:37:49,550 INFO L175 Difference]: Start difference. First operand has 386 places, 1307 transitions, 26020 flow. Second operand 24 states and 3608 transitions. [2023-08-03 21:37:49,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 1803 transitions, 37338 flow [2023-08-03 21:38:34,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 1803 transitions, 36447 flow, removed 401 selfloop flow, removed 14 redundant places. [2023-08-03 21:38:34,502 INFO L231 Difference]: Finished difference. Result has 400 places, 1305 transitions, 26358 flow [2023-08-03 21:38:34,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=25153, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=364, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=892, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=26358, PETRI_PLACES=400, PETRI_TRANSITIONS=1305} [2023-08-03 21:38:34,504 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 332 predicate places. [2023-08-03 21:38:34,504 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 1305 transitions, 26358 flow [2023-08-03 21:38:34,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 138.0344827586207) internal successors, (4003), 29 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:38:34,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:38:34,505 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:38:34,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-08-03 21:38:34,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:38:34,709 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:38:34,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:38:34,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1350295752, now seen corresponding path program 1 times [2023-08-03 21:38:34,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:38:34,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325458641] [2023-08-03 21:38:34,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:38:34,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:38:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:38:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 21:38:35,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:38:35,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325458641] [2023-08-03 21:38:35,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325458641] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:38:35,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883302669] [2023-08-03 21:38:35,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:38:35,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:38:35,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:38:35,365 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:38:35,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-03 21:38:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:38:35,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-03 21:38:35,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:38:35,499 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-03 21:38:35,599 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:38:35,599 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 21:38:35,633 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:38:35,665 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:38:35,708 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-03 21:38:35,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:38:35,778 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 21:38:35,828 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:38:35,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 21:38:35,870 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-03 21:38:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 21:38:35,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:38:36,026 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1392 (Array Int Int)) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1392) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0))))) (forall ((v_ArrVal_1392 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1392) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 4)) 0)))) is different from false [2023-08-03 21:38:36,055 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:38:36,055 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 71 treesize of output 59 [2023-08-03 21:38:36,065 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:38:36,065 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 75 [2023-08-03 21:38:36,070 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 54 treesize of output 47 [2023-08-03 21:38:36,073 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 47 treesize of output 40 [2023-08-03 21:38:40,148 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1389 (Array Int Int)) (|~#a~0.offset| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1389) |c_~#a~0.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-03 21:38:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-03 21:38:44,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883302669] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:38:44,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:38:44,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-08-03 21:38:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676449027] [2023-08-03 21:38:44,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:38:44,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-03 21:38:44,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:38:44,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-03 21:38:44,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=294, Unknown=3, NotChecked=74, Total=462 [2023-08-03 21:38:44,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 472 [2023-08-03 21:38:44,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 1305 transitions, 26358 flow. Second operand has 22 states, 22 states have (on average 147.36363636363637) internal successors, (3242), 22 states have internal predecessors, (3242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:38:44,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:38:44,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 472 [2023-08-03 21:38:44,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-08-03 21:39:32,263 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-03 21:39:32,274 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-03 21:39:33,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-03 21:39:33,475 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-03 21:39:33,524 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 137 [2023-08-03 21:39:36,143 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-03 21:39:36,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-03 21:39:36,144 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-03 21:39:36,144 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 21:39:36,144 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-03 21:39:36,144 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-03 21:39:36,144 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-08-03 21:39:36,144 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (2/2) [2023-08-03 21:39:36,146 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 21:39:36,146 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 21:39:36,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 09:39:36 BasicIcfg [2023-08-03 21:39:36,149 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 21:39:36,149 INFO L158 Benchmark]: Toolchain (without parser) took 777311.11ms. Allocated memory was 323.0MB in the beginning and 15.5GB in the end (delta: 15.2GB). Free memory was 274.9MB in the beginning and 12.4GB in the end (delta: -12.1GB). Peak memory consumption was 7.8GB. Max. memory is 16.0GB. [2023-08-03 21:39:36,149 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 323.0MB. Free memory is still 279.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 21:39:36,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.02ms. Allocated memory is still 323.0MB. Free memory was 274.6MB in the beginning and 245.1MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-03 21:39:36,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.44ms. Allocated memory is still 323.0MB. Free memory was 245.1MB in the beginning and 242.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 21:39:36,150 INFO L158 Benchmark]: Boogie Preprocessor took 46.37ms. Allocated memory is still 323.0MB. Free memory was 242.4MB in the beginning and 240.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 21:39:36,150 INFO L158 Benchmark]: RCFGBuilder took 503.19ms. Allocated memory was 323.0MB in the beginning and 392.2MB in the end (delta: 69.2MB). Free memory was 240.0MB in the beginning and 349.0MB in the end (delta: -108.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.0GB. [2023-08-03 21:39:36,150 INFO L158 Benchmark]: TraceAbstraction took 776124.80ms. Allocated memory was 392.2MB in the beginning and 15.5GB in the end (delta: 15.1GB). Free memory was 347.9MB in the beginning and 12.4GB in the end (delta: -12.0GB). Peak memory consumption was 7.8GB. Max. memory is 16.0GB. [2023-08-03 21:39:36,151 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 323.0MB. Free memory is still 279.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 567.02ms. Allocated memory is still 323.0MB. Free memory was 274.6MB in the beginning and 245.1MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 64.44ms. Allocated memory is still 323.0MB. Free memory was 245.1MB in the beginning and 242.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 46.37ms. Allocated memory is still 323.0MB. Free memory was 242.4MB in the beginning and 240.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 503.19ms. Allocated memory was 323.0MB in the beginning and 392.2MB in the end (delta: 69.2MB). Free memory was 240.0MB in the beginning and 349.0MB in the end (delta: -108.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.0GB. * TraceAbstraction took 776124.80ms. Allocated memory was 392.2MB in the beginning and 15.5GB in the end (delta: 15.1GB). Free memory was 347.9MB in the beginning and 12.4GB in the end (delta: -12.0GB). Peak memory consumption was 7.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.8s, 158 PlacesBefore, 45 PlacesAfterwards, 185 TransitionsBefore, 65 TransitionsAfterwards, 10336 CoEnabledTransitionPairs, 5 FixpointIterations, 35 TrivialSequentialCompositions, 88 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 16 ConcurrentYvCompositions, 7 ChoiceCompositions, 151 TotalNumberOfCompositions, 15158 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8146, independent: 7914, independent conditional: 0, independent unconditional: 7914, dependent: 232, dependent conditional: 0, dependent unconditional: 232, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5129, independent: 5073, independent conditional: 0, independent unconditional: 5073, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8146, independent: 2841, independent conditional: 0, independent unconditional: 2841, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 5129, unknown conditional: 0, unknown unconditional: 5129] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 201, Positive conditional cache size: 0, Positive unconditional cache size: 201, 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, 220 PlacesBefore, 68 PlacesAfterwards, 260 TransitionsBefore, 100 TransitionsAfterwards, 31416 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 144 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 26 ConcurrentYvCompositions, 8 ChoiceCompositions, 218 TotalNumberOfCompositions, 55124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24876, independent: 24449, independent conditional: 0, independent unconditional: 24449, dependent: 427, dependent conditional: 0, dependent unconditional: 427, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15412, independent: 15298, independent conditional: 0, independent unconditional: 15298, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 24876, independent: 9151, independent conditional: 0, independent unconditional: 9151, dependent: 313, dependent conditional: 0, dependent unconditional: 313, unknown: 15412, unknown conditional: 0, unknown unconditional: 15412] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 304, Positive conditional cache size: 0, Positive unconditional cache size: 304, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 220 PlacesBefore, 68 PlacesAfterwards, 260 TransitionsBefore, 100 TransitionsAfterwards, 31416 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 138 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 26 ConcurrentYvCompositions, 8 ChoiceCompositions, 212 TotalNumberOfCompositions, 54087 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24876, independent: 24451, independent conditional: 0, independent unconditional: 24451, dependent: 425, dependent conditional: 0, dependent unconditional: 425, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15354, independent: 15256, independent conditional: 0, independent unconditional: 15256, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 24876, independent: 9195, independent conditional: 0, independent unconditional: 9195, dependent: 327, dependent conditional: 0, dependent unconditional: 327, unknown: 15354, unknown conditional: 0, unknown unconditional: 15354] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 395, Positive conditional cache size: 0, Positive unconditional cache size: 395, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 216 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: 4.7s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 344 IncrementalHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 9 mSDtfsCounter, 344 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.5s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 14/47 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 272 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: 6.8s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 580 IncrementalHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 2 mSDtfsCounter, 580 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=0, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 114 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 177/215 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 272 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: 764.5s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 594.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 320 mSolverCounterUnknown, 12209 SdHoareTripleChecker+Valid, 149.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11971 mSDsluCounter, 885 SdHoareTripleChecker+Invalid, 146.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 10472 IncrementalHoareTripleChecker+Unchecked, 844 mSDsCounter, 1828 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23011 IncrementalHoareTripleChecker+Invalid, 35631 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1828 mSolverCounterUnsat, 41 mSDtfsCounter, 23011 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1139 GetRequests, 627 SyntacticMatches, 28 SemanticMatches, 484 ConstructedPredicates, 20 IntricatePredicates, 1 DeprecatedPredicates, 3366 ImplicationChecksByTransitivity, 266.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26358occurred in iteration=17, InterpolantAutomatonStates: 292, 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.8s SatisfiabilityAnalysisTime, 161.1s InterpolantComputationTime, 839 NumberOfCodeBlocks, 813 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1179 ConstructedInterpolants, 347 QuantifiedInterpolants, 29648 SizeOfPredicates, 129 NumberOfNonLiveVariables, 3230 ConjunctsInSsa, 504 ConjunctsInUnsatCore, 47 InterpolantComputations, 4 PerfectInterpolantSequences, 1975/2226 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown