/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/increased_bounds/goblint-regression_28-race_reach_46-escape_racefree_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 04:35:10,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 04:35:10,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 04:35:10,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 04:35:10,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 04:35:10,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 04:35:10,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 04:35:10,178 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 04:35:10,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 04:35:10,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 04:35:10,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 04:35:10,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 04:35:10,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 04:35:10,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 04:35:10,187 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 04:35:10,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 04:35:10,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 04:35:10,187 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 04:35:10,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 04:35:10,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 04:35:10,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 04:35:10,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 04:35:10,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 04:35:10,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 04:35:10,190 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 04:35:10,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 04:35:10,190 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 04:35:10,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 04:35:10,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 04:35:10,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 04:35:10,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 04:35:10,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 04:35:10,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 04:35:10,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 04:35:10,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 04:35:10,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 04:35:10,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 04:35:10,193 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 04:35:10,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 04:35:10,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 04:35:10,194 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 04:35:10,194 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 04:35:10,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 04:35:10,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 04:35:10,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 04:35:10,445 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 04:35:10,445 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 04:35:10,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/goblint-regression_28-race_reach_46-escape_racefree_bound2.i [2023-08-04 04:35:11,654 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 04:35:11,883 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 04:35:11,883 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/goblint-regression_28-race_reach_46-escape_racefree_bound2.i [2023-08-04 04:35:11,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e76404baa/840e3e8d8ec640b5bff8f14fdedf6321/FLAG202a7d81f [2023-08-04 04:35:11,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e76404baa/840e3e8d8ec640b5bff8f14fdedf6321 [2023-08-04 04:35:11,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 04:35:11,910 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 04:35:11,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 04:35:11,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 04:35:11,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 04:35:11,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 04:35:11" (1/1) ... [2023-08-04 04:35:11,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ce8ea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:35:11, skipping insertion in model container [2023-08-04 04:35:11,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 04:35:11" (1/1) ... [2023-08-04 04:35:11,956 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 04:35:12,217 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/goblint-regression_28-race_reach_46-escape_racefree_bound2.i[30176,30189] [2023-08-04 04:35:12,240 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 04:35:12,253 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 04:35:12,284 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 04:35:12,285 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 04:35:12,307 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/goblint-regression_28-race_reach_46-escape_racefree_bound2.i[30176,30189] [2023-08-04 04:35:12,322 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 04:35:12,363 INFO L206 MainTranslator]: Completed translation [2023-08-04 04:35:12,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:35:12 WrapperNode [2023-08-04 04:35:12,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 04:35:12,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 04:35:12,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 04:35:12,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 04:35:12,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:35:12" (1/1) ... [2023-08-04 04:35:12,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:35:12" (1/1) ... [2023-08-04 04:35:12,402 INFO L138 Inliner]: procedures = 170, calls = 39, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2023-08-04 04:35:12,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 04:35:12,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 04:35:12,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 04:35:12,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 04:35:12,413 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:35:12" (1/1) ... [2023-08-04 04:35:12,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:35:12" (1/1) ... [2023-08-04 04:35:12,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:35:12" (1/1) ... [2023-08-04 04:35:12,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:35:12" (1/1) ... [2023-08-04 04:35:12,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:35:12" (1/1) ... [2023-08-04 04:35:12,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:35:12" (1/1) ... [2023-08-04 04:35:12,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:35:12" (1/1) ... [2023-08-04 04:35:12,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:35:12" (1/1) ... [2023-08-04 04:35:12,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 04:35:12,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 04:35:12,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 04:35:12,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 04:35:12,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:35:12" (1/1) ... [2023-08-04 04:35:12,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 04:35:12,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:35:12,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 04:35:12,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 04:35:12,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 04:35:12,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 04:35:12,505 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-04 04:35:12,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 04:35:12,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 04:35:12,506 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-04 04:35:12,506 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-04 04:35:12,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 04:35:12,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 04:35:12,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 04:35:12,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 04:35:12,507 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 04:35:12,614 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 04:35:12,616 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 04:35:12,881 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 04:35:12,887 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 04:35:12,888 INFO L302 CfgBuilder]: Removed 10 assume(true) statements. [2023-08-04 04:35:12,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 04:35:12 BoogieIcfgContainer [2023-08-04 04:35:12,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 04:35:12,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 04:35:12,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 04:35:12,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 04:35:12,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 04:35:11" (1/3) ... [2023-08-04 04:35:12,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a30faa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 04:35:12, skipping insertion in model container [2023-08-04 04:35:12,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:35:12" (2/3) ... [2023-08-04 04:35:12,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a30faa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 04:35:12, skipping insertion in model container [2023-08-04 04:35:12,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 04:35:12" (3/3) ... [2023-08-04 04:35:12,899 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_46-escape_racefree_bound2.i [2023-08-04 04:35:12,907 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 04:35:12,913 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 04:35:12,914 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 04:35:12,914 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 04:35:12,969 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-04 04:35:13,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 118 transitions, 244 flow [2023-08-04 04:35:13,054 INFO L124 PetriNetUnfolderBase]: 17/155 cut-off events. [2023-08-04 04:35:13,054 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 04:35:13,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 155 events. 17/155 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 376 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 75. Up to 4 conditions per place. [2023-08-04 04:35:13,061 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 118 transitions, 244 flow [2023-08-04 04:35:13,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 113 transitions, 231 flow [2023-08-04 04:35:13,068 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:35:13,076 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 113 transitions, 231 flow [2023-08-04 04:35:13,079 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 113 transitions, 231 flow [2023-08-04 04:35:13,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 113 transitions, 231 flow [2023-08-04 04:35:13,106 INFO L124 PetriNetUnfolderBase]: 16/150 cut-off events. [2023-08-04 04:35:13,107 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:35:13,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 150 events. 16/150 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 359 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 75. Up to 4 conditions per place. [2023-08-04 04:35:13,110 INFO L119 LiptonReduction]: Number of co-enabled transitions 2838 [2023-08-04 04:35:16,252 INFO L134 LiptonReduction]: Checked pairs total: 4947 [2023-08-04 04:35:16,252 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-04 04:35:16,265 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 04:35:16,270 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;@65af8970, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:35:16,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 04:35:16,274 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:35:16,274 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-04 04:35:16,274 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:35:16,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:35:16,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 04:35:16,275 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:35:16,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:35:16,280 INFO L85 PathProgramCache]: Analyzing trace with hash 13800893, now seen corresponding path program 1 times [2023-08-04 04:35:16,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:35:16,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565128388] [2023-08-04 04:35:16,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:35:16,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:35:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:35:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:35:16,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:35:16,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565128388] [2023-08-04 04:35:16,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565128388] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:35:16,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:35:16,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:35:16,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55684977] [2023-08-04 04:35:16,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:35:16,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:35:16,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:35:16,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:35:16,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:35:16,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 214 [2023-08-04 04:35:16,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 32 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states 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:35:16,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:35:16,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 214 [2023-08-04 04:35:16,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:35:16,661 INFO L124 PetriNetUnfolderBase]: 72/180 cut-off events. [2023-08-04 04:35:16,662 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:35:16,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 180 events. 72/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 615 event pairs, 56 based on Foata normal form. 9/168 useless extension candidates. Maximal degree in co-relation 336. Up to 153 conditions per place. [2023-08-04 04:35:16,665 INFO L140 encePairwiseOnDemand]: 202/214 looper letters, 23 selfloop transitions, 2 changer transitions 6/33 dead transitions. [2023-08-04 04:35:16,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 129 flow [2023-08-04 04:35:16,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:35:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:35:16,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-08-04 04:35:16,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5373831775700935 [2023-08-04 04:35:16,685 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-08-04 04:35:16,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-08-04 04:35:16,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:35:16,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-08-04 04:35:16,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states 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:35:16,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states 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:35:16,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states 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:35:16,702 INFO L175 Difference]: Start difference. First operand has 27 places, 32 transitions, 69 flow. Second operand 3 states and 345 transitions. [2023-08-04 04:35:16,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 129 flow [2023-08-04 04:35:16,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 129 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:35:16,706 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 47 flow [2023-08-04 04:35:16,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=47, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-08-04 04:35:16,712 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2023-08-04 04:35:16,712 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 47 flow [2023-08-04 04:35:16,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states 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:35:16,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:35:16,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:35:16,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 04:35:16,713 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:35:16,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:35:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash -920957774, now seen corresponding path program 1 times [2023-08-04 04:35:16,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:35:16,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520632530] [2023-08-04 04:35:16,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:35:16,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:35:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:35:16,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:35:16,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:35:16,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520632530] [2023-08-04 04:35:16,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520632530] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:35:16,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90712030] [2023-08-04 04:35:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:35:16,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:35:16,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:35:16,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 04:35:16,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 04:35:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:35:16,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 04:35:16,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:35:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:35:16,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:35:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:35:17,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90712030] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:35:17,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:35:17,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 04:35:17,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186420745] [2023-08-04 04:35:17,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:35:17,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:35:17,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:35:17,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:35:17,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:35:17,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 214 [2023-08-04 04:35:17,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 47 flow. Second operand has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states 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:35:17,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:35:17,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 214 [2023-08-04 04:35:17,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:35:17,067 INFO L124 PetriNetUnfolderBase]: 18/54 cut-off events. [2023-08-04 04:35:17,067 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-08-04 04:35:17,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 54 events. 18/54 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 8 based on Foata normal form. 10/64 useless extension candidates. Maximal degree in co-relation 118. Up to 38 conditions per place. [2023-08-04 04:35:17,068 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 0 selfloop transitions, 0 changer transitions 25/25 dead transitions. [2023-08-04 04:35:17,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 25 transitions, 105 flow [2023-08-04 04:35:17,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:35:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:35:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 420 transitions. [2023-08-04 04:35:17,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49065420560747663 [2023-08-04 04:35:17,070 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 420 transitions. [2023-08-04 04:35:17,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 420 transitions. [2023-08-04 04:35:17,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:35:17,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 420 transitions. [2023-08-04 04:35:17,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states 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:35:17,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states 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:35:17,075 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states 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:35:17,075 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 47 flow. Second operand 4 states and 420 transitions. [2023-08-04 04:35:17,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 25 transitions, 105 flow [2023-08-04 04:35:17,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 25 transitions, 99 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 04:35:17,076 INFO L231 Difference]: Finished difference. Result has 21 places, 0 transitions, 0 flow [2023-08-04 04:35:17,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=33, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=21, PETRI_TRANSITIONS=0} [2023-08-04 04:35:17,076 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, -6 predicate places. [2023-08-04 04:35:17,077 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 0 transitions, 0 flow [2023-08-04 04:35:17,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states 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:35:17,079 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 04:35:17,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 04:35:17,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:35:17,280 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 04:35:17,282 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 04:35:17,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 118 transitions, 244 flow [2023-08-04 04:35:17,310 INFO L124 PetriNetUnfolderBase]: 17/155 cut-off events. [2023-08-04 04:35:17,310 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 04:35:17,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 155 events. 17/155 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 376 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 75. Up to 4 conditions per place. [2023-08-04 04:35:17,312 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 118 transitions, 244 flow [2023-08-04 04:35:17,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 113 transitions, 231 flow [2023-08-04 04:35:17,314 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:35:17,314 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 113 transitions, 231 flow [2023-08-04 04:35:17,315 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 113 transitions, 231 flow [2023-08-04 04:35:17,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 113 transitions, 231 flow [2023-08-04 04:35:17,332 INFO L124 PetriNetUnfolderBase]: 16/150 cut-off events. [2023-08-04 04:35:17,332 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:35:17,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 150 events. 16/150 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 359 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 75. Up to 4 conditions per place. [2023-08-04 04:35:17,338 INFO L119 LiptonReduction]: Number of co-enabled transitions 2838 [2023-08-04 04:35:20,201 INFO L134 LiptonReduction]: Checked pairs total: 5376 [2023-08-04 04:35:20,202 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-04 04:35:20,204 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 04:35:20,205 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;@65af8970, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:35:20,205 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 04:35:20,208 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:35:20,208 INFO L124 PetriNetUnfolderBase]: 2/23 cut-off events. [2023-08-04 04:35:20,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:35:20,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:35:20,208 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 04:35:20,208 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 04:35:20,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:35:20,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1071879689, now seen corresponding path program 1 times [2023-08-04 04:35:20,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:35:20,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712863013] [2023-08-04 04:35:20,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:35:20,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:35:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 04:35:20,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 04:35:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 04:35:20,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 04:35:20,254 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 04:35:20,255 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-04 04:35:20,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 04:35:20,255 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 04:35:20,256 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-04 04:35:20,256 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 04:35:20,256 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 04:35:20,272 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-04 04:35:20,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 153 transitions, 324 flow [2023-08-04 04:35:20,295 INFO L124 PetriNetUnfolderBase]: 31/253 cut-off events. [2023-08-04 04:35:20,295 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 04:35:20,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 253 events. 31/253 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 757 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 157. Up to 8 conditions per place. [2023-08-04 04:35:20,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 153 transitions, 324 flow [2023-08-04 04:35:20,298 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 153 transitions, 324 flow [2023-08-04 04:35:20,298 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:35:20,299 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 153 transitions, 324 flow [2023-08-04 04:35:20,299 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 153 transitions, 324 flow [2023-08-04 04:35:20,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 153 transitions, 324 flow [2023-08-04 04:35:20,319 INFO L124 PetriNetUnfolderBase]: 31/253 cut-off events. [2023-08-04 04:35:20,320 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 04:35:20,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 253 events. 31/253 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 757 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 157. Up to 8 conditions per place. [2023-08-04 04:35:20,327 INFO L119 LiptonReduction]: Number of co-enabled transitions 8580 [2023-08-04 04:35:23,012 INFO L134 LiptonReduction]: Checked pairs total: 17140 [2023-08-04 04:35:23,012 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-08-04 04:35:23,014 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 04:35:23,015 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;@65af8970, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:35:23,015 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 04:35:23,018 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:35:23,018 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-04 04:35:23,018 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:35:23,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:35:23,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 04:35:23,018 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:35:23,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:35:23,019 INFO L85 PathProgramCache]: Analyzing trace with hash 26175598, now seen corresponding path program 1 times [2023-08-04 04:35:23,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:35:23,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309607810] [2023-08-04 04:35:23,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:35:23,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:35:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:35:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:35:23,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:35:23,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309607810] [2023-08-04 04:35:23,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309607810] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:35:23,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:35:23,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:35:23,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044308800] [2023-08-04 04:35:23,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:35:23,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:35:23,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:35:23,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:35:23,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:35:23,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 271 [2023-08-04 04:35:23,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 55 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states 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:35:23,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:35:23,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 271 [2023-08-04 04:35:23,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:35:23,449 INFO L124 PetriNetUnfolderBase]: 1833/3238 cut-off events. [2023-08-04 04:35:23,449 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-08-04 04:35:23,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6300 conditions, 3238 events. 1833/3238 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 18911 event pairs, 832 based on Foata normal form. 450/3338 useless extension candidates. Maximal degree in co-relation 586. Up to 2974 conditions per place. [2023-08-04 04:35:23,462 INFO L140 encePairwiseOnDemand]: 254/271 looper letters, 34 selfloop transitions, 2 changer transitions 10/52 dead transitions. [2023-08-04 04:35:23,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 210 flow [2023-08-04 04:35:23,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:35:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:35:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-08-04 04:35:23,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5485854858548586 [2023-08-04 04:35:23,464 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-08-04 04:35:23,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-08-04 04:35:23,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:35:23,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-08-04 04:35:23,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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:35:23,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states 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:35:23,471 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states 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:35:23,473 INFO L175 Difference]: Start difference. First operand has 44 places, 55 transitions, 128 flow. Second operand 3 states and 446 transitions. [2023-08-04 04:35:23,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 210 flow [2023-08-04 04:35:23,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:35:23,481 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 82 flow [2023-08-04 04:35:23,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2023-08-04 04:35:23,483 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-08-04 04:35:23,484 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 82 flow [2023-08-04 04:35:23,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states 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:35:23,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:35:23,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:35:23,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 04:35:23,486 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:35:23,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:35:23,486 INFO L85 PathProgramCache]: Analyzing trace with hash 421527977, now seen corresponding path program 1 times [2023-08-04 04:35:23,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:35:23,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562831224] [2023-08-04 04:35:23,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:35:23,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:35:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:35:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:35:23,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:35:23,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562831224] [2023-08-04 04:35:23,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562831224] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:35:23,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985604962] [2023-08-04 04:35:23,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:35:23,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:35:23,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:35:23,563 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 04:35:23,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 04:35:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:35:23,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 04:35:23,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:35:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:35:23,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:35:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:35:23,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985604962] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:35:23,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:35:23,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 04:35:23,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379350514] [2023-08-04 04:35:23,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:35:23,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:35:23,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:35:23,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:35:23,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:35:23,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 271 [2023-08-04 04:35:23,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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:35:23,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:35:23,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 271 [2023-08-04 04:35:23,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:35:23,871 INFO L124 PetriNetUnfolderBase]: 904/1549 cut-off events. [2023-08-04 04:35:23,871 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2023-08-04 04:35:23,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3264 conditions, 1549 events. 904/1549 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 8025 event pairs, 80 based on Foata normal form. 10/1559 useless extension candidates. Maximal degree in co-relation 332. Up to 1005 conditions per place. [2023-08-04 04:35:23,879 INFO L140 encePairwiseOnDemand]: 267/271 looper letters, 50 selfloop transitions, 3 changer transitions 1/60 dead transitions. [2023-08-04 04:35:23,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 60 transitions, 246 flow [2023-08-04 04:35:23,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:35:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:35:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2023-08-04 04:35:23,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5156826568265682 [2023-08-04 04:35:23,882 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2023-08-04 04:35:23,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2023-08-04 04:35:23,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:35:23,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2023-08-04 04:35:23,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states 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:35:23,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states 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:35:23,886 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states 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:35:23,886 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 82 flow. Second operand 4 states and 559 transitions. [2023-08-04 04:35:23,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 60 transitions, 246 flow [2023-08-04 04:35:23,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:35:23,890 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 94 flow [2023-08-04 04:35:23,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-08-04 04:35:23,892 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2023-08-04 04:35:23,892 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 94 flow [2023-08-04 04:35:23,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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:35:23,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:35:23,893 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-04 04:35:23,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-04 04:35:24,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:35:24,099 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:35:24,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:35:24,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1504730627, now seen corresponding path program 1 times [2023-08-04 04:35:24,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:35:24,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025440263] [2023-08-04 04:35:24,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:35:24,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:35:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:35:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:35:24,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:35:24,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025440263] [2023-08-04 04:35:24,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025440263] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:35:24,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324294481] [2023-08-04 04:35:24,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:35:24,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:35:24,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:35:24,269 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 04:35:24,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 04:35:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:35:24,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-04 04:35:24,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:35:24,377 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 10 treesize of output 8 [2023-08-04 04:35:24,391 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 14 treesize of output 16 [2023-08-04 04:35:24,425 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 14 treesize of output 16 [2023-08-04 04:35:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:35:24,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:35:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:35:24,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324294481] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:35:24,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:35:24,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 3 [2023-08-04 04:35:24,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754546453] [2023-08-04 04:35:24,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:35:24,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:35:24,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:35:24,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:35:24,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=9, Unknown=2, NotChecked=0, Total=20 [2023-08-04 04:35:24,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 271 [2023-08-04 04:35:24,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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:35:24,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:35:24,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 271 [2023-08-04 04:35:24,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:35:24,780 INFO L124 PetriNetUnfolderBase]: 804/1387 cut-off events. [2023-08-04 04:35:24,780 INFO L125 PetriNetUnfolderBase]: For 988/988 co-relation queries the response was YES. [2023-08-04 04:35:24,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 1387 events. 804/1387 cut-off events. For 988/988 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6671 event pairs, 324 based on Foata normal form. 12/1398 useless extension candidates. Maximal degree in co-relation 2478. Up to 1203 conditions per place. [2023-08-04 04:35:24,788 INFO L140 encePairwiseOnDemand]: 267/271 looper letters, 37 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2023-08-04 04:35:24,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 222 flow [2023-08-04 04:35:24,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:35:24,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:35:24,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-08-04 04:35:24,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41697416974169743 [2023-08-04 04:35:24,794 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-08-04 04:35:24,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-08-04 04:35:24,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:35:24,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-08-04 04:35:24,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states 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:35:24,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states 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:35:24,797 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states 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:35:24,797 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 94 flow. Second operand 3 states and 339 transitions. [2023-08-04 04:35:24,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 222 flow [2023-08-04 04:35:24,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 210 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 04:35:24,801 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 106 flow [2023-08-04 04:35:24,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2023-08-04 04:35:24,803 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2023-08-04 04:35:24,803 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 106 flow [2023-08-04 04:35:24,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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:35:24,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:35:24,805 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:35:24,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 04:35:25,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:35:25,011 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:35:25,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:35:25,011 INFO L85 PathProgramCache]: Analyzing trace with hash 281388984, now seen corresponding path program 1 times [2023-08-04 04:35:25,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:35:25,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839740604] [2023-08-04 04:35:25,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:35:25,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:35:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:35:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:35:25,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:35:25,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839740604] [2023-08-04 04:35:25,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839740604] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:35:25,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:35:25,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 04:35:25,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56062585] [2023-08-04 04:35:25,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:35:25,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 04:35:25,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:35:25,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 04:35:25,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 04:35:25,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 271 [2023-08-04 04:35:25,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states 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:35:25,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:35:25,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 271 [2023-08-04 04:35:25,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:35:25,257 INFO L124 PetriNetUnfolderBase]: 62/202 cut-off events. [2023-08-04 04:35:25,257 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2023-08-04 04:35:25,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 202 events. 62/202 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 724 event pairs, 6 based on Foata normal form. 70/272 useless extension candidates. Maximal degree in co-relation 396. Up to 149 conditions per place. [2023-08-04 04:35:25,258 INFO L140 encePairwiseOnDemand]: 265/271 looper letters, 26 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2023-08-04 04:35:25,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 191 flow [2023-08-04 04:35:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:35:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:35:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 523 transitions. [2023-08-04 04:35:25,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48247232472324725 [2023-08-04 04:35:25,260 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 523 transitions. [2023-08-04 04:35:25,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 523 transitions. [2023-08-04 04:35:25,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:35:25,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 523 transitions. [2023-08-04 04:35:25,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states 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:35:25,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states 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:35:25,264 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states 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:35:25,264 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 106 flow. Second operand 4 states and 523 transitions. [2023-08-04 04:35:25,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 191 flow [2023-08-04 04:35:25,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 38 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:35:25,265 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 115 flow [2023-08-04 04:35:25,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-04 04:35:25,266 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2023-08-04 04:35:25,266 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 115 flow [2023-08-04 04:35:25,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states 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:35:25,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:35:25,267 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:35:25,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 04:35:25,267 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:35:25,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:35:25,267 INFO L85 PathProgramCache]: Analyzing trace with hash -780641782, now seen corresponding path program 1 times [2023-08-04 04:35:25,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:35:25,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405877059] [2023-08-04 04:35:25,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:35:25,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:35:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:35:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:35:25,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:35:25,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405877059] [2023-08-04 04:35:25,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405877059] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:35:25,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434320906] [2023-08-04 04:35:25,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:35:25,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:35:25,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:35:25,610 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 04:35:25,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 04:35:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:35:25,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 48 conjunts are in the unsatisfiable core [2023-08-04 04:35:25,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:35:25,720 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 10 treesize of output 8 [2023-08-04 04:35:25,743 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 14 treesize of output 16 [2023-08-04 04:35:25,803 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 14 treesize of output 16 [2023-08-04 04:35:25,899 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-08-04 04:35:25,969 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 19 treesize of output 11 [2023-08-04 04:35:26,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:35:26,007 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:35:26,093 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_181 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#i~0#1.base|) |c_ULTIMATE.start_main_~#i~0#1.offset|) 0)) is different from false [2023-08-04 04:35:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-04 04:35:26,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434320906] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:35:26,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:35:26,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 20 [2023-08-04 04:35:26,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405659631] [2023-08-04 04:35:26,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:35:26,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-04 04:35:26,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:35:26,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-04 04:35:26,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=343, Unknown=1, NotChecked=38, Total=462 [2023-08-04 04:35:26,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 271 [2023-08-04 04:35:26,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 115 flow. Second operand has 22 states, 22 states have (on average 96.27272727272727) internal successors, (2118), 22 states have internal predecessors, (2118), 0 states have call successors, (0), 0 states 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:35:26,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:35:26,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 271 [2023-08-04 04:35:26,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:35:26,560 INFO L124 PetriNetUnfolderBase]: 90/279 cut-off events. [2023-08-04 04:35:26,560 INFO L125 PetriNetUnfolderBase]: For 233/233 co-relation queries the response was YES. [2023-08-04 04:35:26,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 279 events. 90/279 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1230 event pairs, 14 based on Foata normal form. 2/280 useless extension candidates. Maximal degree in co-relation 461. Up to 123 conditions per place. [2023-08-04 04:35:26,561 INFO L140 encePairwiseOnDemand]: 261/271 looper letters, 64 selfloop transitions, 14 changer transitions 6/89 dead transitions. [2023-08-04 04:35:26,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 89 transitions, 515 flow [2023-08-04 04:35:26,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 04:35:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 04:35:26,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1114 transitions. [2023-08-04 04:35:26,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37370010063737 [2023-08-04 04:35:26,565 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1114 transitions. [2023-08-04 04:35:26,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1114 transitions. [2023-08-04 04:35:26,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:35:26,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1114 transitions. [2023-08-04 04:35:26,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 101.27272727272727) internal successors, (1114), 11 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states 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:35:26,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 271.0) internal successors, (3252), 12 states have internal predecessors, (3252), 0 states have call successors, (0), 0 states 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:35:26,572 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 271.0) internal successors, (3252), 12 states have internal predecessors, (3252), 0 states have call successors, (0), 0 states 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:35:26,572 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 115 flow. Second operand 11 states and 1114 transitions. [2023-08-04 04:35:26,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 89 transitions, 515 flow [2023-08-04 04:35:26,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 89 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 04:35:26,575 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 204 flow [2023-08-04 04:35:26,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=204, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2023-08-04 04:35:26,576 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2023-08-04 04:35:26,576 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 204 flow [2023-08-04 04:35:26,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 96.27272727272727) internal successors, (2118), 22 states have internal predecessors, (2118), 0 states have call successors, (0), 0 states 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:35:26,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:35:26,577 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:35:26,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 04:35:26,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:35:26,783 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:35:26,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:35:26,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1981417634, now seen corresponding path program 2 times [2023-08-04 04:35:26,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:35:26,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907522788] [2023-08-04 04:35:26,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:35:26,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:35:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:35:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:35:27,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:35:27,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907522788] [2023-08-04 04:35:27,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907522788] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:35:27,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134910838] [2023-08-04 04:35:27,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:35:27,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:35:27,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:35:27,210 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 04:35:27,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 04:35:27,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 04:35:27,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:35:27,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-04 04:35:27,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:35:27,312 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 10 treesize of output 8 [2023-08-04 04:35:27,320 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 14 treesize of output 16 [2023-08-04 04:35:27,410 INFO L322 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2023-08-04 04:35:27,411 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32 [2023-08-04 04:35:27,478 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2023-08-04 04:35:27,594 INFO L322 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2023-08-04 04:35:27,594 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 44 [2023-08-04 04:35:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:35:27,622 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:35:27,674 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_248 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id~0#1.base| v_ArrVal_248))) (store .cse0 c_t_funThread1of2ForFork0_~p~0.base (let ((.cse1 (select .cse0 c_t_funThread1of2ForFork0_~p~0.base))) (store .cse1 c_t_funThread1of2ForFork0_~p~0.offset (+ (- 1) (select .cse1 c_t_funThread1of2ForFork0_~p~0.offset)))))) |c_ULTIMATE.start_main_~#i~0#1.base|) |c_ULTIMATE.start_main_~#i~0#1.offset|) 0)) is different from false [2023-08-04 04:35:27,692 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_248 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base (store (select |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base) c_t_funThread1of2ForFork0_~p~0.offset (+ |c_t_funThread1of2ForFork0_#t~mem5| 1))) |c_ULTIMATE.start_main_~#id~0#1.base| v_ArrVal_248))) (store .cse0 c_t_funThread1of2ForFork0_~p~0.base (let ((.cse1 (select .cse0 c_t_funThread1of2ForFork0_~p~0.base))) (store .cse1 c_t_funThread1of2ForFork0_~p~0.offset (+ (- 1) (select .cse1 c_t_funThread1of2ForFork0_~p~0.offset)))))) |c_ULTIMATE.start_main_~#i~0#1.base|) |c_ULTIMATE.start_main_~#i~0#1.offset|) 0)) is different from false [2023-08-04 04:35:30,075 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_248 (Array Int Int)) (t_funThread1of2ForFork0_~p~0.offset Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base (let ((.cse2 (select |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base))) (store .cse2 t_funThread1of2ForFork0_~p~0.offset (+ (select .cse2 t_funThread1of2ForFork0_~p~0.offset) 1)))) |c_ULTIMATE.start_main_~#id~0#1.base| v_ArrVal_248))) (store .cse0 c_t_funThread1of2ForFork0_~p~0.base (let ((.cse1 (select .cse0 c_t_funThread1of2ForFork0_~p~0.base))) (store .cse1 t_funThread1of2ForFork0_~p~0.offset (+ (- 1) (select .cse1 t_funThread1of2ForFork0_~p~0.offset)))))) |c_ULTIMATE.start_main_~#i~0#1.base|) |c_ULTIMATE.start_main_~#i~0#1.offset|) 0)) is different from false [2023-08-04 04:35:30,120 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_248 (Array Int Int)) (t_funThread1of2ForFork0_~p~0.offset Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_#in~arg.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of2ForFork0_#in~arg.base|))) (store .cse2 t_funThread1of2ForFork0_~p~0.offset (+ (select .cse2 t_funThread1of2ForFork0_~p~0.offset) 1)))) |c_ULTIMATE.start_main_~#id~0#1.base| v_ArrVal_248))) (store .cse0 |c_t_funThread1of2ForFork0_#in~arg.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_#in~arg.base|))) (store .cse1 t_funThread1of2ForFork0_~p~0.offset (+ (select .cse1 t_funThread1of2ForFork0_~p~0.offset) (- 1)))))) |c_ULTIMATE.start_main_~#i~0#1.base|) |c_ULTIMATE.start_main_~#i~0#1.offset|) 0)) is different from false [2023-08-04 04:35:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-08-04 04:35:30,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134910838] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:35:30,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:35:30,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-08-04 04:35:30,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804059868] [2023-08-04 04:35:30,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:35:30,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-04 04:35:30,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:35:30,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-04 04:35:30,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=250, Unknown=4, NotChecked=140, Total=462 [2023-08-04 04:35:30,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 271 [2023-08-04 04:35:30,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 204 flow. Second operand has 22 states, 22 states have (on average 95.95454545454545) internal successors, (2111), 22 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states 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:35:30,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:35:30,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 271 [2023-08-04 04:35:30,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:35:41,229 WARN L233 SmtUtils]: Spent 10.93s on a formula simplification. DAG size of input: 38 DAG size of output: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:35:44,016 INFO L124 PetriNetUnfolderBase]: 95/294 cut-off events. [2023-08-04 04:35:44,016 INFO L125 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2023-08-04 04:35:44,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 294 events. 95/294 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1318 event pairs, 9 based on Foata normal form. 1/293 useless extension candidates. Maximal degree in co-relation 795. Up to 90 conditions per place. [2023-08-04 04:35:44,018 INFO L140 encePairwiseOnDemand]: 259/271 looper letters, 52 selfloop transitions, 22 changer transitions 4/83 dead transitions. [2023-08-04 04:35:44,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 83 transitions, 566 flow [2023-08-04 04:35:44,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 04:35:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 04:35:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1102 transitions. [2023-08-04 04:35:44,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3696746058369675 [2023-08-04 04:35:44,022 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1102 transitions. [2023-08-04 04:35:44,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1102 transitions. [2023-08-04 04:35:44,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:35:44,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1102 transitions. [2023-08-04 04:35:44,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 100.18181818181819) internal successors, (1102), 11 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states 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:35:44,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 271.0) internal successors, (3252), 12 states have internal predecessors, (3252), 0 states have call successors, (0), 0 states 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:35:44,029 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 271.0) internal successors, (3252), 12 states have internal predecessors, (3252), 0 states have call successors, (0), 0 states 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:35:44,029 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 204 flow. Second operand 11 states and 1102 transitions. [2023-08-04 04:35:44,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 83 transitions, 566 flow [2023-08-04 04:35:44,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 83 transitions, 557 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-04 04:35:44,033 INFO L231 Difference]: Finished difference. Result has 72 places, 54 transitions, 345 flow [2023-08-04 04:35:44,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=345, PETRI_PLACES=72, PETRI_TRANSITIONS=54} [2023-08-04 04:35:44,034 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2023-08-04 04:35:44,034 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 345 flow [2023-08-04 04:35:44,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 95.95454545454545) internal successors, (2111), 22 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states 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:35:44,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:35:44,035 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:35:44,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 04:35:44,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:35:44,246 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:35:44,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:35:44,246 INFO L85 PathProgramCache]: Analyzing trace with hash 903109603, now seen corresponding path program 1 times [2023-08-04 04:35:44,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:35:44,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128139873] [2023-08-04 04:35:44,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:35:44,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:35:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:35:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:35:45,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:35:45,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128139873] [2023-08-04 04:35:45,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128139873] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:35:45,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436320236] [2023-08-04 04:35:45,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:35:45,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:35:45,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:35:45,168 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 04:35:45,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 04:35:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:35:45,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 48 conjunts are in the unsatisfiable core [2023-08-04 04:35:45,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:35:45,283 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 10 treesize of output 8 [2023-08-04 04:35:45,426 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 14 treesize of output 16 [2023-08-04 04:35:45,530 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 14 treesize of output 16 [2023-08-04 04:35:46,153 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-08-04 04:35:46,494 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 19 treesize of output 11 [2023-08-04 04:35:46,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:35:46,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:35:46,970 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id~0#1.base| v_ArrVal_312) |c_ULTIMATE.start_main_~#i~0#1.base|) |c_ULTIMATE.start_main_~#i~0#1.offset|) 0)) is different from false [2023-08-04 04:35:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-04 04:35:47,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436320236] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:35:47,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:35:47,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 18 [2023-08-04 04:35:47,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884398388] [2023-08-04 04:35:47,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:35:47,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-04 04:35:47,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:35:47,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-04 04:35:47,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=279, Unknown=1, NotChecked=34, Total=380 [2023-08-04 04:35:47,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 271 [2023-08-04 04:35:47,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 54 transitions, 345 flow. Second operand has 20 states, 20 states have (on average 96.6) internal successors, (1932), 20 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states 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:35:47,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:35:47,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 271 [2023-08-04 04:35:47,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:35:49,234 INFO L124 PetriNetUnfolderBase]: 95/302 cut-off events. [2023-08-04 04:35:49,235 INFO L125 PetriNetUnfolderBase]: For 824/828 co-relation queries the response was YES. [2023-08-04 04:35:49,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 302 events. 95/302 cut-off events. For 824/828 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1361 event pairs, 49 based on Foata normal form. 3/305 useless extension candidates. Maximal degree in co-relation 992. Up to 195 conditions per place. [2023-08-04 04:35:49,236 INFO L140 encePairwiseOnDemand]: 260/271 looper letters, 56 selfloop transitions, 16 changer transitions 4/81 dead transitions. [2023-08-04 04:35:49,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 652 flow [2023-08-04 04:35:49,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 04:35:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 04:35:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1091 transitions. [2023-08-04 04:35:49,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3659845689365985 [2023-08-04 04:35:49,240 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1091 transitions. [2023-08-04 04:35:49,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1091 transitions. [2023-08-04 04:35:49,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:35:49,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1091 transitions. [2023-08-04 04:35:49,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 99.18181818181819) internal successors, (1091), 11 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states 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:35:49,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 271.0) internal successors, (3252), 12 states have internal predecessors, (3252), 0 states have call successors, (0), 0 states 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:35:49,247 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 271.0) internal successors, (3252), 12 states have internal predecessors, (3252), 0 states have call successors, (0), 0 states 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:35:49,247 INFO L175 Difference]: Start difference. First operand has 72 places, 54 transitions, 345 flow. Second operand 11 states and 1091 transitions. [2023-08-04 04:35:49,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 652 flow [2023-08-04 04:35:49,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 81 transitions, 605 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-08-04 04:35:49,252 INFO L231 Difference]: Finished difference. Result has 84 places, 63 transitions, 418 flow [2023-08-04 04:35:49,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=418, PETRI_PLACES=84, PETRI_TRANSITIONS=63} [2023-08-04 04:35:49,253 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2023-08-04 04:35:49,253 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 63 transitions, 418 flow [2023-08-04 04:35:49,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 96.6) internal successors, (1932), 20 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states 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:35:49,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:35:49,254 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:35:49,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 04:35:49,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:35:49,459 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:35:49,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:35:49,460 INFO L85 PathProgramCache]: Analyzing trace with hash 429079824, now seen corresponding path program 1 times [2023-08-04 04:35:49,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:35:49,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086363517] [2023-08-04 04:35:49,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:35:49,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:35:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:35:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:35:51,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:35:51,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086363517] [2023-08-04 04:35:51,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086363517] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:35:51,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756213971] [2023-08-04 04:35:51,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:35:51,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:35:51,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:35:51,377 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 04:35:51,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-04 04:35:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:35:51,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 76 conjunts are in the unsatisfiable core [2023-08-04 04:35:51,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:35:51,487 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 10 treesize of output 8 [2023-08-04 04:35:51,649 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 14 treesize of output 16 [2023-08-04 04:35:51,957 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:35:52,545 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-08-04 04:35:53,320 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 19 treesize of output 11 [2023-08-04 04:35:54,010 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-08-04 04:35:54,480 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 19 treesize of output 11 [2023-08-04 04:35:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:35:54,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:35:56,011 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id~0#1.base| v_ArrVal_410) |c_ULTIMATE.start_main_~#i~0#1.base|) |c_ULTIMATE.start_main_~#i~0#1.offset|) 0)) is different from false [2023-08-04 04:35:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-04 04:35:56,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756213971] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:35:56,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:35:56,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 8] total 35 [2023-08-04 04:35:56,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636035444] [2023-08-04 04:35:56,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:35:56,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-04 04:35:56,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:35:56,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-04 04:35:56,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1120, Unknown=1, NotChecked=68, Total=1332 [2023-08-04 04:35:56,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 271 [2023-08-04 04:35:56,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 63 transitions, 418 flow. Second operand has 37 states, 37 states have (on average 90.13513513513513) internal successors, (3335), 37 states have internal predecessors, (3335), 0 states have call successors, (0), 0 states 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:35:56,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:35:56,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 271 [2023-08-04 04:35:56,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:36:07,420 INFO L124 PetriNetUnfolderBase]: 114/387 cut-off events. [2023-08-04 04:36:07,420 INFO L125 PetriNetUnfolderBase]: For 1040/1042 co-relation queries the response was YES. [2023-08-04 04:36:07,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 387 events. 114/387 cut-off events. For 1040/1042 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1959 event pairs, 17 based on Foata normal form. 3/389 useless extension candidates. Maximal degree in co-relation 1311. Up to 122 conditions per place. [2023-08-04 04:36:07,422 INFO L140 encePairwiseOnDemand]: 254/271 looper letters, 31 selfloop transitions, 10 changer transitions 132/178 dead transitions. [2023-08-04 04:36:07,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 178 transitions, 1437 flow [2023-08-04 04:36:07,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-08-04 04:36:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-08-04 04:36:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 4389 transitions. [2023-08-04 04:36:07,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33740774907749077 [2023-08-04 04:36:07,436 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 4389 transitions. [2023-08-04 04:36:07,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 4389 transitions. [2023-08-04 04:36:07,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:36:07,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 4389 transitions. [2023-08-04 04:36:07,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 91.4375) internal successors, (4389), 48 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states 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:36:07,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 271.0) internal successors, (13279), 49 states have internal predecessors, (13279), 0 states have call successors, (0), 0 states 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:36:07,466 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 271.0) internal successors, (13279), 49 states have internal predecessors, (13279), 0 states have call successors, (0), 0 states 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:36:07,466 INFO L175 Difference]: Start difference. First operand has 84 places, 63 transitions, 418 flow. Second operand 48 states and 4389 transitions. [2023-08-04 04:36:07,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 178 transitions, 1437 flow [2023-08-04 04:36:07,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 178 transitions, 1429 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 04:36:07,473 INFO L231 Difference]: Finished difference. Result has 153 places, 38 transitions, 300 flow [2023-08-04 04:36:07,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=300, PETRI_PLACES=153, PETRI_TRANSITIONS=38} [2023-08-04 04:36:07,474 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 109 predicate places. [2023-08-04 04:36:07,474 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 38 transitions, 300 flow [2023-08-04 04:36:07,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 90.13513513513513) internal successors, (3335), 37 states have internal predecessors, (3335), 0 states have call successors, (0), 0 states 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:36:07,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:36:07,475 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:36:07,481 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 04:36:07,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:36:07,681 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:36:07,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:36:07,681 INFO L85 PathProgramCache]: Analyzing trace with hash 678637476, now seen corresponding path program 2 times [2023-08-04 04:36:07,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:36:07,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838243853] [2023-08-04 04:36:07,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:36:07,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:36:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:36:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:36:09,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:36:09,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838243853] [2023-08-04 04:36:09,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838243853] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:36:09,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705641043] [2023-08-04 04:36:09,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:36:09,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:36:09,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:36:09,749 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 04:36:09,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 04:36:09,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 04:36:09,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:36:09,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-04 04:36:09,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:36:09,884 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 10 treesize of output 8 [2023-08-04 04:36:10,037 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 14 treesize of output 16 [2023-08-04 04:36:10,794 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-08-04 04:36:11,069 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 14 treesize of output 16 [2023-08-04 04:36:11,781 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 19 treesize of output 11 [2023-08-04 04:36:12,476 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-08-04 04:36:12,936 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 19 treesize of output 11 [2023-08-04 04:36:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:36:13,138 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:36:15,264 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base (store (select |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base) c_t_funThread1of2ForFork0_~p~0.offset (+ |c_t_funThread1of2ForFork0_#t~mem5| 1))) |c_ULTIMATE.start_main_~#id~0#1.base| v_ArrVal_513))) (store .cse0 c_t_funThread1of2ForFork0_~p~0.base (let ((.cse1 (select .cse0 c_t_funThread1of2ForFork0_~p~0.base))) (store .cse1 c_t_funThread1of2ForFork0_~p~0.offset (+ (- 1) (select .cse1 c_t_funThread1of2ForFork0_~p~0.offset)))))) |c_ULTIMATE.start_main_~#i~0#1.base|) |c_ULTIMATE.start_main_~#i~0#1.offset|) 0)) is different from false [2023-08-04 04:36:15,291 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int))) (= 0 (select (select (let ((.cse0 (store (store |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base (let ((.cse2 (select |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base))) (store .cse2 c_t_funThread1of2ForFork0_~p~0.offset (+ (select .cse2 c_t_funThread1of2ForFork0_~p~0.offset) 1)))) |c_ULTIMATE.start_main_~#id~0#1.base| v_ArrVal_513))) (store .cse0 c_t_funThread1of2ForFork0_~p~0.base (let ((.cse1 (select .cse0 c_t_funThread1of2ForFork0_~p~0.base))) (store .cse1 c_t_funThread1of2ForFork0_~p~0.offset (+ (- 1) (select .cse1 c_t_funThread1of2ForFork0_~p~0.offset)))))) |c_ULTIMATE.start_main_~#i~0#1.base|) |c_ULTIMATE.start_main_~#i~0#1.offset|))) is different from false [2023-08-04 04:36:15,360 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_#in~arg.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of2ForFork0_#in~arg.base|))) (store .cse2 |c_t_funThread1of2ForFork0_#in~arg.offset| (+ (select .cse2 |c_t_funThread1of2ForFork0_#in~arg.offset|) 1)))) |c_ULTIMATE.start_main_~#id~0#1.base| v_ArrVal_513))) (store .cse0 |c_t_funThread1of2ForFork0_#in~arg.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_#in~arg.base|))) (store .cse1 |c_t_funThread1of2ForFork0_#in~arg.offset| (+ (- 1) (select .cse1 |c_t_funThread1of2ForFork0_#in~arg.offset|)))))) |c_ULTIMATE.start_main_~#i~0#1.base|) |c_ULTIMATE.start_main_~#i~0#1.offset|) 0)) is different from false [2023-08-04 04:36:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-04 04:36:15,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705641043] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:36:15,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:36:15,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 11] total 37 [2023-08-04 04:36:15,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214602107] [2023-08-04 04:36:15,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:36:15,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-08-04 04:36:15,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:36:15,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-08-04 04:36:15,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1114, Unknown=8, NotChecked=210, Total=1482 [2023-08-04 04:36:16,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 271 [2023-08-04 04:36:16,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 38 transitions, 300 flow. Second operand has 39 states, 39 states have (on average 89.97435897435898) internal successors, (3509), 39 states have internal predecessors, (3509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:36:16,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:36:16,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 271 [2023-08-04 04:36:16,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:36:26,165 INFO L124 PetriNetUnfolderBase]: 46/162 cut-off events. [2023-08-04 04:36:26,165 INFO L125 PetriNetUnfolderBase]: For 897/897 co-relation queries the response was YES. [2023-08-04 04:36:26,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 162 events. 46/162 cut-off events. For 897/897 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 515 event pairs, 2 based on Foata normal form. 1/163 useless extension candidates. Maximal degree in co-relation 735. Up to 52 conditions per place. [2023-08-04 04:36:26,166 INFO L140 encePairwiseOnDemand]: 254/271 looper letters, 0 selfloop transitions, 0 changer transitions 63/63 dead transitions. [2023-08-04 04:36:26,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 63 transitions, 617 flow [2023-08-04 04:36:26,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-04 04:36:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-04 04:36:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1727 transitions. [2023-08-04 04:36:26,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3354049329966984 [2023-08-04 04:36:26,170 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1727 transitions. [2023-08-04 04:36:26,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1727 transitions. [2023-08-04 04:36:26,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:36:26,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1727 transitions. [2023-08-04 04:36:26,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 90.89473684210526) internal successors, (1727), 19 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states 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:36:26,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 271.0) internal successors, (5420), 20 states have internal predecessors, (5420), 0 states have call successors, (0), 0 states 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:36:26,181 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 271.0) internal successors, (5420), 20 states have internal predecessors, (5420), 0 states have call successors, (0), 0 states 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:36:26,181 INFO L175 Difference]: Start difference. First operand has 153 places, 38 transitions, 300 flow. Second operand 19 states and 1727 transitions. [2023-08-04 04:36:26,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 63 transitions, 617 flow [2023-08-04 04:36:26,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 63 transitions, 474 flow, removed 32 selfloop flow, removed 45 redundant places. [2023-08-04 04:36:26,184 INFO L231 Difference]: Finished difference. Result has 75 places, 0 transitions, 0 flow [2023-08-04 04:36:26,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=0, PETRI_PLACES=75, PETRI_TRANSITIONS=0} [2023-08-04 04:36:26,185 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places. [2023-08-04 04:36:26,185 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 0 transitions, 0 flow [2023-08-04 04:36:26,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 89.97435897435898) internal successors, (3509), 39 states have internal predecessors, (3509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:36:26,186 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 04:36:26,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 04:36:26,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-04 04:36:26,395 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2023-08-04 04:36:26,396 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 04:36:26,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 153 transitions, 324 flow [2023-08-04 04:36:26,418 INFO L124 PetriNetUnfolderBase]: 31/253 cut-off events. [2023-08-04 04:36:26,418 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 04:36:26,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 253 events. 31/253 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 757 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 157. Up to 8 conditions per place. [2023-08-04 04:36:26,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 153 transitions, 324 flow [2023-08-04 04:36:26,420 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 153 transitions, 324 flow [2023-08-04 04:36:26,420 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:36:26,420 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 153 transitions, 324 flow [2023-08-04 04:36:26,421 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 153 transitions, 324 flow [2023-08-04 04:36:26,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 153 transitions, 324 flow [2023-08-04 04:36:26,439 INFO L124 PetriNetUnfolderBase]: 31/253 cut-off events. [2023-08-04 04:36:26,440 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 04:36:26,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 253 events. 31/253 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 757 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 157. Up to 8 conditions per place. [2023-08-04 04:36:26,445 INFO L119 LiptonReduction]: Number of co-enabled transitions 8580 [2023-08-04 04:36:42,105 INFO L134 LiptonReduction]: Checked pairs total: 18834 [2023-08-04 04:36:42,106 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-04 04:36:42,107 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 04:36:42,107 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;@65af8970, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:36:42,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 04:36:42,111 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:36:42,111 INFO L124 PetriNetUnfolderBase]: 10/56 cut-off events. [2023-08-04 04:36:42,111 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 04:36:42,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:36:42,111 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 04:36:42,112 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 04:36:42,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:36:42,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1524548127, now seen corresponding path program 1 times [2023-08-04 04:36:42,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:36:42,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660068434] [2023-08-04 04:36:42,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:36:42,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:36:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:36:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:36:42,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:36:42,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660068434] [2023-08-04 04:36:42,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660068434] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:36:42,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861173959] [2023-08-04 04:36:42,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:36:42,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:36:42,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:36:42,257 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 04:36:42,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-04 04:36:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:36:42,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 04:36:42,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:36:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:36:42,585 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:36:42,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861173959] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:36:42,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 04:36:42,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 04:36:42,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221344194] [2023-08-04 04:36:42,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:36:42,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:36:42,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:36:42,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:36:42,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 04:36:42,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 269 [2023-08-04 04:36:42,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 55 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states 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:36:42,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:36:42,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 269 [2023-08-04 04:36:42,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:36:43,327 INFO L124 PetriNetUnfolderBase]: 1673/2779 cut-off events. [2023-08-04 04:36:43,327 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-08-04 04:36:43,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5576 conditions, 2779 events. 1673/2779 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 16490 event pairs, 80 based on Foata normal form. 412/2967 useless extension candidates. Maximal degree in co-relation 3998. Up to 2519 conditions per place. [2023-08-04 04:36:43,332 INFO L140 encePairwiseOnDemand]: 251/269 looper letters, 0 selfloop transitions, 0 changer transitions 70/70 dead transitions. [2023-08-04 04:36:43,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 280 flow [2023-08-04 04:36:43,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 04:36:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 04:36:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 726 transitions. [2023-08-04 04:36:43,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5397769516728624 [2023-08-04 04:36:43,334 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 726 transitions. [2023-08-04 04:36:43,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 726 transitions. [2023-08-04 04:36:43,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:36:43,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 726 transitions. [2023-08-04 04:36:43,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.2) internal successors, (726), 5 states have internal predecessors, (726), 0 states have call successors, (0), 0 states 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:36:43,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states 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:36:43,339 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states 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:36:43,339 INFO L175 Difference]: Start difference. First operand has 44 places, 55 transitions, 128 flow. Second operand 5 states and 726 transitions. [2023-08-04 04:36:43,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 280 flow [2023-08-04 04:36:43,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 04:36:43,340 INFO L231 Difference]: Finished difference. Result has 45 places, 0 transitions, 0 flow [2023-08-04 04:36:43,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=45, PETRI_TRANSITIONS=0} [2023-08-04 04:36:43,341 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2023-08-04 04:36:43,341 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 0 transitions, 0 flow [2023-08-04 04:36:43,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states 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:36:43,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-04 04:36:43,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-04 04:36:43,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 04:36:43,547 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 04:36:43,547 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE (2/2) [2023-08-04 04:36:43,547 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 04:36:43,547 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 04:36:43,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 04:36:43 BasicIcfg [2023-08-04 04:36:43,552 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 04:36:43,552 INFO L158 Benchmark]: Toolchain (without parser) took 91642.23ms. Allocated memory was 532.7MB in the beginning and 639.6MB in the end (delta: 107.0MB). Free memory was 482.6MB in the beginning and 583.1MB in the end (delta: -100.6MB). Peak memory consumption was 367.5MB. Max. memory is 16.0GB. [2023-08-04 04:36:43,553 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 343.9MB. Free memory was 296.3MB in the beginning and 296.1MB in the end (delta: 162.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 04:36:43,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.95ms. Allocated memory is still 532.7MB. Free memory was 482.2MB in the beginning and 462.4MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-04 04:36:43,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.70ms. Allocated memory is still 532.7MB. Free memory was 462.4MB in the beginning and 460.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 04:36:43,553 INFO L158 Benchmark]: Boogie Preprocessor took 31.28ms. Allocated memory is still 532.7MB. Free memory was 460.3MB in the beginning and 458.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 04:36:43,553 INFO L158 Benchmark]: RCFGBuilder took 454.79ms. Allocated memory is still 532.7MB. Free memory was 458.5MB in the beginning and 497.0MB in the end (delta: -38.5MB). Peak memory consumption was 18.0MB. Max. memory is 16.0GB. [2023-08-04 04:36:43,554 INFO L158 Benchmark]: TraceAbstraction took 90660.11ms. Allocated memory was 532.7MB in the beginning and 639.6MB in the end (delta: 107.0MB). Free memory was 495.9MB in the beginning and 583.1MB in the end (delta: -87.2MB). Peak memory consumption was 378.8MB. Max. memory is 16.0GB. [2023-08-04 04:36:43,555 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 343.9MB. Free memory was 296.3MB in the beginning and 296.1MB in the end (delta: 162.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 452.95ms. Allocated memory is still 532.7MB. Free memory was 482.2MB in the beginning and 462.4MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 37.70ms. Allocated memory is still 532.7MB. Free memory was 462.4MB in the beginning and 460.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.28ms. Allocated memory is still 532.7MB. Free memory was 460.3MB in the beginning and 458.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 454.79ms. Allocated memory is still 532.7MB. Free memory was 458.5MB in the beginning and 497.0MB in the end (delta: -38.5MB). Peak memory consumption was 18.0MB. Max. memory is 16.0GB. * TraceAbstraction took 90660.11ms. Allocated memory was 532.7MB in the beginning and 639.6MB in the end (delta: 107.0MB). Free memory was 495.9MB in the beginning and 583.1MB in the end (delta: -87.2MB). Peak memory consumption was 378.8MB. 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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 105 PlacesBefore, 27 PlacesAfterwards, 113 TransitionsBefore, 32 TransitionsAfterwards, 2838 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 96 TotalNumberOfCompositions, 4947 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2831, independent: 2668, independent conditional: 0, independent unconditional: 2668, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1553, independent: 1517, independent conditional: 0, independent unconditional: 1517, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2831, independent: 1151, independent conditional: 0, independent unconditional: 1151, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 1553, unknown conditional: 0, unknown unconditional: 1553] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 105 PlacesBefore, 27 PlacesAfterwards, 113 TransitionsBefore, 32 TransitionsAfterwards, 2838 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 96 TotalNumberOfCompositions, 5376 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2897, independent: 2706, independent conditional: 0, independent unconditional: 2706, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1537, independent: 1503, independent conditional: 0, independent unconditional: 1503, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2897, independent: 1203, independent conditional: 0, independent unconditional: 1203, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 1537, unknown conditional: 0, unknown unconditional: 1537] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 139 PlacesBefore, 44 PlacesAfterwards, 153 TransitionsBefore, 55 TransitionsAfterwards, 8580 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 3 ChoiceCompositions, 118 TotalNumberOfCompositions, 17140 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7634, independent: 7358, independent conditional: 0, independent unconditional: 7358, dependent: 276, dependent conditional: 0, dependent unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4216, independent: 4147, independent conditional: 0, independent unconditional: 4147, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7634, independent: 3211, independent conditional: 0, independent unconditional: 3211, dependent: 207, dependent conditional: 0, dependent unconditional: 207, unknown: 4216, unknown conditional: 0, unknown unconditional: 4216] , Statistics on independence cache: Total cache size (in pairs): 231, Positive cache size: 204, Positive conditional cache size: 0, Positive unconditional cache size: 204, 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: 15.7s, 139 PlacesBefore, 44 PlacesAfterwards, 153 TransitionsBefore, 55 TransitionsAfterwards, 8580 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 3 ChoiceCompositions, 116 TotalNumberOfCompositions, 18834 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8187, independent: 7862, independent conditional: 0, independent unconditional: 7862, dependent: 325, dependent conditional: 0, dependent unconditional: 325, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4234, independent: 4173, independent conditional: 0, independent unconditional: 4173, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8187, independent: 3689, independent conditional: 0, independent unconditional: 3689, dependent: 264, dependent conditional: 0, dependent unconditional: 264, unknown: 4234, unknown conditional: 0, unknown unconditional: 4234] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 220, Positive conditional cache size: 0, Positive unconditional cache size: 220, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 691]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 135 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 88 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 7 mSDtfsCounter, 88 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 47 SizeOfPredicates, 0 NumberOfNonLiveVariables, 132 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 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, 163 locations, 2 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: 66.1s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 39.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 849 SdHoareTripleChecker+Valid, 14.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 744 mSDsluCounter, 241 SdHoareTripleChecker+Invalid, 14.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 861 IncrementalHoareTripleChecker+Unchecked, 240 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4809 IncrementalHoareTripleChecker+Invalid, 5789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 1 mSDtfsCounter, 4809 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 433 GetRequests, 219 SyntacticMatches, 19 SemanticMatches, 195 ConstructedPredicates, 10 IntricatePredicates, 3 DeprecatedPredicates, 2265 ImplicationChecksByTransitivity, 37.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=418occurred in iteration=7, InterpolantAutomatonStates: 114, 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.3s SatisfiabilityAnalysisTime, 21.2s InterpolantComputationTime, 335 NumberOfCodeBlocks, 335 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 469 ConstructedInterpolants, 40 QuantifiedInterpolants, 6996 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1466 ConjunctsInSsa, 303 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 18/117 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, 135 locations, 2 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.0s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 163 locations, 2 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: 17.2s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 119 IncrementalHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 0 mSDtfsCounter, 119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=0, InterpolantAutomatonStates: 5, 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.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 56 SizeOfPredicates, 0 NumberOfNonLiveVariables, 140 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 11/16 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-08-04 04:36:43,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...