/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_76-tricky_address3_racefree_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 03:51:54,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 03:51:54,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 03:51:54,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 03:51:54,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 03:51:54,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 03:51:54,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 03:51:54,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 03:51:54,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 03:51:54,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 03:51:54,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 03:51:54,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 03:51:54,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 03:51:54,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 03:51:54,594 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 03:51:54,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 03:51:54,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 03:51:54,595 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 03:51:54,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 03:51:54,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 03:51:54,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 03:51:54,596 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 03:51:54,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 03:51:54,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 03:51:54,597 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 03:51:54,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 03:51:54,598 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 03:51:54,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 03:51:54,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 03:51:54,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 03:51:54,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:51:54,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 03:51:54,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 03:51:54,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 03:51:54,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 03:51:54,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 03:51:54,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 03:51:54,602 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 03:51:54,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 03:51:54,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 03:51:54,602 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 03:51:54,602 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 03:51:54,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 03:51:54,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 03:51:54,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 03:51:54,848 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 03:51:54,850 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 03:51:54,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_76-tricky_address3_racefree_bound2.i [2023-08-04 03:51:56,121 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 03:51:56,408 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 03:51:56,408 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_76-tricky_address3_racefree_bound2.i [2023-08-04 03:51:56,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ef18dde/9053ac251b1349ab800fdbc66925813a/FLAGe4f00cee6 [2023-08-04 03:51:56,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ef18dde/9053ac251b1349ab800fdbc66925813a [2023-08-04 03:51:56,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 03:51:56,460 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 03:51:56,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 03:51:56,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 03:51:56,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 03:51:56,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:51:56" (1/1) ... [2023-08-04 03:51:56,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b188b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:56, skipping insertion in model container [2023-08-04 03:51:56,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:51:56" (1/1) ... [2023-08-04 03:51:56,534 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 03:51:56,912 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_76-tricky_address3_racefree_bound2.i[41323,41336] [2023-08-04 03:51:56,945 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:51:56,959 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 03:51:56,982 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 03:51:56,984 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 03:51:56,991 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-04 03:51:57,008 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_76-tricky_address3_racefree_bound2.i[41323,41336] [2023-08-04 03:51:57,020 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:51:57,064 INFO L206 MainTranslator]: Completed translation [2023-08-04 03:51:57,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:57 WrapperNode [2023-08-04 03:51:57,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 03:51:57,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 03:51:57,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 03:51:57,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 03:51:57,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:57" (1/1) ... [2023-08-04 03:51:57,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:57" (1/1) ... [2023-08-04 03:51:57,126 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 193 [2023-08-04 03:51:57,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 03:51:57,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 03:51:57,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 03:51:57,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 03:51:57,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:57" (1/1) ... [2023-08-04 03:51:57,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:57" (1/1) ... [2023-08-04 03:51:57,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:57" (1/1) ... [2023-08-04 03:51:57,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:57" (1/1) ... [2023-08-04 03:51:57,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:57" (1/1) ... [2023-08-04 03:51:57,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:57" (1/1) ... [2023-08-04 03:51:57,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:57" (1/1) ... [2023-08-04 03:51:57,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:57" (1/1) ... [2023-08-04 03:51:57,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 03:51:57,167 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 03:51:57,167 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 03:51:57,167 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 03:51:57,168 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:57" (1/1) ... [2023-08-04 03:51:57,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:51:57,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:57,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 03:51:57,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 03:51:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 03:51:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 03:51:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 03:51:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 03:51:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-04 03:51:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 03:51:57,246 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-04 03:51:57,246 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-04 03:51:57,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 03:51:57,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 03:51:57,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 03:51:57,248 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 03:51:57,412 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 03:51:57,415 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 03:51:57,712 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 03:51:57,721 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 03:51:57,721 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-04 03:51:57,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:51:57 BoogieIcfgContainer [2023-08-04 03:51:57,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 03:51:57,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 03:51:57,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 03:51:57,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 03:51:57,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 03:51:56" (1/3) ... [2023-08-04 03:51:57,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fbe45dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:51:57, skipping insertion in model container [2023-08-04 03:51:57,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:57" (2/3) ... [2023-08-04 03:51:57,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fbe45dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:51:57, skipping insertion in model container [2023-08-04 03:51:57,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:51:57" (3/3) ... [2023-08-04 03:51:57,731 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_76-tricky_address3_racefree_bound2.i [2023-08-04 03:51:57,738 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 03:51:57,746 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 03:51:57,746 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 03:51:57,746 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 03:51:57,818 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-04 03:51:57,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 193 transitions, 394 flow [2023-08-04 03:51:57,927 INFO L124 PetriNetUnfolderBase]: 45/263 cut-off events. [2023-08-04 03:51:57,927 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-04 03:51:57,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 263 events. 45/263 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 814 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-08-04 03:51:57,940 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 193 transitions, 394 flow [2023-08-04 03:51:57,945 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 188 transitions, 381 flow [2023-08-04 03:51:57,949 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:51:57,957 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-04 03:51:57,959 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-04 03:51:57,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 188 transitions, 381 flow [2023-08-04 03:51:58,000 INFO L124 PetriNetUnfolderBase]: 44/258 cut-off events. [2023-08-04 03:51:58,000 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:58,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 258 events. 44/258 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 778 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-08-04 03:51:58,010 INFO L119 LiptonReduction]: Number of co-enabled transitions 10792 [2023-08-04 03:52:00,737 INFO L134 LiptonReduction]: Checked pairs total: 17790 [2023-08-04 03:52:00,737 INFO L136 LiptonReduction]: Total number of compositions: 164 [2023-08-04 03:52:00,759 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 03:52:00,766 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;@44d3beeb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:52:00,767 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 03:52:00,775 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:52:00,775 INFO L124 PetriNetUnfolderBase]: 4/19 cut-off events. [2023-08-04 03:52:00,775 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:52:00,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:00,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 03:52:00,776 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:52:00,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:00,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1355205613, now seen corresponding path program 1 times [2023-08-04 03:52:00,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:00,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060792346] [2023-08-04 03:52:00,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:00,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:52:00,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:00,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060792346] [2023-08-04 03:52:00,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060792346] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:52:00,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:52:00,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:52:01,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701691877] [2023-08-04 03:52:01,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:52:01,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:52:01,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:01,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:52:01,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:52:01,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 357 [2023-08-04 03:52:01,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:01,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:01,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 357 [2023-08-04 03:52:01,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:01,204 INFO L124 PetriNetUnfolderBase]: 272/614 cut-off events. [2023-08-04 03:52:01,205 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:52:01,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 614 events. 272/614 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3057 event pairs, 238 based on Foata normal form. 118/640 useless extension candidates. Maximal degree in co-relation 1094. Up to 528 conditions per place. [2023-08-04 03:52:01,209 INFO L140 encePairwiseOnDemand]: 332/357 looper letters, 34 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-04 03:52:01,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 167 flow [2023-08-04 03:52:01,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:52:01,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:52:01,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2023-08-04 03:52:01,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976657329598506 [2023-08-04 03:52:01,229 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 533 transitions. [2023-08-04 03:52:01,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 533 transitions. [2023-08-04 03:52:01,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:01,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 533 transitions. [2023-08-04 03:52:01,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:01,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:01,249 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:01,250 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 533 transitions. [2023-08-04 03:52:01,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 167 flow [2023-08-04 03:52:01,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 167 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:52:01,255 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 105 flow [2023-08-04 03:52:01,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2023-08-04 03:52:01,261 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-08-04 03:52:01,261 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 105 flow [2023-08-04 03:52:01,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:01,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:01,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:01,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 03:52:01,262 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:52:01,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:01,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1202044733, now seen corresponding path program 1 times [2023-08-04 03:52:01,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:01,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717969333] [2023-08-04 03:52:01,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:01,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:01,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:52:01,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:01,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717969333] [2023-08-04 03:52:01,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717969333] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:01,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116648395] [2023-08-04 03:52:01,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:01,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:01,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:01,365 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:52:01,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 03:52:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:01,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 03:52:01,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:52:01,472 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:52:01,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116648395] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:52:01,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:52:01,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 03:52:01,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092886427] [2023-08-04 03:52:01,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:52:01,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:52:01,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:01,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:52:01,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:52:01,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 357 [2023-08-04 03:52:01,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:01,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:01,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 357 [2023-08-04 03:52:01,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:01,588 INFO L124 PetriNetUnfolderBase]: 255/592 cut-off events. [2023-08-04 03:52:01,588 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:52:01,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 592 events. 255/592 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3266 event pairs, 0 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 1120. Up to 497 conditions per place. [2023-08-04 03:52:01,591 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 49 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-04 03:52:01,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 237 flow [2023-08-04 03:52:01,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:52:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:52:01,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2023-08-04 03:52:01,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2023-08-04 03:52:01,594 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2023-08-04 03:52:01,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2023-08-04 03:52:01,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:01,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2023-08-04 03:52:01,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:01,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:01,599 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:01,599 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 105 flow. Second operand 3 states and 525 transitions. [2023-08-04 03:52:01,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 237 flow [2023-08-04 03:52:01,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 233 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:52:01,601 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 109 flow [2023-08-04 03:52:01,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2023-08-04 03:52:01,602 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2023-08-04 03:52:01,602 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 109 flow [2023-08-04 03:52:01,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:01,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:01,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:01,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 03:52:01,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:01,809 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:52:01,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:01,809 INFO L85 PathProgramCache]: Analyzing trace with hash -96419517, now seen corresponding path program 1 times [2023-08-04 03:52:01,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:01,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288019736] [2023-08-04 03:52:01,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:01,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:52:01,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:01,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288019736] [2023-08-04 03:52:01,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288019736] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:01,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764982942] [2023-08-04 03:52:01,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:01,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:01,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:01,914 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:52:01,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 03:52:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:01,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:52:01,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:52:02,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:52:02,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764982942] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:02,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:02,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 03:52:02,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656858538] [2023-08-04 03:52:02,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:02,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 03:52:02,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:02,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 03:52:02,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 03:52:02,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 357 [2023-08-04 03:52:02,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 109 flow. Second operand has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:02,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:02,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 357 [2023-08-04 03:52:02,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:02,200 INFO L124 PetriNetUnfolderBase]: 271/599 cut-off events. [2023-08-04 03:52:02,200 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-04 03:52:02,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1176 conditions, 599 events. 271/599 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2938 event pairs, 238 based on Foata normal form. 3/529 useless extension candidates. Maximal degree in co-relation 1149. Up to 513 conditions per place. [2023-08-04 03:52:02,203 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 34 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-08-04 03:52:02,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 199 flow [2023-08-04 03:52:02,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:52:02,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:52:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 984 transitions. [2023-08-04 03:52:02,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45938375350140054 [2023-08-04 03:52:02,207 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 984 transitions. [2023-08-04 03:52:02,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 984 transitions. [2023-08-04 03:52:02,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:02,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 984 transitions. [2023-08-04 03:52:02,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:02,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:02,215 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:02,215 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 109 flow. Second operand 6 states and 984 transitions. [2023-08-04 03:52:02,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 199 flow [2023-08-04 03:52:02,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 03:52:02,218 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 141 flow [2023-08-04 03:52:02,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-08-04 03:52:02,221 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2023-08-04 03:52:02,221 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 141 flow [2023-08-04 03:52:02,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:02,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:02,222 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:02,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-04 03:52:02,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-04 03:52:02,428 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:52:02,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:02,428 INFO L85 PathProgramCache]: Analyzing trace with hash -888320147, now seen corresponding path program 2 times [2023-08-04 03:52:02,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:02,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113370849] [2023-08-04 03:52:02,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:02,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:02,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:52:02,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:02,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113370849] [2023-08-04 03:52:02,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113370849] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:02,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746614846] [2023-08-04 03:52:02,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:52:02,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:02,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:02,599 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:52:02,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 03:52:02,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-04 03:52:02,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:52:02,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-04 03:52:02,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:02,725 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:52:02,794 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:52:02,794 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:52:02,821 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:52:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 03:52:02,880 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:52:02,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746614846] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:52:02,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:52:02,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-04 03:52:02,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871613987] [2023-08-04 03:52:02,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:52:02,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 03:52:02,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:02,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 03:52:02,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-04 03:52:02,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 357 [2023-08-04 03:52:03,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 151.33333333333334) internal successors, (908), 6 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:03,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:03,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 357 [2023-08-04 03:52:03,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:03,233 INFO L124 PetriNetUnfolderBase]: 260/618 cut-off events. [2023-08-04 03:52:03,234 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-04 03:52:03,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 618 events. 260/618 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3247 event pairs, 31 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 1180. Up to 334 conditions per place. [2023-08-04 03:52:03,237 INFO L140 encePairwiseOnDemand]: 350/357 looper letters, 42 selfloop transitions, 6 changer transitions 25/81 dead transitions. [2023-08-04 03:52:03,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 357 flow [2023-08-04 03:52:03,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 03:52:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 03:52:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2023-08-04 03:52:03,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4599439775910364 [2023-08-04 03:52:03,243 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 821 transitions. [2023-08-04 03:52:03,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 821 transitions. [2023-08-04 03:52:03,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:03,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 821 transitions. [2023-08-04 03:52:03,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.2) internal successors, (821), 5 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:03,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:03,251 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:03,251 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 141 flow. Second operand 5 states and 821 transitions. [2023-08-04 03:52:03,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 357 flow [2023-08-04 03:52:03,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 343 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 03:52:03,255 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 145 flow [2023-08-04 03:52:03,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2023-08-04 03:52:03,258 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2023-08-04 03:52:03,258 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 145 flow [2023-08-04 03:52:03,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 151.33333333333334) internal successors, (908), 6 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:03,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:03,259 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:03,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 03:52:03,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:03,464 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:52:03,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:03,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1713486904, now seen corresponding path program 1 times [2023-08-04 03:52:03,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:03,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837162772] [2023-08-04 03:52:03,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:03,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 03:52:03,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:03,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837162772] [2023-08-04 03:52:03,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837162772] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:03,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019419881] [2023-08-04 03:52:03,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:03,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:03,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:03,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:52:03,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 03:52:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:03,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:52:03,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:52:03,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:52:03,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019419881] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:03,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:03,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-04 03:52:03,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709925802] [2023-08-04 03:52:03,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:03,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-04 03:52:03,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:03,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-04 03:52:03,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-04 03:52:03,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 357 [2023-08-04 03:52:03,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 145 flow. Second operand has 14 states, 14 states have (on average 155.21428571428572) internal successors, (2173), 14 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:03,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:03,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 357 [2023-08-04 03:52:03,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:03,855 INFO L124 PetriNetUnfolderBase]: 23/76 cut-off events. [2023-08-04 03:52:03,856 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2023-08-04 03:52:03,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 76 events. 23/76 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 141 event pairs, 0 based on Foata normal form. 18/91 useless extension candidates. Maximal degree in co-relation 155. Up to 46 conditions per place. [2023-08-04 03:52:03,856 INFO L140 encePairwiseOnDemand]: 352/357 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2023-08-04 03:52:03,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 234 flow [2023-08-04 03:52:03,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-04 03:52:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-04 03:52:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2188 transitions. [2023-08-04 03:52:03,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4377751100440176 [2023-08-04 03:52:03,863 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2188 transitions. [2023-08-04 03:52:03,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2188 transitions. [2023-08-04 03:52:03,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:03,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2188 transitions. [2023-08-04 03:52:03,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 156.28571428571428) internal successors, (2188), 14 states have internal predecessors, (2188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:03,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 357.0) internal successors, (5355), 15 states have internal predecessors, (5355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:03,878 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 357.0) internal successors, (5355), 15 states have internal predecessors, (5355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:03,878 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 145 flow. Second operand 14 states and 2188 transitions. [2023-08-04 03:52:03,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 234 flow [2023-08-04 03:52:03,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 213 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-04 03:52:03,881 INFO L231 Difference]: Finished difference. Result has 45 places, 0 transitions, 0 flow [2023-08-04 03:52:03,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=0, PETRI_PLACES=45, PETRI_TRANSITIONS=0} [2023-08-04 03:52:03,883 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2023-08-04 03:52:03,883 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 0 transitions, 0 flow [2023-08-04 03:52:03,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 155.21428571428572) internal successors, (2173), 14 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:03,886 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 03:52:03,886 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 03:52:03,887 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 03:52:03,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 03:52:04,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:04,093 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-08-04 03:52:04,095 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 03:52:04,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 193 transitions, 394 flow [2023-08-04 03:52:04,125 INFO L124 PetriNetUnfolderBase]: 45/263 cut-off events. [2023-08-04 03:52:04,126 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-04 03:52:04,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 263 events. 45/263 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 814 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-08-04 03:52:04,126 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 193 transitions, 394 flow [2023-08-04 03:52:04,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 188 transitions, 381 flow [2023-08-04 03:52:04,128 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:52:04,128 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-04 03:52:04,129 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-04 03:52:04,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 188 transitions, 381 flow [2023-08-04 03:52:04,152 INFO L124 PetriNetUnfolderBase]: 44/258 cut-off events. [2023-08-04 03:52:04,152 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:52:04,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 258 events. 44/258 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 778 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-08-04 03:52:04,158 INFO L119 LiptonReduction]: Number of co-enabled transitions 10792 [2023-08-04 03:52:06,475 INFO L134 LiptonReduction]: Checked pairs total: 17496 [2023-08-04 03:52:06,475 INFO L136 LiptonReduction]: Total number of compositions: 162 [2023-08-04 03:52:06,477 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 03:52:06,477 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;@44d3beeb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:52:06,478 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 03:52:06,480 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:52:06,480 INFO L124 PetriNetUnfolderBase]: 7/31 cut-off events. [2023-08-04 03:52:06,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:52:06,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:06,483 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-04 03:52:06,483 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:52:06,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:06,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1690553009, now seen corresponding path program 1 times [2023-08-04 03:52:06,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:06,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726110463] [2023-08-04 03:52:06,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:06,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:52:06,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:06,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726110463] [2023-08-04 03:52:06,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726110463] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:52:06,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:52:06,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:52:06,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739691818] [2023-08-04 03:52:06,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:52:06,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:52:06,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:06,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:52:06,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:52:06,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 355 [2023-08-04 03:52:06,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:06,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:06,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 355 [2023-08-04 03:52:06,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:06,619 INFO L124 PetriNetUnfolderBase]: 272/614 cut-off events. [2023-08-04 03:52:06,619 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:52:06,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 614 events. 272/614 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3050 event pairs, 238 based on Foata normal form. 118/640 useless extension candidates. Maximal degree in co-relation 1094. Up to 528 conditions per place. [2023-08-04 03:52:06,621 INFO L140 encePairwiseOnDemand]: 330/355 looper letters, 20 selfloop transitions, 2 changer transitions 18/45 dead transitions. [2023-08-04 03:52:06,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 167 flow [2023-08-04 03:52:06,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:52:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:52:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2023-08-04 03:52:06,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5004694835680751 [2023-08-04 03:52:06,623 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 533 transitions. [2023-08-04 03:52:06,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 533 transitions. [2023-08-04 03:52:06,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:06,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 533 transitions. [2023-08-04 03:52:06,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:06,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:06,627 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:06,627 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 533 transitions. [2023-08-04 03:52:06,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 167 flow [2023-08-04 03:52:06,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 167 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:52:06,628 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 69 flow [2023-08-04 03:52:06,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2023-08-04 03:52:06,630 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-08-04 03:52:06,630 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 69 flow [2023-08-04 03:52:06,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:06,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:06,630 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:06,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 03:52:06,630 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:52:06,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:06,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1112596279, now seen corresponding path program 1 times [2023-08-04 03:52:06,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:06,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90695832] [2023-08-04 03:52:06,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:06,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:52:06,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:06,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90695832] [2023-08-04 03:52:06,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90695832] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:06,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261017027] [2023-08-04 03:52:06,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:06,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:06,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:06,672 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:52:06,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 03:52:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:06,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:52:06,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:52:06,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:52:06,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261017027] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:06,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:06,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 03:52:06,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279743100] [2023-08-04 03:52:06,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:06,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 03:52:06,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:06,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 03:52:06,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 03:52:06,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 355 [2023-08-04 03:52:06,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 27 transitions, 69 flow. Second operand has 7 states, 7 states have (on average 158.57142857142858) internal successors, (1110), 7 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:06,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:06,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 355 [2023-08-04 03:52:06,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:06,867 INFO L124 PetriNetUnfolderBase]: 47/129 cut-off events. [2023-08-04 03:52:06,867 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:52:06,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 129 events. 47/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 381 event pairs, 42 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 245. Up to 108 conditions per place. [2023-08-04 03:52:06,868 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 20 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-08-04 03:52:06,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 131 flow [2023-08-04 03:52:06,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:52:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:52:06,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 970 transitions. [2023-08-04 03:52:06,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45539906103286387 [2023-08-04 03:52:06,871 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 970 transitions. [2023-08-04 03:52:06,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 970 transitions. [2023-08-04 03:52:06,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:06,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 970 transitions. [2023-08-04 03:52:06,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.66666666666666) internal successors, (970), 6 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:06,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 355.0) internal successors, (2485), 7 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:06,876 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 355.0) internal successors, (2485), 7 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:06,877 INFO L175 Difference]: Start difference. First operand has 47 places, 27 transitions, 69 flow. Second operand 6 states and 970 transitions. [2023-08-04 03:52:06,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 131 flow [2023-08-04 03:52:06,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 127 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:52:06,879 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2023-08-04 03:52:06,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-08-04 03:52:06,880 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-08-04 03:52:06,880 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2023-08-04 03:52:06,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 158.57142857142858) internal successors, (1110), 7 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:06,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:06,881 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-04 03:52:06,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 03:52:07,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:07,087 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:52:07,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:07,088 INFO L85 PathProgramCache]: Analyzing trace with hash -374883279, now seen corresponding path program 2 times [2023-08-04 03:52:07,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:07,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196061196] [2023-08-04 03:52:07,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:07,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:52:07,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:07,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196061196] [2023-08-04 03:52:07,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196061196] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:07,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736888774] [2023-08-04 03:52:07,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:52:07,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:07,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:07,153 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:52:07,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 03:52:07,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:52:07,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:52:07,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:52:07,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:07,240 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:52:07,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:52:07,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736888774] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:07,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:07,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-04 03:52:07,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123982203] [2023-08-04 03:52:07,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:07,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-04 03:52:07,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:07,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-04 03:52:07,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-04 03:52:07,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 355 [2023-08-04 03:52:07,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 101 flow. Second operand has 13 states, 13 states have (on average 158.30769230769232) internal successors, (2058), 13 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:07,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:07,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 355 [2023-08-04 03:52:07,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:07,366 INFO L124 PetriNetUnfolderBase]: 47/135 cut-off events. [2023-08-04 03:52:07,367 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-04 03:52:07,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 135 events. 47/135 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 381 event pairs, 42 based on Foata normal form. 6/117 useless extension candidates. Maximal degree in co-relation 236. Up to 108 conditions per place. [2023-08-04 03:52:07,367 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 20 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2023-08-04 03:52:07,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 199 flow [2023-08-04 03:52:07,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 03:52:07,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 03:52:07,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1921 transitions. [2023-08-04 03:52:07,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4509389671361502 [2023-08-04 03:52:07,373 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1921 transitions. [2023-08-04 03:52:07,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1921 transitions. [2023-08-04 03:52:07,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:07,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1921 transitions. [2023-08-04 03:52:07,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 160.08333333333334) internal successors, (1921), 12 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:07,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 355.0) internal successors, (4615), 13 states have internal predecessors, (4615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:07,385 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 355.0) internal successors, (4615), 13 states have internal predecessors, (4615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:07,385 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 12 states and 1921 transitions. [2023-08-04 03:52:07,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 199 flow [2023-08-04 03:52:07,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 185 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 03:52:07,388 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 171 flow [2023-08-04 03:52:07,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=171, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2023-08-04 03:52:07,390 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-08-04 03:52:07,390 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 171 flow [2023-08-04 03:52:07,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 158.30769230769232) internal successors, (2058), 13 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:07,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:07,391 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-04 03:52:07,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 03:52:07,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:07,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:52:07,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:07,597 INFO L85 PathProgramCache]: Analyzing trace with hash 832355953, now seen corresponding path program 3 times [2023-08-04 03:52:07,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:07,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863036590] [2023-08-04 03:52:07,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:07,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:52:07,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 03:52:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:52:07,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 03:52:07,659 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 03:52:07,659 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-04 03:52:07,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 03:52:07,660 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-04 03:52:07,660 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-04 03:52:07,661 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 03:52:07,661 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 03:52:07,696 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-04 03:52:07,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 266 transitions, 550 flow [2023-08-04 03:52:07,734 INFO L124 PetriNetUnfolderBase]: 75/430 cut-off events. [2023-08-04 03:52:07,735 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-04 03:52:07,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 430 events. 75/430 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1680 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 265. Up to 12 conditions per place. [2023-08-04 03:52:07,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 266 transitions, 550 flow [2023-08-04 03:52:07,741 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 266 transitions, 550 flow [2023-08-04 03:52:07,741 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:52:07,741 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 266 transitions, 550 flow [2023-08-04 03:52:07,742 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 266 transitions, 550 flow [2023-08-04 03:52:07,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 266 transitions, 550 flow [2023-08-04 03:52:07,779 INFO L124 PetriNetUnfolderBase]: 75/430 cut-off events. [2023-08-04 03:52:07,779 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-04 03:52:07,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 430 events. 75/430 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1680 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 265. Up to 12 conditions per place. [2023-08-04 03:52:07,798 INFO L119 LiptonReduction]: Number of co-enabled transitions 33228 [2023-08-04 03:52:10,870 INFO L134 LiptonReduction]: Checked pairs total: 57444 [2023-08-04 03:52:10,870 INFO L136 LiptonReduction]: Total number of compositions: 223 [2023-08-04 03:52:10,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 03:52:10,872 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;@44d3beeb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:52:10,872 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 03:52:10,874 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:52:10,875 INFO L124 PetriNetUnfolderBase]: 7/25 cut-off events. [2023-08-04 03:52:10,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:52:10,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:10,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 03:52:10,875 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:52:10,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:10,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1267872476, now seen corresponding path program 1 times [2023-08-04 03:52:10,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:10,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796238206] [2023-08-04 03:52:10,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:10,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:52:10,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:10,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796238206] [2023-08-04 03:52:10,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796238206] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:52:10,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:52:10,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:52:10,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649419504] [2023-08-04 03:52:10,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:52:10,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:52:10,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:10,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:52:10,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:52:10,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 489 [2023-08-04 03:52:10,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 100 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:10,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:10,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 489 [2023-08-04 03:52:10,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:12,097 INFO L124 PetriNetUnfolderBase]: 10521/16515 cut-off events. [2023-08-04 03:52:12,098 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-08-04 03:52:12,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32050 conditions, 16515 events. 10521/16515 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 109597 event pairs, 9818 based on Foata normal form. 2499/16448 useless extension candidates. Maximal degree in co-relation 13969. Up to 15431 conditions per place. [2023-08-04 03:52:12,172 INFO L140 encePairwiseOnDemand]: 455/489 looper letters, 56 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-04 03:52:12,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 274 flow [2023-08-04 03:52:12,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:52:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:52:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 738 transitions. [2023-08-04 03:52:12,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030674846625767 [2023-08-04 03:52:12,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 738 transitions. [2023-08-04 03:52:12,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 738 transitions. [2023-08-04 03:52:12,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:12,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 738 transitions. [2023-08-04 03:52:12,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:12,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:12,180 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:12,180 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 218 flow. Second operand 3 states and 738 transitions. [2023-08-04 03:52:12,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 274 flow [2023-08-04 03:52:12,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 274 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:52:12,184 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-08-04 03:52:12,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2023-08-04 03:52:12,185 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-04 03:52:12,185 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-08-04 03:52:12,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:12,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:12,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:12,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 03:52:12,186 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:52:12,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:12,186 INFO L85 PathProgramCache]: Analyzing trace with hash 339768936, now seen corresponding path program 1 times [2023-08-04 03:52:12,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:12,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182187136] [2023-08-04 03:52:12,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:12,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:52:12,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:12,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182187136] [2023-08-04 03:52:12,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182187136] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:12,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538285856] [2023-08-04 03:52:12,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:12,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:12,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:12,221 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:52:12,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-04 03:52:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:12,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 03:52:12,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:52:12,305 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:52:12,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538285856] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:52:12,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:52:12,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 03:52:12,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880432972] [2023-08-04 03:52:12,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:52:12,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:52:12,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:12,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:52:12,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:52:12,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 489 [2023-08-04 03:52:12,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:12,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:12,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 489 [2023-08-04 03:52:12,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:13,411 INFO L124 PetriNetUnfolderBase]: 10399/16491 cut-off events. [2023-08-04 03:52:13,411 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2023-08-04 03:52:13,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32041 conditions, 16491 events. 10399/16491 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 111617 event pairs, 4650 based on Foata normal form. 0/13963 useless extension candidates. Maximal degree in co-relation 32028. Up to 15399 conditions per place. [2023-08-04 03:52:13,482 INFO L140 encePairwiseOnDemand]: 486/489 looper letters, 74 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-08-04 03:52:13,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 356 flow [2023-08-04 03:52:13,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:52:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:52:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2023-08-04 03:52:13,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49352419904567146 [2023-08-04 03:52:13,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 724 transitions. [2023-08-04 03:52:13,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 724 transitions. [2023-08-04 03:52:13,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:13,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 724 transitions. [2023-08-04 03:52:13,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:13,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:13,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:13,490 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 168 flow. Second operand 3 states and 724 transitions. [2023-08-04 03:52:13,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 356 flow [2023-08-04 03:52:13,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 88 transitions, 352 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:52:13,493 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-08-04 03:52:13,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2023-08-04 03:52:13,493 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-04 03:52:13,493 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-08-04 03:52:13,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:13,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:13,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:13,502 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-04 03:52:13,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:13,699 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:52:13,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:13,700 INFO L85 PathProgramCache]: Analyzing trace with hash -953345288, now seen corresponding path program 1 times [2023-08-04 03:52:13,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:13,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467566797] [2023-08-04 03:52:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:13,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:52:13,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:13,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467566797] [2023-08-04 03:52:13,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467566797] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:13,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365948988] [2023-08-04 03:52:13,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:13,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:13,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:13,738 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:52:13,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 03:52:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:13,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:52:13,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:52:13,831 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:52:13,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365948988] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:13,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:13,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 03:52:13,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044615020] [2023-08-04 03:52:13,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:13,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 03:52:13,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:13,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 03:52:13,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 03:52:13,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 489 [2023-08-04 03:52:13,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:13,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:13,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 489 [2023-08-04 03:52:13,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:14,846 INFO L124 PetriNetUnfolderBase]: 10623/16504 cut-off events. [2023-08-04 03:52:14,846 INFO L125 PetriNetUnfolderBase]: For 685/685 co-relation queries the response was YES. [2023-08-04 03:52:14,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32633 conditions, 16504 events. 10623/16504 cut-off events. For 685/685 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 108095 event pairs, 9818 based on Foata normal form. 3/14244 useless extension candidates. Maximal degree in co-relation 32605. Up to 15417 conditions per place. [2023-08-04 03:52:14,904 INFO L140 encePairwiseOnDemand]: 486/489 looper letters, 57 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-04 03:52:14,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 312 flow [2023-08-04 03:52:14,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:52:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:52:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1354 transitions. [2023-08-04 03:52:14,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4614860259032038 [2023-08-04 03:52:14,908 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1354 transitions. [2023-08-04 03:52:14,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1354 transitions. [2023-08-04 03:52:14,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:14,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1354 transitions. [2023-08-04 03:52:14,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:14,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:14,929 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:14,929 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 176 flow. Second operand 6 states and 1354 transitions. [2023-08-04 03:52:14,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 312 flow [2023-08-04 03:52:14,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:52:14,932 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-08-04 03:52:14,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2023-08-04 03:52:14,933 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-08-04 03:52:14,933 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-08-04 03:52:14,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:14,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:14,935 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:14,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 03:52:15,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-04 03:52:15,141 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:52:15,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1739017580, now seen corresponding path program 2 times [2023-08-04 03:52:15,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:15,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538910053] [2023-08-04 03:52:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:15,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:52:15,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:15,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538910053] [2023-08-04 03:52:15,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538910053] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:15,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042182863] [2023-08-04 03:52:15,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:52:15,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:15,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:15,224 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:52:15,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-04 03:52:15,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-04 03:52:15,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:52:15,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-04 03:52:15,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:15,317 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:52:15,358 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:52:15,359 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:52:15,378 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:52:15,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 03:52:15,421 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:52:15,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042182863] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:52:15,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:52:15,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-04 03:52:15,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381663530] [2023-08-04 03:52:15,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:52:15,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 03:52:15,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:15,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 03:52:15,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-04 03:52:15,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 489 [2023-08-04 03:52:15,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 207.5) internal successors, (1245), 6 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:15,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:15,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 489 [2023-08-04 03:52:15,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:16,732 INFO L124 PetriNetUnfolderBase]: 11006/17360 cut-off events. [2023-08-04 03:52:16,732 INFO L125 PetriNetUnfolderBase]: For 706/706 co-relation queries the response was YES. [2023-08-04 03:52:16,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34683 conditions, 17360 events. 11006/17360 cut-off events. For 706/706 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 118582 event pairs, 2714 based on Foata normal form. 0/15185 useless extension candidates. Maximal degree in co-relation 34647. Up to 12981 conditions per place. [2023-08-04 03:52:16,793 INFO L140 encePairwiseOnDemand]: 480/489 looper letters, 132 selfloop transitions, 14 changer transitions 9/167 dead transitions. [2023-08-04 03:52:16,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 167 transitions, 737 flow [2023-08-04 03:52:16,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:52:16,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:52:16,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1388 transitions. [2023-08-04 03:52:16,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730743012951602 [2023-08-04 03:52:16,796 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1388 transitions. [2023-08-04 03:52:16,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1388 transitions. [2023-08-04 03:52:16,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:16,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1388 transitions. [2023-08-04 03:52:16,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:16,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:16,803 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:16,803 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 210 flow. Second operand 6 states and 1388 transitions. [2023-08-04 03:52:16,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 167 transitions, 737 flow [2023-08-04 03:52:16,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 167 transitions, 723 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 03:52:16,806 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 280 flow [2023-08-04 03:52:16,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=280, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2023-08-04 03:52:16,807 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2023-08-04 03:52:16,807 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 280 flow [2023-08-04 03:52:16,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 207.5) internal successors, (1245), 6 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:16,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:16,807 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:16,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 03:52:17,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 03:52:17,017 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-04 03:52:17,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:17,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1147901150, now seen corresponding path program 1 times [2023-08-04 03:52:17,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:17,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407772416] [2023-08-04 03:52:17,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:17,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:52:17,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:17,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407772416] [2023-08-04 03:52:17,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407772416] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:17,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465350257] [2023-08-04 03:52:17,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:17,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:17,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:17,083 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:52:17,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-04 03:52:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:17,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:52:17,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:52:17,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:52:17,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465350257] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:17,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:17,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-04 03:52:17,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052006104] [2023-08-04 03:52:17,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:17,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-04 03:52:17,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:17,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-04 03:52:17,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-04 03:52:17,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 489 [2023-08-04 03:52:17,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 280 flow. Second operand has 13 states, 13 states have (on average 216.6153846153846) internal successors, (2816), 13 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:17,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:17,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 489 [2023-08-04 03:52:17,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:18,361 INFO L124 PetriNetUnfolderBase]: 11004/17512 cut-off events. [2023-08-04 03:52:18,361 INFO L125 PetriNetUnfolderBase]: For 3607/3607 co-relation queries the response was YES. [2023-08-04 03:52:18,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38053 conditions, 17512 events. 11004/17512 cut-off events. For 3607/3607 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 120725 event pairs, 9683 based on Foata normal form. 6/16099 useless extension candidates. Maximal degree in co-relation 37995. Up to 16586 conditions per place. [2023-08-04 03:52:18,436 INFO L140 encePairwiseOnDemand]: 486/489 looper letters, 69 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2023-08-04 03:52:18,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 476 flow [2023-08-04 03:52:18,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 03:52:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 03:52:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2653 transitions. [2023-08-04 03:52:18,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45211315610088615 [2023-08-04 03:52:18,442 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2653 transitions. [2023-08-04 03:52:18,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2653 transitions. [2023-08-04 03:52:18,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:18,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2653 transitions. [2023-08-04 03:52:18,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 221.08333333333334) internal successors, (2653), 12 states have internal predecessors, (2653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:18,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 489.0) internal successors, (6357), 13 states have internal predecessors, (6357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:18,454 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 489.0) internal successors, (6357), 13 states have internal predecessors, (6357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:18,454 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 280 flow. Second operand 12 states and 2653 transitions. [2023-08-04 03:52:18,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 476 flow [2023-08-04 03:52:18,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 476 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:52:18,462 INFO L231 Difference]: Finished difference. Result has 104 places, 92 transitions, 364 flow [2023-08-04 03:52:18,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=364, PETRI_PLACES=104, PETRI_TRANSITIONS=92} [2023-08-04 03:52:18,463 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 36 predicate places. [2023-08-04 03:52:18,463 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 364 flow [2023-08-04 03:52:18,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 216.6153846153846) internal successors, (2816), 13 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:18,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:18,464 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:18,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-04 03:52:18,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-04 03:52:18,673 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:52:18,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:18,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2099969954, now seen corresponding path program 2 times [2023-08-04 03:52:18,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:18,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373230715] [2023-08-04 03:52:18,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:18,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:19,054 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:52:19,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:19,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373230715] [2023-08-04 03:52:19,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373230715] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:19,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960635553] [2023-08-04 03:52:19,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:52:19,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:19,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:19,057 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:52:19,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-04 03:52:19,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:52:19,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:52:19,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-04 03:52:19,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:19,182 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:52:19,241 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:52:19,242 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:52:19,252 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:52:19,274 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:52:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:52:19,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:25,373 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_397 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_397) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-04 03:52:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-04 03:52:25,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960635553] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:25,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:25,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2023-08-04 03:52:25,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588292009] [2023-08-04 03:52:25,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:25,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-04 03:52:25,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:25,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-04 03:52:25,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=63, Unknown=3, NotChecked=16, Total=110 [2023-08-04 03:52:25,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 489 [2023-08-04 03:52:25,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 364 flow. Second operand has 11 states, 11 states have (on average 180.27272727272728) internal successors, (1983), 11 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:25,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:25,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 489 [2023-08-04 03:52:25,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:37,556 WARN L233 SmtUtils]: Spent 12.02s on a formula simplification. DAG size of input: 23 DAG size of output: 18 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 03:52:39,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:41,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:43,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:45,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:47,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:49,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:51,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:53,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:55,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:52:57,180 INFO L124 PetriNetUnfolderBase]: 11333/18100 cut-off events. [2023-08-04 03:52:57,180 INFO L125 PetriNetUnfolderBase]: For 3670/3670 co-relation queries the response was YES. [2023-08-04 03:52:57,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39173 conditions, 18100 events. 11333/18100 cut-off events. For 3670/3670 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 125239 event pairs, 2397 based on Foata normal form. 0/16834 useless extension candidates. Maximal degree in co-relation 39090. Up to 13483 conditions per place. [2023-08-04 03:52:57,244 INFO L140 encePairwiseOnDemand]: 478/489 looper letters, 134 selfloop transitions, 23 changer transitions 14/182 dead transitions. [2023-08-04 03:52:57,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 182 transitions, 949 flow [2023-08-04 03:52:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 03:52:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 03:52:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1401 transitions. [2023-08-04 03:52:57,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092900964066608 [2023-08-04 03:52:57,248 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1401 transitions. [2023-08-04 03:52:57,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1401 transitions. [2023-08-04 03:52:57,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:57,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1401 transitions. [2023-08-04 03:52:57,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 200.14285714285714) internal successors, (1401), 7 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:57,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 489.0) internal successors, (3912), 8 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:57,256 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 489.0) internal successors, (3912), 8 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:57,256 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 364 flow. Second operand 7 states and 1401 transitions. [2023-08-04 03:52:57,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 182 transitions, 949 flow [2023-08-04 03:52:57,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 182 transitions, 901 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-04 03:52:57,270 INFO L231 Difference]: Finished difference. Result has 108 places, 103 transitions, 444 flow [2023-08-04 03:52:57,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=444, PETRI_PLACES=108, PETRI_TRANSITIONS=103} [2023-08-04 03:52:57,271 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 40 predicate places. [2023-08-04 03:52:57,271 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 103 transitions, 444 flow [2023-08-04 03:52:57,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 180.27272727272728) internal successors, (1983), 11 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:57,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:57,272 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:57,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 03:52:57,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-04 03:52:57,477 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:52:57,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:57,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1195896970, now seen corresponding path program 1 times [2023-08-04 03:52:57,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:57,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076961780] [2023-08-04 03:52:57,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:57,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-04 03:52:57,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:57,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076961780] [2023-08-04 03:52:57,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076961780] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:57,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027993906] [2023-08-04 03:52:57,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:57,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:57,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:57,588 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:52:57,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-04 03:52:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:57,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:52:57,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-04 03:52:57,720 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-04 03:52:57,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027993906] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:57,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:57,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 03:52:57,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927881719] [2023-08-04 03:52:57,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:57,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:52:57,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:57,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:52:57,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:52:57,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 489 [2023-08-04 03:52:57,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 103 transitions, 444 flow. Second operand has 5 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:57,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:57,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 489 [2023-08-04 03:52:57,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:59,076 INFO L124 PetriNetUnfolderBase]: 10524/17220 cut-off events. [2023-08-04 03:52:59,076 INFO L125 PetriNetUnfolderBase]: For 5700/5700 co-relation queries the response was YES. [2023-08-04 03:52:59,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39016 conditions, 17220 events. 10524/17220 cut-off events. For 5700/5700 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 122820 event pairs, 614 based on Foata normal form. 17/16280 useless extension candidates. Maximal degree in co-relation 38953. Up to 14547 conditions per place. [2023-08-04 03:52:59,143 INFO L140 encePairwiseOnDemand]: 485/489 looper letters, 140 selfloop transitions, 4 changer transitions 0/156 dead transitions. [2023-08-04 03:52:59,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 156 transitions, 893 flow [2023-08-04 03:52:59,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:52:59,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:52:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 967 transitions. [2023-08-04 03:52:59,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943762781186094 [2023-08-04 03:52:59,146 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 967 transitions. [2023-08-04 03:52:59,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 967 transitions. [2023-08-04 03:52:59,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:59,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 967 transitions. [2023-08-04 03:52:59,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 241.75) internal successors, (967), 4 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:59,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 489.0) internal successors, (2445), 5 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:59,151 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 489.0) internal successors, (2445), 5 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:59,151 INFO L175 Difference]: Start difference. First operand has 108 places, 103 transitions, 444 flow. Second operand 4 states and 967 transitions. [2023-08-04 03:52:59,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 156 transitions, 893 flow [2023-08-04 03:52:59,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 156 transitions, 893 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:52:59,167 INFO L231 Difference]: Finished difference. Result has 113 places, 103 transitions, 457 flow [2023-08-04 03:52:59,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=457, PETRI_PLACES=113, PETRI_TRANSITIONS=103} [2023-08-04 03:52:59,168 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 45 predicate places. [2023-08-04 03:52:59,168 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 103 transitions, 457 flow [2023-08-04 03:52:59,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:59,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:59,169 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:59,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-04 03:52:59,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-04 03:52:59,374 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:52:59,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:59,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1127407452, now seen corresponding path program 1 times [2023-08-04 03:52:59,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:59,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2275179] [2023-08-04 03:52:59,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:59,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-04 03:52:59,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:59,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2275179] [2023-08-04 03:52:59,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2275179] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:52:59,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:52:59,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 03:52:59,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255383142] [2023-08-04 03:52:59,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:52:59,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:52:59,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:59,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:52:59,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:52:59,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 489 [2023-08-04 03:52:59,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 103 transitions, 457 flow. Second operand has 5 states, 5 states have (on average 200.4) internal successors, (1002), 5 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:59,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:59,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 489 [2023-08-04 03:52:59,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:53:00,685 INFO L124 PetriNetUnfolderBase]: 5594/10272 cut-off events. [2023-08-04 03:53:00,686 INFO L125 PetriNetUnfolderBase]: For 7424/7424 co-relation queries the response was YES. [2023-08-04 03:53:00,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25559 conditions, 10272 events. 5594/10272 cut-off events. For 7424/7424 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 76139 event pairs, 2022 based on Foata normal form. 1470/10844 useless extension candidates. Maximal degree in co-relation 25494. Up to 5392 conditions per place. [2023-08-04 03:53:00,727 INFO L140 encePairwiseOnDemand]: 468/489 looper letters, 132 selfloop transitions, 21 changer transitions 2/165 dead transitions. [2023-08-04 03:53:00,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 165 transitions, 1028 flow [2023-08-04 03:53:00,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:53:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:53:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 902 transitions. [2023-08-04 03:53:00,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4611451942740286 [2023-08-04 03:53:00,729 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 902 transitions. [2023-08-04 03:53:00,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 902 transitions. [2023-08-04 03:53:00,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:53:00,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 902 transitions. [2023-08-04 03:53:00,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 225.5) internal successors, (902), 4 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:53:00,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 489.0) internal successors, (2445), 5 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:53:00,733 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 489.0) internal successors, (2445), 5 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:53:00,733 INFO L175 Difference]: Start difference. First operand has 113 places, 103 transitions, 457 flow. Second operand 4 states and 902 transitions. [2023-08-04 03:53:00,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 165 transitions, 1028 flow [2023-08-04 03:53:00,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 165 transitions, 1021 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-04 03:53:00,747 INFO L231 Difference]: Finished difference. Result has 116 places, 114 transitions, 559 flow [2023-08-04 03:53:00,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=559, PETRI_PLACES=116, PETRI_TRANSITIONS=114} [2023-08-04 03:53:00,748 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 48 predicate places. [2023-08-04 03:53:00,748 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 114 transitions, 559 flow [2023-08-04 03:53:00,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 200.4) internal successors, (1002), 5 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:53:00,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:53:00,748 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:53:00,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-04 03:53:00,749 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:53:00,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:53:00,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1642131920, now seen corresponding path program 1 times [2023-08-04 03:53:00,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:53:00,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564772904] [2023-08-04 03:53:00,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:53:00,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:53:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:53:01,092 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:53:01,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:53:01,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564772904] [2023-08-04 03:53:01,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564772904] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:53:01,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211710596] [2023-08-04 03:53:01,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:53:01,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:53:01,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:53:01,094 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:53:01,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-04 03:53:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:53:01,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-04 03:53:01,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:53:01,231 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:53:01,285 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:53:01,285 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:53:01,300 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:53:01,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-04 03:53:01,341 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-04 03:53:01,419 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:53:01,419 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 03:53:01,454 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-04 03:53:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:53:01,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:53:01,567 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-04 03:53:01,572 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-04 03:53:13,631 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_67| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_61| Int) (v_ArrVal_585 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_585) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_61| v_ArrVal_588) |v_t_funThread2of2ForFork0_~p~0#1.offset_67|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_61| |v_t_funThread2of2ForFork0_~p~0#1.offset_67|))) is different from false [2023-08-04 03:53:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-04 03:53:13,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211710596] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:53:13,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:53:13,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-08-04 03:53:13,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828454677] [2023-08-04 03:53:13,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:53:13,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-04 03:53:13,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:53:13,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-04 03:53:13,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=209, Unknown=5, NotChecked=30, Total=306 [2023-08-04 03:53:15,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:17,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:19,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:21,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:23,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:25,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:27,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:29,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:31,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:33,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:35,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:37,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:39,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:41,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:43,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-04 03:53:45,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:47,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:49,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:51,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:53,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:55,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:57,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:53:59,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-04 03:54:01,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:03,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:05,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:07,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:09,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:11,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:13,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:15,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:17,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:19,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:21,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:24,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:26,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:28,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:30,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:32,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:34,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:36,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:38,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:40,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:42,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:44,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:46,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:48,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:50,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:52,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:54,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:56,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:54:58,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:00,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:02,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:04,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:06,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:08,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:10,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:12,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:14,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:16,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:18,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:55:18,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 489 [2023-08-04 03:55:18,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 114 transitions, 559 flow. Second operand has 18 states, 18 states have (on average 160.66666666666666) internal successors, (2892), 18 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:55:18,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:55:18,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 489 [2023-08-04 03:55:18,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:55:20,700 INFO L124 PetriNetUnfolderBase]: 10043/18258 cut-off events. [2023-08-04 03:55:20,701 INFO L125 PetriNetUnfolderBase]: For 15749/15781 co-relation queries the response was YES. [2023-08-04 03:55:20,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53146 conditions, 18258 events. 10043/18258 cut-off events. For 15749/15781 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 147649 event pairs, 2085 based on Foata normal form. 106/16656 useless extension candidates. Maximal degree in co-relation 53078. Up to 7578 conditions per place. [2023-08-04 03:55:20,785 INFO L140 encePairwiseOnDemand]: 472/489 looper letters, 366 selfloop transitions, 84 changer transitions 94/553 dead transitions. [2023-08-04 03:55:20,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 553 transitions, 3405 flow [2023-08-04 03:55:20,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-04 03:55:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-04 03:55:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3634 transitions. [2023-08-04 03:55:20,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37157464212678937 [2023-08-04 03:55:20,791 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3634 transitions. [2023-08-04 03:55:20,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3634 transitions. [2023-08-04 03:55:20,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:55:20,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3634 transitions. [2023-08-04 03:55:20,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 181.7) internal successors, (3634), 20 states have internal predecessors, (3634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:55:20,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 489.0) internal successors, (10269), 21 states have internal predecessors, (10269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:55:20,807 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 489.0) internal successors, (10269), 21 states have internal predecessors, (10269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:55:20,807 INFO L175 Difference]: Start difference. First operand has 116 places, 114 transitions, 559 flow. Second operand 20 states and 3634 transitions. [2023-08-04 03:55:20,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 553 transitions, 3405 flow [2023-08-04 03:55:21,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 553 transitions, 3404 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:55:21,005 INFO L231 Difference]: Finished difference. Result has 145 places, 175 transitions, 1228 flow [2023-08-04 03:55:21,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1228, PETRI_PLACES=145, PETRI_TRANSITIONS=175} [2023-08-04 03:55:21,006 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 77 predicate places. [2023-08-04 03:55:21,006 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 175 transitions, 1228 flow [2023-08-04 03:55:21,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 160.66666666666666) internal successors, (2892), 18 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:55:21,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:55:21,007 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:55:21,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-04 03:55:21,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-04 03:55:21,213 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:55:21,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:55:21,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1779264770, now seen corresponding path program 2 times [2023-08-04 03:55:21,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:55:21,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104017989] [2023-08-04 03:55:21,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:55:21,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:55:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:55:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:55:21,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:55:21,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104017989] [2023-08-04 03:55:21,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104017989] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:55:21,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003578365] [2023-08-04 03:55:21,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:55:21,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:55:21,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:55:21,720 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:55:21,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-04 03:55:21,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:55:21,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:55:21,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-04 03:55:21,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:55:21,871 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:55:21,980 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:55:21,981 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:55:22,002 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:55:22,034 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:55:22,057 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-04 03:55:22,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:55:22,103 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 03:55:22,133 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-04 03:55:22,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:55:22,160 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 03:55:22,192 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:55:22,193 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 03:55:22,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-04 03:55:22,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:55:22,257 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_676 (Array Int Int))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_676) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_69|)) 0)))) is different from false [2023-08-04 03:55:22,322 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:55:22,323 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-04 03:55:22,330 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:55:22,331 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-04 03:55:22,335 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-04 03:55:46,459 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_674 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_63| Int) (v_ArrVal_670 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_63| |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_670) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_63| v_ArrVal_674) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-04 03:55:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-04 03:55:48,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003578365] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:55:48,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:55:48,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-08-04 03:55:48,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997099876] [2023-08-04 03:55:48,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:55:48,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-04 03:55:48,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:55:48,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-04 03:55:48,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=276, Unknown=10, NotChecked=74, Total=462 [2023-08-04 03:55:48,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 489 [2023-08-04 03:55:48,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 175 transitions, 1228 flow. Second operand has 22 states, 22 states have (on average 159.3181818181818) internal successors, (3505), 22 states have internal predecessors, (3505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:55:48,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:55:48,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 489 [2023-08-04 03:55:48,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:55:50,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:52,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:55,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:55:57,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:56:01,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 03:56:03,180 INFO L124 PetriNetUnfolderBase]: 12545/22824 cut-off events. [2023-08-04 03:56:03,180 INFO L125 PetriNetUnfolderBase]: For 65838/65870 co-relation queries the response was YES. [2023-08-04 03:56:03,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82545 conditions, 22824 events. 12545/22824 cut-off events. For 65838/65870 co-relation queries the response was YES. Maximal size of possible extension queue 894. Compared 192564 event pairs, 1648 based on Foata normal form. 59/20785 useless extension candidates. Maximal degree in co-relation 82465. Up to 10444 conditions per place. [2023-08-04 03:56:03,315 INFO L140 encePairwiseOnDemand]: 467/489 looper letters, 347 selfloop transitions, 147 changer transitions 143/646 dead transitions. [2023-08-04 03:56:03,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 646 transitions, 5154 flow [2023-08-04 03:56:03,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-04 03:56:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-04 03:56:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3943 transitions. [2023-08-04 03:56:03,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36651794013757205 [2023-08-04 03:56:03,319 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3943 transitions. [2023-08-04 03:56:03,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3943 transitions. [2023-08-04 03:56:03,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:56:03,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3943 transitions. [2023-08-04 03:56:03,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 179.22727272727272) internal successors, (3943), 22 states have internal predecessors, (3943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:03,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 489.0) internal successors, (11247), 23 states have internal predecessors, (11247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:03,334 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 489.0) internal successors, (11247), 23 states have internal predecessors, (11247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:03,334 INFO L175 Difference]: Start difference. First operand has 145 places, 175 transitions, 1228 flow. Second operand 22 states and 3943 transitions. [2023-08-04 03:56:03,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 646 transitions, 5154 flow [2023-08-04 03:56:03,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 646 transitions, 5076 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 03:56:03,701 INFO L231 Difference]: Finished difference. Result has 172 places, 262 transitions, 2383 flow [2023-08-04 03:56:03,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2383, PETRI_PLACES=172, PETRI_TRANSITIONS=262} [2023-08-04 03:56:03,701 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 104 predicate places. [2023-08-04 03:56:03,702 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 262 transitions, 2383 flow [2023-08-04 03:56:03,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 159.3181818181818) internal successors, (3505), 22 states have internal predecessors, (3505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:03,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:56:03,702 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:56:03,716 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-04 03:56:03,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:56:03,908 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:56:03,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:56:03,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1575418841, now seen corresponding path program 1 times [2023-08-04 03:56:03,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:56:03,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140135629] [2023-08-04 03:56:03,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:56:03,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:56:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:56:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:56:04,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:56:04,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140135629] [2023-08-04 03:56:04,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140135629] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:56:04,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600599171] [2023-08-04 03:56:04,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:56:04,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:56:04,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:56:04,335 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:56:04,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-04 03:56:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:56:04,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-04 03:56:04,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:56:04,473 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:56:04,522 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:56:04,523 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:56:04,532 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:56:04,556 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:56:04,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 13 treesize of output 9 [2023-08-04 03:56:04,605 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:56:04,606 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 03:56:04,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-04 03:56:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:56:04,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:56:04,756 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-04 03:56:04,763 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-04 03:56:12,803 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_757 (Array Int Int)) (v_ArrVal_760 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_65| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_71| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_757) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_71| v_ArrVal_760) |v_t_funThread1of2ForFork0_~p~0#1.offset_65|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_65| |v_t_funThread2of2ForFork0_~p~0#1.offset_71|))) is different from false [2023-08-04 03:56:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-04 03:56:12,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600599171] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:56:12,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:56:12,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-08-04 03:56:12,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829542576] [2023-08-04 03:56:12,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:56:12,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-04 03:56:12,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:56:12,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-04 03:56:12,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=5, NotChecked=26, Total=240 [2023-08-04 03:56:13,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 489 [2023-08-04 03:56:13,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 262 transitions, 2383 flow. Second operand has 16 states, 16 states have (on average 160.75) internal successors, (2572), 16 states have internal predecessors, (2572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:13,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:56:13,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 489 [2023-08-04 03:56:13,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:56:18,898 INFO L124 PetriNetUnfolderBase]: 13476/24942 cut-off events. [2023-08-04 03:56:18,898 INFO L125 PetriNetUnfolderBase]: For 125059/125095 co-relation queries the response was YES. [2023-08-04 03:56:19,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101954 conditions, 24942 events. 13476/24942 cut-off events. For 125059/125095 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 217473 event pairs, 3494 based on Foata normal form. 55/22721 useless extension candidates. Maximal degree in co-relation 101864. Up to 14179 conditions per place. [2023-08-04 03:56:19,207 INFO L140 encePairwiseOnDemand]: 469/489 looper letters, 407 selfloop transitions, 93 changer transitions 93/602 dead transitions. [2023-08-04 03:56:19,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 602 transitions, 5538 flow [2023-08-04 03:56:19,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-04 03:56:19,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-04 03:56:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3101 transitions. [2023-08-04 03:56:19,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3730301936725611 [2023-08-04 03:56:19,211 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3101 transitions. [2023-08-04 03:56:19,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3101 transitions. [2023-08-04 03:56:19,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:56:19,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3101 transitions. [2023-08-04 03:56:19,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 182.41176470588235) internal successors, (3101), 17 states have internal predecessors, (3101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:19,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 489.0) internal successors, (8802), 18 states have internal predecessors, (8802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:19,222 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 489.0) internal successors, (8802), 18 states have internal predecessors, (8802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:19,222 INFO L175 Difference]: Start difference. First operand has 172 places, 262 transitions, 2383 flow. Second operand 17 states and 3101 transitions. [2023-08-04 03:56:19,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 602 transitions, 5538 flow [2023-08-04 03:56:19,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 602 transitions, 5355 flow, removed 57 selfloop flow, removed 5 redundant places. [2023-08-04 03:56:19,798 INFO L231 Difference]: Finished difference. Result has 188 places, 277 transitions, 2657 flow [2023-08-04 03:56:19,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=2203, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2657, PETRI_PLACES=188, PETRI_TRANSITIONS=277} [2023-08-04 03:56:19,799 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 120 predicate places. [2023-08-04 03:56:19,799 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 277 transitions, 2657 flow [2023-08-04 03:56:19,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 160.75) internal successors, (2572), 16 states have internal predecessors, (2572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:19,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:56:19,799 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:56:19,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-04 03:56:19,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:56:20,000 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:56:20,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:56:20,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1405618938, now seen corresponding path program 3 times [2023-08-04 03:56:20,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:56:20,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363435060] [2023-08-04 03:56:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:56:20,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:56:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:56:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:56:23,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:56:23,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363435060] [2023-08-04 03:56:23,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363435060] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:56:23,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106079158] [2023-08-04 03:56:23,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 03:56:23,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:56:23,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:56:23,593 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:56:23,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-04 03:56:23,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-04 03:56:23,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:56:23,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-04 03:56:23,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:56:23,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:56:23,823 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:56:23,823 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:56:23,850 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:56:23,872 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:56:23,899 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-04 03:56:23,942 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:56:23,942 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 03:56:24,001 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-04 03:56:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:56:24,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:56:24,165 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-04 03:56:24,169 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-04 03:56:38,247 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_67| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_846 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_67| |v_t_funThread2of2ForFork0_~p~0#1.offset_73|) (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_67| v_ArrVal_846) |v_t_funThread2of2ForFork0_~p~0#1.offset_73|)))) is different from false [2023-08-04 03:56:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-04 03:56:38,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106079158] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:56:38,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:56:38,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 27 [2023-08-04 03:56:38,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626012616] [2023-08-04 03:56:38,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:56:38,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-04 03:56:38,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:56:38,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-04 03:56:38,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=612, Unknown=2, NotChecked=52, Total=812 [2023-08-04 03:56:38,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 489 [2023-08-04 03:56:38,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 277 transitions, 2657 flow. Second operand has 29 states, 29 states have (on average 155.06896551724137) internal successors, (4497), 29 states have internal predecessors, (4497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:38,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:56:38,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 489 [2023-08-04 03:56:38,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:56:45,811 INFO L124 PetriNetUnfolderBase]: 15402/28626 cut-off events. [2023-08-04 03:56:45,811 INFO L125 PetriNetUnfolderBase]: For 183584/183648 co-relation queries the response was YES. [2023-08-04 03:56:46,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121067 conditions, 28626 events. 15402/28626 cut-off events. For 183584/183648 co-relation queries the response was YES. Maximal size of possible extension queue 1162. Compared 255866 event pairs, 3523 based on Foata normal form. 56/26073 useless extension candidates. Maximal degree in co-relation 120973. Up to 16867 conditions per place. [2023-08-04 03:56:46,075 INFO L140 encePairwiseOnDemand]: 471/489 looper letters, 378 selfloop transitions, 107 changer transitions 109/603 dead transitions. [2023-08-04 03:56:46,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 603 transitions, 6102 flow [2023-08-04 03:56:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-04 03:56:46,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-04 03:56:46,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4202 transitions. [2023-08-04 03:56:46,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34372188139059306 [2023-08-04 03:56:46,080 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4202 transitions. [2023-08-04 03:56:46,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4202 transitions. [2023-08-04 03:56:46,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:56:46,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4202 transitions. [2023-08-04 03:56:46,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 168.08) internal successors, (4202), 25 states have internal predecessors, (4202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:46,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 489.0) internal successors, (12714), 26 states have internal predecessors, (12714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:46,091 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 489.0) internal successors, (12714), 26 states have internal predecessors, (12714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:46,091 INFO L175 Difference]: Start difference. First operand has 188 places, 277 transitions, 2657 flow. Second operand 25 states and 4202 transitions. [2023-08-04 03:56:46,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 603 transitions, 6102 flow [2023-08-04 03:56:46,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 603 transitions, 5845 flow, removed 37 selfloop flow, removed 10 redundant places. [2023-08-04 03:56:46,752 INFO L231 Difference]: Finished difference. Result has 208 places, 304 transitions, 3134 flow [2023-08-04 03:56:46,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=2447, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3134, PETRI_PLACES=208, PETRI_TRANSITIONS=304} [2023-08-04 03:56:46,753 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 140 predicate places. [2023-08-04 03:56:46,753 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 304 transitions, 3134 flow [2023-08-04 03:56:46,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 155.06896551724137) internal successors, (4497), 29 states have internal predecessors, (4497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:56:46,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:56:46,754 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:56:46,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-04 03:56:46,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:56:46,955 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:56:46,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:56:46,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1313781145, now seen corresponding path program 2 times [2023-08-04 03:56:46,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:56:46,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659828248] [2023-08-04 03:56:46,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:56:46,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:56:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:56:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:56:47,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:56:47,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659828248] [2023-08-04 03:56:47,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659828248] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:56:47,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003499289] [2023-08-04 03:56:47,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:56:47,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:56:47,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:56:47,446 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:56:47,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-04 03:56:47,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:56:47,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:56:47,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-04 03:56:47,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:56:47,616 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:56:47,703 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:56:47,704 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:56:47,728 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:56:47,756 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:56:47,784 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-04 03:56:47,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:56:47,834 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 03:56:47,874 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:56:47,875 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 03:56:47,908 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-04 03:56:47,947 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:56:47,947 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:56:48,021 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_930 (Array Int Int)) (v_ArrVal_932 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_932)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_69|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_930) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_69| 4)) 0)))) is different from false [2023-08-04 03:56:48,042 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:56:48,042 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-04 03:56:48,050 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:56:48,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-04 03:56:48,055 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-04 03:57:08,185 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_69| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_932 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_69| |v_t_funThread2of2ForFork0_~p~0#1.offset_75|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_927) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_75| v_ArrVal_932) |v_t_funThread1of2ForFork0_~p~0#1.offset_69|) 0)))) is different from false [2023-08-04 03:57:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-04 03:57:10,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003499289] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:57:10,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:57:10,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2023-08-04 03:57:10,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467626666] [2023-08-04 03:57:10,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:57:10,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-04 03:57:10,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:57:10,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-04 03:57:10,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=274, Unknown=7, NotChecked=70, Total=420 [2023-08-04 03:57:10,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 489 [2023-08-04 03:57:10,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 304 transitions, 3134 flow. Second operand has 21 states, 21 states have (on average 159.42857142857142) internal successors, (3348), 21 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:57:10,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:57:10,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 489 [2023-08-04 03:57:10,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:57:16,950 INFO L124 PetriNetUnfolderBase]: 17729/33459 cut-off events. [2023-08-04 03:57:16,950 INFO L125 PetriNetUnfolderBase]: For 235895/236002 co-relation queries the response was YES. [2023-08-04 03:57:17,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144384 conditions, 33459 events. 17729/33459 cut-off events. For 235895/236002 co-relation queries the response was YES. Maximal size of possible extension queue 1391. Compared 312563 event pairs, 4227 based on Foata normal form. 106/30603 useless extension candidates. Maximal degree in co-relation 144273. Up to 17624 conditions per place. [2023-08-04 03:57:17,273 INFO L140 encePairwiseOnDemand]: 470/489 looper letters, 484 selfloop transitions, 143 changer transitions 134/770 dead transitions. [2023-08-04 03:57:17,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 770 transitions, 7999 flow [2023-08-04 03:57:17,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-04 03:57:17,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-04 03:57:17,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3812 transitions. [2023-08-04 03:57:17,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37121433440451845 [2023-08-04 03:57:17,279 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3812 transitions. [2023-08-04 03:57:17,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3812 transitions. [2023-08-04 03:57:17,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:57:17,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3812 transitions. [2023-08-04 03:57:17,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 181.52380952380952) internal successors, (3812), 21 states have internal predecessors, (3812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:57:17,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 489.0) internal successors, (10758), 22 states have internal predecessors, (10758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:57:17,293 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 489.0) internal successors, (10758), 22 states have internal predecessors, (10758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:57:17,293 INFO L175 Difference]: Start difference. First operand has 208 places, 304 transitions, 3134 flow. Second operand 21 states and 3812 transitions. [2023-08-04 03:57:17,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 770 transitions, 7999 flow [2023-08-04 03:57:18,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 770 transitions, 7718 flow, removed 63 selfloop flow, removed 24 redundant places. [2023-08-04 03:57:18,444 INFO L231 Difference]: Finished difference. Result has 211 places, 352 transitions, 4195 flow [2023-08-04 03:57:18,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=2913, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4195, PETRI_PLACES=211, PETRI_TRANSITIONS=352} [2023-08-04 03:57:18,445 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 143 predicate places. [2023-08-04 03:57:18,445 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 352 transitions, 4195 flow [2023-08-04 03:57:18,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 159.42857142857142) internal successors, (3348), 21 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:57:18,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:57:18,446 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:57:18,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-04 03:57:18,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:57:18,647 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-04 03:57:18,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:57:18,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1333605401, now seen corresponding path program 3 times [2023-08-04 03:57:18,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:57:18,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452200048] [2023-08-04 03:57:18,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:18,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:57:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:23,651 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:57:23,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:57:23,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452200048] [2023-08-04 03:57:23,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452200048] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:57:23,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675675995] [2023-08-04 03:57:23,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 03:57:23,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:57:23,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:57:23,653 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-04 03:57:23,673 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-04 03:57:23,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-04 03:57:23,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:57:23,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-04 03:57:23,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:57:23,808 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:57:23,951 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:57:23,951 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:57:23,984 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:57:24,004 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:57:24,043 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-04 03:57:24,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:57:24,099 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 03:57:24,115 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-04 03:57:24,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:57:24,166 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 03:57:24,219 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:57:24,220 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 03:57:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:57:24,265 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:57:24,315 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int)) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_71|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1019) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_71| 4)) 0)))) is different from false [2023-08-04 03:57:24,324 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int) (v_ArrVal_1018 Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1019) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_71| 4)) 0)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1018)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_71|) 0))) is different from false [2023-08-04 03:57:24,355 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:57:24,356 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-04 03:57:24,365 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:57:24,366 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-04 03:57:24,370 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-04 03:57:30,491 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1013 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int) (v_ArrVal_1018 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_71| |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1013) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77| v_ArrVal_1018) |v_t_funThread1of2ForFork0_~p~0#1.offset_71|) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-04 03:57:32,738 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-04 03:57:32,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675675995] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:57:32,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:57:32,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 31 [2023-08-04 03:57:32,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155780371] [2023-08-04 03:57:32,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:57:32,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-04 03:57:32,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:57:32,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-04 03:57:32,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=674, Unknown=3, NotChecked=174, Total=1056 [2023-08-04 03:57:33,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 489 [2023-08-04 03:57:33,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 352 transitions, 4195 flow. Second operand has 33 states, 33 states have (on average 148.8181818181818) internal successors, (4911), 33 states have internal predecessors, (4911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:57:33,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:57:33,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 489 [2023-08-04 03:57:33,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:57:59,289 WARN L233 SmtUtils]: Spent 26.07s 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-04 03:58:01,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:58:03,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:58:27,483 WARN L233 SmtUtils]: Spent 24.12s on a formula simplification. DAG size of input: 43 DAG size of output: 29 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 03:58:29,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:58:31,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:58:33,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:58:35,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:58:37,563 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-04 03:58:39,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:58:41,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:58:43,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:58:45,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:58:47,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:58:49,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:59:12,668 WARN L233 SmtUtils]: Spent 22.91s on a formula simplification. DAG size of input: 43 DAG size of output: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 03:59:15,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:59:17,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:59:31,888 WARN L233 SmtUtils]: Spent 14.05s on a formula simplification. DAG size of input: 45 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 03:59:34,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:59:36,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:59:38,326 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-04 03:59:40,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:59:42,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:59:44,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:59:46,476 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-04 03:59:48,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:59:50,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:59:52,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:59:54,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:59:56,775 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-04 03:59:58,783 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-04 04:00:00,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:00:02,791 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-04 04:00:04,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:00:06,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:00:09,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 04:00:11,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 04:00:13,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 04:00:15,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 04:00:17,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 04:00:21,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 04:00:23,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 04:00:31,773 INFO L124 PetriNetUnfolderBase]: 23362/44353 cut-off events. [2023-08-04 04:00:31,773 INFO L125 PetriNetUnfolderBase]: For 338218/338428 co-relation queries the response was YES. [2023-08-04 04:00:32,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198936 conditions, 44353 events. 23362/44353 cut-off events. For 338218/338428 co-relation queries the response was YES. Maximal size of possible extension queue 1874. Compared 433987 event pairs, 4217 based on Foata normal form. 13/40097 useless extension candidates. Maximal degree in co-relation 198844. Up to 20159 conditions per place. [2023-08-04 04:00:32,194 INFO L140 encePairwiseOnDemand]: 469/489 looper letters, 658 selfloop transitions, 334 changer transitions 188/1189 dead transitions. [2023-08-04 04:00:32,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 1189 transitions, 13438 flow [2023-08-04 04:00:32,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-08-04 04:00:32,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-08-04 04:00:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 7389 transitions. [2023-08-04 04:00:32,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3357873210633947 [2023-08-04 04:00:32,203 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 7389 transitions. [2023-08-04 04:00:32,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 7389 transitions. [2023-08-04 04:00:32,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:00:32,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 7389 transitions. [2023-08-04 04:00:32,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 164.2) internal successors, (7389), 45 states have internal predecessors, (7389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:32,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 489.0) internal successors, (22494), 46 states have internal predecessors, (22494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:32,229 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 489.0) internal successors, (22494), 46 states have internal predecessors, (22494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:32,229 INFO L175 Difference]: Start difference. First operand has 211 places, 352 transitions, 4195 flow. Second operand 45 states and 7389 transitions. [2023-08-04 04:00:32,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 1189 transitions, 13438 flow [2023-08-04 04:00:36,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 1189 transitions, 12868 flow, removed 261 selfloop flow, removed 4 redundant places. [2023-08-04 04:00:36,422 INFO L231 Difference]: Finished difference. Result has 268 places, 545 transitions, 7587 flow [2023-08-04 04:00:36,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=3850, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=7587, PETRI_PLACES=268, PETRI_TRANSITIONS=545} [2023-08-04 04:00:36,423 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 200 predicate places. [2023-08-04 04:00:36,423 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 545 transitions, 7587 flow [2023-08-04 04:00:36,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 148.8181818181818) internal successors, (4911), 33 states have internal predecessors, (4911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:36,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:00:36,424 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:00:36,429 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-04 04:00:36,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:00:36,624 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:00:36,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:00:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash 295547280, now seen corresponding path program 4 times [2023-08-04 04:00:36,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:00:36,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954884756] [2023-08-04 04:00:36,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:00:36,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:00:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:00:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-04 04:00:37,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:00:37,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954884756] [2023-08-04 04:00:37,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954884756] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:00:37,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778128904] [2023-08-04 04:00:37,131 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-04 04:00:37,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:00:37,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:00:37,134 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-04 04:00:37,157 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-04 04:00:37,286 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-04 04:00:37,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:00:37,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-04 04:00:37,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:00:37,296 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 04:00:37,389 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:00:37,389 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 04:00:37,408 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 04:00:37,421 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-04 04:00:37,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:00:37,496 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 04:00:37,536 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-04 04:00:37,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:00:37,571 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 04:00:37,611 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 04:00:37,645 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:00:37,645 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:00:37,670 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-04 04:00:37,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:00:37,813 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:00:37,813 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-04 04:00:37,819 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:00:37,819 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-04 04:00:37,823 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-04 04:00:38,054 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1103 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1103)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_73| |v_t_funThread2of2ForFork0_~p~0#1.offset_79|))) (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1103 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1103)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-08-04 04:00:38,080 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1103 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_1099 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_73| |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1099))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1103))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0))) (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1103 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_1099 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1099))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1103))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-04 04:00:46,141 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:00:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-04 04:00:46,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778128904] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:00:46,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:00:46,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-08-04 04:00:46,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875553287] [2023-08-04 04:00:46,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:00:46,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-04 04:00:46,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:00:46,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-04 04:00:46,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=311, Unknown=7, NotChecked=78, Total=506 [2023-08-04 04:00:46,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 489 [2023-08-04 04:00:46,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 545 transitions, 7587 flow. Second operand has 23 states, 23 states have (on average 159.2173913043478) internal successors, (3662), 23 states have internal predecessors, (3662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:00:46,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:00:46,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 489 [2023-08-04 04:00:46,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:00:48,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 04:00:50,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 04:00:52,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 04:00:52,948 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1105) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_79|)) 0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1103 Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1103)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1105) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_79|)) 0))))) is different from false [2023-08-04 04:00:55,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 04:00:57,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 04:00:59,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 04:01:01,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:01:02,351 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1105) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_79|)) 0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0))) (= (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-04 04:01:08,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:01:10,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:01:14,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:01:16,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:01:18,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:01:23,428 INFO L124 PetriNetUnfolderBase]: 25073/47748 cut-off events. [2023-08-04 04:01:23,429 INFO L125 PetriNetUnfolderBase]: For 418298/418545 co-relation queries the response was YES. [2023-08-04 04:01:23,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227401 conditions, 47748 events. 25073/47748 cut-off events. For 418298/418545 co-relation queries the response was YES. Maximal size of possible extension queue 1994. Compared 472834 event pairs, 4677 based on Foata normal form. 56/43162 useless extension candidates. Maximal degree in co-relation 227281. Up to 22730 conditions per place. [2023-08-04 04:01:24,068 INFO L140 encePairwiseOnDemand]: 454/489 looper letters, 577 selfloop transitions, 438 changer transitions 92/1116 dead transitions. [2023-08-04 04:01:24,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 1116 transitions, 14638 flow [2023-08-04 04:01:24,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-04 04:01:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-04 04:01:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4939 transitions. [2023-08-04 04:01:24,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3607215892491966 [2023-08-04 04:01:24,073 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4939 transitions. [2023-08-04 04:01:24,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4939 transitions. [2023-08-04 04:01:24,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:01:24,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4939 transitions. [2023-08-04 04:01:24,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 176.39285714285714) internal successors, (4939), 28 states have internal predecessors, (4939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:24,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 489.0) internal successors, (14181), 29 states have internal predecessors, (14181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:24,100 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 489.0) internal successors, (14181), 29 states have internal predecessors, (14181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:24,100 INFO L175 Difference]: Start difference. First operand has 268 places, 545 transitions, 7587 flow. Second operand 28 states and 4939 transitions. [2023-08-04 04:01:24,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 1116 transitions, 14638 flow [2023-08-04 04:01:27,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 1116 transitions, 14365 flow, removed 112 selfloop flow, removed 13 redundant places. [2023-08-04 04:01:27,573 INFO L231 Difference]: Finished difference. Result has 298 places, 720 transitions, 10825 flow [2023-08-04 04:01:27,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=7364, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=304, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=10825, PETRI_PLACES=298, PETRI_TRANSITIONS=720} [2023-08-04 04:01:27,574 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 230 predicate places. [2023-08-04 04:01:27,574 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 720 transitions, 10825 flow [2023-08-04 04:01:27,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 159.2173913043478) internal successors, (3662), 23 states have internal predecessors, (3662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:27,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:01:27,575 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:01:27,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-04 04:01:27,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:01:27,775 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-04 04:01:27,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:01:27,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1099752855, now seen corresponding path program 1 times [2023-08-04 04:01:27,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:01:27,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128638458] [2023-08-04 04:01:27,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:27,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:01:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:28,289 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-04 04:01:28,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:01:28,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128638458] [2023-08-04 04:01:28,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128638458] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:01:28,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631007324] [2023-08-04 04:01:28,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:01:28,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:01:28,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:01:28,292 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-04 04:01:28,303 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-04 04:01:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:01:28,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-04 04:01:28,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:01:28,433 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 04:01:28,529 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:01:28,529 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 04:01:28,560 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 04:01:28,586 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-04 04:01:28,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:01:28,698 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 04:01:28,742 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 04:01:28,838 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-04 04:01:28,838 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 15 [2023-08-04 04:01:28,873 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-04 04:01:28,915 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-04 04:01:28,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:01:29,104 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:01:29,104 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-08-04 04:01:29,113 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:01:29,113 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2023-08-04 04:01:29,118 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-04 04:01:31,140 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1190 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (|~#a~0.offset| Int) (v_ArrVal_1192 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_75|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1190) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1192) .cse0) 0)))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1190 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (|~#a~0.offset| Int) (v_ArrVal_1192 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1190) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1192) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|)) 0)))) is different from false [2023-08-04 04:01:31,411 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-04 04:01:31,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631007324] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:01:31,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:01:31,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-08-04 04:01:31,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986910663] [2023-08-04 04:01:31,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:01:31,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-04 04:01:31,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:01:31,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-04 04:01:31,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=4, NotChecked=38, Total=462 [2023-08-04 04:01:31,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 489 [2023-08-04 04:01:31,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 720 transitions, 10825 flow. Second operand has 22 states, 22 states have (on average 155.45454545454547) internal successors, (3420), 22 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:31,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:01:31,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 489 [2023-08-04 04:01:31,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:01:34,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:01:36,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:01:55,949 INFO L124 PetriNetUnfolderBase]: 39301/75688 cut-off events. [2023-08-04 04:01:55,950 INFO L125 PetriNetUnfolderBase]: For 900028/900248 co-relation queries the response was YES. [2023-08-04 04:01:57,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439804 conditions, 75688 events. 39301/75688 cut-off events. For 900028/900248 co-relation queries the response was YES. Maximal size of possible extension queue 3138. Compared 806254 event pairs, 11890 based on Foata normal form. 404/68920 useless extension candidates. Maximal degree in co-relation 439677. Up to 28701 conditions per place. [2023-08-04 04:01:57,361 INFO L140 encePairwiseOnDemand]: 466/489 looper letters, 908 selfloop transitions, 509 changer transitions 300/1726 dead transitions. [2023-08-04 04:01:57,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 1726 transitions, 26564 flow [2023-08-04 04:01:57,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-04 04:01:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-04 04:01:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5161 transitions. [2023-08-04 04:01:57,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3518064076346285 [2023-08-04 04:01:57,365 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5161 transitions. [2023-08-04 04:01:57,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5161 transitions. [2023-08-04 04:01:57,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:01:57,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5161 transitions. [2023-08-04 04:01:57,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 172.03333333333333) internal successors, (5161), 30 states have internal predecessors, (5161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:57,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 489.0) internal successors, (15159), 31 states have internal predecessors, (15159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:57,381 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 489.0) internal successors, (15159), 31 states have internal predecessors, (15159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:01:57,381 INFO L175 Difference]: Start difference. First operand has 298 places, 720 transitions, 10825 flow. Second operand 30 states and 5161 transitions. [2023-08-04 04:01:57,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 1726 transitions, 26564 flow [2023-08-04 04:02:08,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 1726 transitions, 24841 flow, removed 547 selfloop flow, removed 9 redundant places. [2023-08-04 04:02:08,639 INFO L231 Difference]: Finished difference. Result has 335 places, 969 transitions, 15494 flow [2023-08-04 04:02:08,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=9706, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=15494, PETRI_PLACES=335, PETRI_TRANSITIONS=969} [2023-08-04 04:02:08,640 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 267 predicate places. [2023-08-04 04:02:08,640 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 969 transitions, 15494 flow [2023-08-04 04:02:08,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 155.45454545454547) internal successors, (3420), 22 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:08,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:08,641 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:02:08,645 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-04 04:02:08,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-04 04:02:08,841 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-04 04:02:08,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:08,842 INFO L85 PathProgramCache]: Analyzing trace with hash -959871481, now seen corresponding path program 2 times [2023-08-04 04:02:08,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:08,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333211229] [2023-08-04 04:02:08,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:08,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:09,447 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-04 04:02:09,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:02:09,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333211229] [2023-08-04 04:02:09,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333211229] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:02:09,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360914451] [2023-08-04 04:02:09,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:02:09,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:02:09,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:02:09,450 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 04:02:09,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-04 04:02:09,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 04:02:09,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:02:09,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-04 04:02:09,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:02:09,619 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 04:02:09,737 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:02:09,737 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 04:02:09,771 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 04:02:09,816 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-04 04:02:09,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:02:09,926 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 04:02:09,940 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 04:02:10,051 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-04 04:02:10,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:02:10,095 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 04:02:10,144 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-04 04:02:10,144 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 15 [2023-08-04 04:02:10,199 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-04 04:02:10,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:02:10,327 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1277 Int) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (|~#a~0.offset| Int)) (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1279) |c_~#a~0.base|) (+ .cse0 4 |~#a~0.offset|)) 0)) (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1276))) (store .cse1 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1277))) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|)) 0)))) is different from false [2023-08-04 04:02:10,357 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:02:10,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-08-04 04:02:10,366 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:02:10,366 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2023-08-04 04:02:10,372 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-04 04:02:10,402 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1277 Int) (v_ArrVal_1276 (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_1276) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_77| v_ArrVal_1277) (+ .cse0 |~#a~0.offset|)) 0))) (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1277 Int) (v_ArrVal_1276 (Array Int Int)) (|~#a~0.offset| Int)) (let ((.cse1 (+ .cse0 |~#a~0.offset|))) (or (= .cse1 |v_t_funThread1of2ForFork0_~p~0#1.offset_77|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1276) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_77| v_ArrVal_1277) .cse1) 0)))))) is different from false [2023-08-04 04:02:18,512 WARN L233 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:02:18,809 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-04 04:02:18,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360914451] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:02:18,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:02:18,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-08-04 04:02:18,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652150817] [2023-08-04 04:02:18,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:02:18,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-04 04:02:18,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:02:18,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-04 04:02:18,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=315, Unknown=4, NotChecked=78, Total=506 [2023-08-04 04:02:18,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 489 [2023-08-04 04:02:18,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 969 transitions, 15494 flow. Second operand has 23 states, 23 states have (on average 157.47826086956522) internal successors, (3622), 23 states have internal predecessors, (3622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:18,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:02:18,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 489 [2023-08-04 04:02:18,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:02:23,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 04:02:25,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 04:02:31,755 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 54 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:02:41,127 WARN L233 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 54 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:02:56,476 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 53 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:03:10,600 INFO L124 PetriNetUnfolderBase]: 43039/84625 cut-off events. [2023-08-04 04:03:10,600 INFO L125 PetriNetUnfolderBase]: For 1220317/1220456 co-relation queries the response was YES. [2023-08-04 04:03:12,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522732 conditions, 84625 events. 43039/84625 cut-off events. For 1220317/1220456 co-relation queries the response was YES. Maximal size of possible extension queue 3459. Compared 934525 event pairs, 9509 based on Foata normal form. 241/77381 useless extension candidates. Maximal degree in co-relation 522586. Up to 30941 conditions per place. [2023-08-04 04:03:12,226 INFO L140 encePairwiseOnDemand]: 470/489 looper letters, 760 selfloop transitions, 750 changer transitions 236/1755 dead transitions. [2023-08-04 04:03:12,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 1755 transitions, 28181 flow [2023-08-04 04:03:12,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-04 04:03:12,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-04 04:03:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4272 transitions. [2023-08-04 04:03:12,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36400817995910023 [2023-08-04 04:03:12,230 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4272 transitions. [2023-08-04 04:03:12,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4272 transitions. [2023-08-04 04:03:12,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:03:12,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4272 transitions. [2023-08-04 04:03:12,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 178.0) internal successors, (4272), 24 states have internal predecessors, (4272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:12,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 489.0) internal successors, (12225), 25 states have internal predecessors, (12225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:12,242 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 489.0) internal successors, (12225), 25 states have internal predecessors, (12225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:12,242 INFO L175 Difference]: Start difference. First operand has 335 places, 969 transitions, 15494 flow. Second operand 24 states and 4272 transitions. [2023-08-04 04:03:12,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 1755 transitions, 28181 flow [2023-08-04 04:03:25,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 1755 transitions, 27498 flow, removed 310 selfloop flow, removed 4 redundant places. [2023-08-04 04:03:25,716 INFO L231 Difference]: Finished difference. Result has 364 places, 1173 transitions, 20822 flow [2023-08-04 04:03:25,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=15061, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=969, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=585, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=20822, PETRI_PLACES=364, PETRI_TRANSITIONS=1173} [2023-08-04 04:03:25,717 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 296 predicate places. [2023-08-04 04:03:25,718 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 1173 transitions, 20822 flow [2023-08-04 04:03:25,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 157.47826086956522) internal successors, (3622), 23 states have internal predecessors, (3622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:25,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:03:25,718 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:03:25,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-04 04:03:25,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-04 04:03:25,919 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:03:25,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:03:25,919 INFO L85 PathProgramCache]: Analyzing trace with hash -238101121, now seen corresponding path program 1 times [2023-08-04 04:03:25,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:03:25,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514317725] [2023-08-04 04:03:25,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:03:25,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:03:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:03:40,613 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-04 04:03:40,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:03:40,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514317725] [2023-08-04 04:03:40,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514317725] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:03:40,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271740418] [2023-08-04 04:03:40,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:03:40,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:03:40,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:03:40,615 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 04:03:40,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-04 04:03:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:03:40,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-04 04:03:40,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:03:40,750 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 04:03:40,824 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:03:40,824 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 04:03:40,853 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 04:03:40,870 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-04 04:03:40,931 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 04:03:40,990 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-04 04:03:40,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 15 [2023-08-04 04:03:41,056 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-04 04:03:41,110 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-04 04:03:41,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:03:41,324 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-08-04 04:03:41,331 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2023-08-04 04:03:41,339 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1363 Int) (|~#a~0.offset| Int) (v_ArrVal_1362 (Array Int Int)) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_79|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1362) |c_~#a~0.base|) .cse0 v_ArrVal_1363) |v_t_funThread1of2ForFork0_~p~0#1.offset_79|) 0)))) is different from false [2023-08-04 04:03:41,520 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-04 04:03:41,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271740418] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:03:41,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:03:41,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 28 [2023-08-04 04:03:41,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082054230] [2023-08-04 04:03:41,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:03:41,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-04 04:03:41,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:03:41,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-04 04:03:41,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=699, Unknown=2, NotChecked=54, Total=870 [2023-08-04 04:03:41,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 489 [2023-08-04 04:03:41,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 1173 transitions, 20822 flow. Second operand has 30 states, 30 states have (on average 148.1) internal successors, (4443), 30 states have internal predecessors, (4443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:41,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:03:41,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 489 [2023-08-04 04:03:41,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:04:19,849 INFO L124 PetriNetUnfolderBase]: 46149/91486 cut-off events. [2023-08-04 04:04:19,850 INFO L125 PetriNetUnfolderBase]: For 1630880/1631040 co-relation queries the response was YES. [2023-08-04 04:04:22,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606681 conditions, 91486 events. 46149/91486 cut-off events. For 1630880/1631040 co-relation queries the response was YES. Maximal size of possible extension queue 3664. Compared 1028634 event pairs, 16196 based on Foata normal form. 47/83052 useless extension candidates. Maximal degree in co-relation 606519. Up to 55851 conditions per place. [2023-08-04 04:04:22,413 INFO L140 encePairwiseOnDemand]: 467/489 looper letters, 1051 selfloop transitions, 435 changer transitions 317/1812 dead transitions. [2023-08-04 04:04:22,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 1812 transitions, 33780 flow [2023-08-04 04:04:22,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-04 04:04:22,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-04 04:04:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 5142 transitions. [2023-08-04 04:04:22,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3286042944785276 [2023-08-04 04:04:22,419 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 5142 transitions. [2023-08-04 04:04:22,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 5142 transitions. [2023-08-04 04:04:22,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:04:22,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 5142 transitions. [2023-08-04 04:04:22,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 160.6875) internal successors, (5142), 32 states have internal predecessors, (5142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:22,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 489.0) internal successors, (16137), 33 states have internal predecessors, (16137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:22,436 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 489.0) internal successors, (16137), 33 states have internal predecessors, (16137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:22,436 INFO L175 Difference]: Start difference. First operand has 364 places, 1173 transitions, 20822 flow. Second operand 32 states and 5142 transitions. [2023-08-04 04:04:22,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 1812 transitions, 33780 flow [2023-08-04 04:04:49,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 1812 transitions, 32577 flow, removed 195 selfloop flow, removed 7 redundant places. [2023-08-04 04:04:49,517 INFO L231 Difference]: Finished difference. Result has 396 places, 1227 transitions, 22763 flow [2023-08-04 04:04:49,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=19937, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=300, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=841, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=22763, PETRI_PLACES=396, PETRI_TRANSITIONS=1227} [2023-08-04 04:04:49,518 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 328 predicate places. [2023-08-04 04:04:49,518 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 1227 transitions, 22763 flow [2023-08-04 04:04:49,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 148.1) internal successors, (4443), 30 states have internal predecessors, (4443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:49,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:04:49,519 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:04:49,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-04 04:04:49,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-04 04:04:49,720 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:04:49,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:04:49,720 INFO L85 PathProgramCache]: Analyzing trace with hash -433034171, now seen corresponding path program 3 times [2023-08-04 04:04:49,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:04:49,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583228998] [2023-08-04 04:04:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:04:49,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:04:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:04:49,992 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-04 04:04:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:04:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583228998] [2023-08-04 04:04:49,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583228998] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:04:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583415788] [2023-08-04 04:04:49,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 04:04:49,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:04:49,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:04:49,994 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 04:04:50,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-04 04:04:50,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 04:04:50,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:04:50,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-04 04:04:50,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:04:50,214 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 04:04:50,266 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:04:50,266 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 04:04:50,287 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 04:04:50,318 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 04:04:50,350 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-04 04:04:50,389 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-04 04:04:50,390 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 15 [2023-08-04 04:04:50,456 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-04 04:04:50,498 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-04 04:04:50,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:04:50,556 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-08-04 04:04:50,561 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-04 04:04:52,570 WARN L839 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1449 Int)) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81| v_ArrVal_1449) .cse0) 0) (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_81|)))) is different from false [2023-08-04 04:04:52,593 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1445 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1449 Int)) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_81|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1445) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81| v_ArrVal_1449) .cse0) 0)))) is different from false [2023-08-04 04:04:52,810 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-04 04:04:52,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583415788] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:04:52,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:04:52,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2023-08-04 04:04:52,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330511018] [2023-08-04 04:04:52,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:04:52,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-04 04:04:52,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:04:52,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-04 04:04:52,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=178, Unknown=2, NotChecked=58, Total=306 [2023-08-04 04:04:52,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 489 [2023-08-04 04:04:52,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 1227 transitions, 22763 flow. Second operand has 18 states, 18 states have (on average 159.05555555555554) internal successors, (2863), 18 states have internal predecessors, (2863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:52,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:04:52,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 489 [2023-08-04 04:04:52,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-08-04 04:05:14,257 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-04 04:05:14,257 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 04:05:15,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-08-04 04:05:15,346 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 04:05:15,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-04 04:05:15,347 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-04 04:05:15,347 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 04:05:15,347 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 04:05:15,347 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 04:05:15,347 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-04 04:05:15,348 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-04 04:05:15,348 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 04:05:15,348 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 04:05:15,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 04:05:15 BasicIcfg [2023-08-04 04:05:15,361 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 04:05:15,361 INFO L158 Benchmark]: Toolchain (without parser) took 798901.15ms. Allocated memory was 515.9MB in the beginning and 14.6GB in the end (delta: 14.1GB). Free memory was 467.5MB in the beginning and 10.6GB in the end (delta: -10.2GB). Peak memory consumption was 13.7GB. Max. memory is 16.0GB. [2023-08-04 04:05:15,366 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 350.2MB. Free memory was 304.3MB in the beginning and 304.2MB in the end (delta: 56.5kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 04:05:15,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 601.94ms. Allocated memory is still 515.9MB. Free memory was 467.2MB in the beginning and 437.6MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-04 04:05:15,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.53ms. Allocated memory is still 515.9MB. Free memory was 437.6MB in the beginning and 485.7MB in the end (delta: -48.1MB). Peak memory consumption was 9.6MB. Max. memory is 16.0GB. [2023-08-04 04:05:15,367 INFO L158 Benchmark]: Boogie Preprocessor took 39.60ms. Allocated memory is still 515.9MB. Free memory was 485.7MB in the beginning and 483.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 04:05:15,367 INFO L158 Benchmark]: RCFGBuilder took 556.33ms. Allocated memory is still 515.9MB. Free memory was 483.3MB in the beginning and 464.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-04 04:05:15,367 INFO L158 Benchmark]: TraceAbstraction took 797635.41ms. Allocated memory was 515.9MB in the beginning and 14.6GB in the end (delta: 14.1GB). Free memory was 463.7MB in the beginning and 10.6GB in the end (delta: -10.2GB). Peak memory consumption was 13.7GB. Max. memory is 16.0GB. [2023-08-04 04:05:15,368 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.16ms. Allocated memory is still 350.2MB. Free memory was 304.3MB in the beginning and 304.2MB in the end (delta: 56.5kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 601.94ms. Allocated memory is still 515.9MB. Free memory was 467.2MB in the beginning and 437.6MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.53ms. Allocated memory is still 515.9MB. Free memory was 437.6MB in the beginning and 485.7MB in the end (delta: -48.1MB). Peak memory consumption was 9.6MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.60ms. Allocated memory is still 515.9MB. Free memory was 485.7MB in the beginning and 483.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 556.33ms. Allocated memory is still 515.9MB. Free memory was 483.3MB in the beginning and 464.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 797635.41ms. Allocated memory was 515.9MB in the beginning and 14.6GB in the end (delta: 14.1GB). Free memory was 463.7MB in the beginning and 10.6GB in the end (delta: -10.2GB). Peak memory consumption was 13.7GB. 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, 161 PlacesBefore, 45 PlacesAfterwards, 188 TransitionsBefore, 66 TransitionsAfterwards, 10792 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 100 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 18 ConcurrentYvCompositions, 6 ChoiceCompositions, 164 TotalNumberOfCompositions, 17790 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9093, independent: 8818, independent conditional: 0, independent unconditional: 8818, dependent: 275, dependent conditional: 0, dependent unconditional: 275, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5389, independent: 5328, independent conditional: 0, independent unconditional: 5328, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9093, independent: 3490, independent conditional: 0, independent unconditional: 3490, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 5389, unknown conditional: 0, unknown unconditional: 5389] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 161 PlacesBefore, 45 PlacesAfterwards, 188 TransitionsBefore, 66 TransitionsAfterwards, 10792 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 98 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 18 ConcurrentYvCompositions, 6 ChoiceCompositions, 162 TotalNumberOfCompositions, 17496 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8947, independent: 8676, independent conditional: 0, independent unconditional: 8676, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5414, independent: 5353, independent conditional: 0, independent unconditional: 5353, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8947, independent: 3323, independent conditional: 0, independent unconditional: 3323, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 5414, unknown conditional: 0, unknown unconditional: 5414] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 181, Positive conditional cache size: 0, Positive unconditional cache size: 181, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 226 PlacesBefore, 68 PlacesAfterwards, 266 TransitionsBefore, 100 TransitionsAfterwards, 33228 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 145 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 30 ConcurrentYvCompositions, 8 ChoiceCompositions, 223 TotalNumberOfCompositions, 57444 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28305, independent: 27868, independent conditional: 0, independent unconditional: 27868, dependent: 437, dependent conditional: 0, dependent unconditional: 437, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 16620, independent: 16512, independent conditional: 0, independent unconditional: 16512, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 28305, independent: 11356, independent conditional: 0, independent unconditional: 11356, dependent: 329, dependent conditional: 0, dependent unconditional: 329, unknown: 16620, unknown conditional: 0, unknown unconditional: 16620] , Statistics on independence cache: Total cache size (in pairs): 739, Positive cache size: 696, Positive conditional cache size: 0, Positive unconditional cache size: 696, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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 with 1 thread instances CFG has 3 procedures, 222 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.2s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 358 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 819 IncrementalHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 2 mSDtfsCounter, 819 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 100 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 303 SizeOfPredicates, 5 NumberOfNonLiveVariables, 526 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 23/58 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 281 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 787.6s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 625.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 387 mSolverCounterUnknown, 10520 SdHoareTripleChecker+Valid, 287.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10196 mSDsluCounter, 1318 SdHoareTripleChecker+Invalid, 284.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 10646 IncrementalHoareTripleChecker+Unchecked, 1208 mSDsCounter, 1505 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22448 IncrementalHoareTripleChecker+Invalid, 34986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1505 mSolverCounterUnsat, 110 mSDtfsCounter, 22448 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1159 GetRequests, 672 SyntacticMatches, 25 SemanticMatches, 462 ConstructedPredicates, 21 IntricatePredicates, 2 DeprecatedPredicates, 3141 ImplicationChecksByTransitivity, 255.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22763occurred in iteration=18, InterpolantAutomatonStates: 309, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 152.5s InterpolantComputationTime, 872 NumberOfCodeBlocks, 846 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1221 ConstructedInterpolants, 347 QuantifiedInterpolants, 26113 SizeOfPredicates, 106 NumberOfNonLiveVariables, 3510 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 51 InterpolantComputations, 4 PerfectInterpolantSequences, 2079/2386 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 222 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.6s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 326 IncrementalHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 2 mSDtfsCounter, 326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 14/47 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown