/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/pthread-lit_qw2004-2b_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:24:32,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:24:32,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:24:32,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:24:32,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:24:32,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:24:32,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:24:32,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:24:32,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:24:32,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:24:32,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:24:32,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:24:32,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:24:32,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:24:32,142 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:24:32,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:24:32,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:24:32,142 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:24:32,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:24:32,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:24:32,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:24:32,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:24:32,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:24:32,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:24:32,145 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:24:32,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:24:32,145 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:24:32,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:24:32,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:24:32,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:24:32,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:24:32,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:24:32,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:24:32,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:24:32,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:24:32,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:24:32,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:24:32,149 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:24:32,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:24:32,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:24:32,149 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:24:32,149 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 05:24:32,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:24:32,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:24:32,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:24:32,407 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:24:32,407 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:24:32,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-lit_qw2004-2b_bound2.i [2023-08-04 05:24:33,538 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:24:33,810 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:24:33,810 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-lit_qw2004-2b_bound2.i [2023-08-04 05:24:33,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a88e0549/b2de4b1dc63940099292d3d46d9c5cbe/FLAG49e556f04 [2023-08-04 05:24:33,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a88e0549/b2de4b1dc63940099292d3d46d9c5cbe [2023-08-04 05:24:33,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:24:33,849 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:24:33,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:24:33,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:24:33,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:24:33,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:24:33" (1/1) ... [2023-08-04 05:24:33,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a953ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:24:33, skipping insertion in model container [2023-08-04 05:24:33,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:24:33" (1/1) ... [2023-08-04 05:24:33,904 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:24:34,187 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-lit_qw2004-2b_bound2.i[30003,30016] [2023-08-04 05:24:34,204 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:24:34,211 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:24:34,236 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [237] [2023-08-04 05:24:34,237 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [237] [2023-08-04 05:24:34,256 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-lit_qw2004-2b_bound2.i[30003,30016] [2023-08-04 05:24:34,263 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:24:34,286 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:24:34,287 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:24:34,293 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:24:34,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:24:34 WrapperNode [2023-08-04 05:24:34,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:24:34,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:24:34,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:24:34,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:24:34,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:24:34" (1/1) ... [2023-08-04 05:24:34,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:24:34" (1/1) ... [2023-08-04 05:24:34,354 INFO L138 Inliner]: procedures = 175, calls = 36, calls flagged for inlining = 9, calls inlined = 10, statements flattened = 125 [2023-08-04 05:24:34,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:24:34,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:24:34,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:24:34,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:24:34,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:24:34" (1/1) ... [2023-08-04 05:24:34,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:24:34" (1/1) ... [2023-08-04 05:24:34,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:24:34" (1/1) ... [2023-08-04 05:24:34,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:24:34" (1/1) ... [2023-08-04 05:24:34,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:24:34" (1/1) ... [2023-08-04 05:24:34,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:24:34" (1/1) ... [2023-08-04 05:24:34,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:24:34" (1/1) ... [2023-08-04 05:24:34,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:24:34" (1/1) ... [2023-08-04 05:24:34,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:24:34,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:24:34,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:24:34,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:24:34,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:24:34" (1/1) ... [2023-08-04 05:24:34,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:24:34,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:24:34,408 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 05:24:34,418 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 05:24:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2023-08-04 05:24:34,440 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2023-08-04 05:24:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:24:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:24:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:24:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:24:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:24:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:24:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:24:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:24:34,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:24:34,443 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 05:24:34,551 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:24:34,553 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:24:34,764 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:24:34,785 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:24:34,785 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-04 05:24:34,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:24:34 BoogieIcfgContainer [2023-08-04 05:24:34,788 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:24:34,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:24:34,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:24:34,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:24:34,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:24:33" (1/3) ... [2023-08-04 05:24:34,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b765f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:24:34, skipping insertion in model container [2023-08-04 05:24:34,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:24:34" (2/3) ... [2023-08-04 05:24:34,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b765f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:24:34, skipping insertion in model container [2023-08-04 05:24:34,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:24:34" (3/3) ... [2023-08-04 05:24:34,814 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-lit_qw2004-2b_bound2.i [2023-08-04 05:24:34,820 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:24:34,830 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:24:34,831 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 05:24:34,831 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:24:34,868 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:24:34,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 110 transitions, 225 flow [2023-08-04 05:24:34,973 INFO L124 PetriNetUnfolderBase]: 12/167 cut-off events. [2023-08-04 05:24:34,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:24:34,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 167 events. 12/167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 357 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 89. Up to 4 conditions per place. [2023-08-04 05:24:34,980 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 110 transitions, 225 flow [2023-08-04 05:24:34,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 110 transitions, 225 flow [2023-08-04 05:24:34,986 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:24:34,994 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 110 transitions, 225 flow [2023-08-04 05:24:34,997 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 110 transitions, 225 flow [2023-08-04 05:24:34,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 110 transitions, 225 flow [2023-08-04 05:24:35,029 INFO L124 PetriNetUnfolderBase]: 12/167 cut-off events. [2023-08-04 05:24:35,029 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:24:35,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 167 events. 12/167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 357 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 89. Up to 4 conditions per place. [2023-08-04 05:24:35,033 INFO L119 LiptonReduction]: Number of co-enabled transitions 3402 [2023-08-04 05:24:37,503 INFO L134 LiptonReduction]: Checked pairs total: 4257 [2023-08-04 05:24:37,504 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-08-04 05:24:37,522 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:24:37,527 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;@1a0398dc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:24:37,528 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 05:24:37,530 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:24:37,530 INFO L124 PetriNetUnfolderBase]: 1/7 cut-off events. [2023-08-04 05:24:37,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:24:37,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:24:37,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-04 05:24:37,532 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:24:37,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:24:37,540 INFO L85 PathProgramCache]: Analyzing trace with hash 443644, now seen corresponding path program 1 times [2023-08-04 05:24:37,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:24:37,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933499333] [2023-08-04 05:24:37,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:24:37,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:24:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:24:37,758 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 05:24:37,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:24:37,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933499333] [2023-08-04 05:24:37,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933499333] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:24:37,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:24:37,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:24:37,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522077870] [2023-08-04 05:24:37,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:24:37,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:24:37,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:24:37,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:24:37,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:24:37,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 232 [2023-08-04 05:24:37,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 21 transitions, 47 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:37,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:24:37,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 232 [2023-08-04 05:24:37,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:24:37,900 INFO L124 PetriNetUnfolderBase]: 107/223 cut-off events. [2023-08-04 05:24:37,900 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:24:37,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 223 events. 107/223 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 894 event pairs, 25 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 415. Up to 118 conditions per place. [2023-08-04 05:24:37,908 INFO L140 encePairwiseOnDemand]: 228/232 looper letters, 22 selfloop transitions, 3 changer transitions 10/36 dead transitions. [2023-08-04 05:24:37,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 36 transitions, 145 flow [2023-08-04 05:24:37,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:24:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:24:37,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-08-04 05:24:37,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4813218390804598 [2023-08-04 05:24:37,931 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-08-04 05:24:37,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-08-04 05:24:37,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:24:37,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-08-04 05:24:37,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:37,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:37,942 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:37,943 INFO L175 Difference]: Start difference. First operand has 21 places, 21 transitions, 47 flow. Second operand 3 states and 335 transitions. [2023-08-04 05:24:37,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 36 transitions, 145 flow [2023-08-04 05:24:37,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 36 transitions, 145 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:24:37,947 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 53 flow [2023-08-04 05:24:37,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-08-04 05:24:37,952 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2023-08-04 05:24:37,952 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 53 flow [2023-08-04 05:24:37,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:37,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:24:37,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 05:24:37,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 05:24:37,954 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:24:37,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:24:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash 426095747, now seen corresponding path program 1 times [2023-08-04 05:24:37,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:24:37,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028128337] [2023-08-04 05:24:37,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:24:37,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:24:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:24:38,052 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 05:24:38,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:24:38,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028128337] [2023-08-04 05:24:38,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028128337] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:24:38,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:24:38,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:24:38,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682857553] [2023-08-04 05:24:38,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:24:38,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:24:38,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:24:38,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:24:38,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:24:38,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 232 [2023-08-04 05:24:38,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:38,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:24:38,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 232 [2023-08-04 05:24:38,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:24:38,126 INFO L124 PetriNetUnfolderBase]: 54/123 cut-off events. [2023-08-04 05:24:38,126 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-04 05:24:38,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 123 events. 54/123 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 0 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 264. Up to 107 conditions per place. [2023-08-04 05:24:38,127 INFO L140 encePairwiseOnDemand]: 229/232 looper letters, 21 selfloop transitions, 2 changer transitions 1/25 dead transitions. [2023-08-04 05:24:38,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 25 transitions, 121 flow [2023-08-04 05:24:38,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:24:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:24:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-04 05:24:38,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46120689655172414 [2023-08-04 05:24:38,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-04 05:24:38,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-04 05:24:38,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:24:38,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-04 05:24:38,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:38,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:38,137 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:38,137 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 53 flow. Second operand 3 states and 321 transitions. [2023-08-04 05:24:38,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 25 transitions, 121 flow [2023-08-04 05:24:38,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 25 transitions, 113 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:24:38,139 INFO L231 Difference]: Finished difference. Result has 22 places, 17 transitions, 55 flow [2023-08-04 05:24:38,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=22, PETRI_TRANSITIONS=17} [2023-08-04 05:24:38,140 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2023-08-04 05:24:38,140 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 55 flow [2023-08-04 05:24:38,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:38,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:24:38,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:24:38,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 05:24:38,141 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:24:38,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:24:38,142 INFO L85 PathProgramCache]: Analyzing trace with hash 573596591, now seen corresponding path program 1 times [2023-08-04 05:24:38,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:24:38,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089834105] [2023-08-04 05:24:38,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:24:38,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:24:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:24:38,234 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 05:24:38,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:24:38,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089834105] [2023-08-04 05:24:38,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089834105] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:24:38,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735807103] [2023-08-04 05:24:38,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:24:38,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:24:38,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:24:38,249 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 05:24:38,271 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 05:24:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:24:38,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:24:38,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:24:38,402 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 05:24:38,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:24:38,422 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 05:24:38,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735807103] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:24:38,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:24:38,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:24:38,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635631827] [2023-08-04 05:24:38,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:24:38,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:24:38,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:24:38,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:24:38,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:24:38,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-08-04 05:24:38,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 55 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:38,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:24:38,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-08-04 05:24:38,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:24:38,482 INFO L124 PetriNetUnfolderBase]: 15/38 cut-off events. [2023-08-04 05:24:38,482 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 05:24:38,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 38 events. 15/38 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 0 based on Foata normal form. 7/42 useless extension candidates. Maximal degree in co-relation 87. Up to 28 conditions per place. [2023-08-04 05:24:38,483 INFO L140 encePairwiseOnDemand]: 228/232 looper letters, 0 selfloop transitions, 0 changer transitions 19/19 dead transitions. [2023-08-04 05:24:38,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 19 transitions, 91 flow [2023-08-04 05:24:38,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:24:38,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:24:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 413 transitions. [2023-08-04 05:24:38,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44504310344827586 [2023-08-04 05:24:38,485 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 413 transitions. [2023-08-04 05:24:38,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 413 transitions. [2023-08-04 05:24:38,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:24:38,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 413 transitions. [2023-08-04 05:24:38,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:38,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:38,490 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:38,490 INFO L175 Difference]: Start difference. First operand has 22 places, 17 transitions, 55 flow. Second operand 4 states and 413 transitions. [2023-08-04 05:24:38,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 19 transitions, 91 flow [2023-08-04 05:24:38,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 19 transitions, 79 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-04 05:24:38,492 INFO L231 Difference]: Finished difference. Result has 16 places, 0 transitions, 0 flow [2023-08-04 05:24:38,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=25, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=16, PETRI_TRANSITIONS=0} [2023-08-04 05:24:38,494 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, -5 predicate places. [2023-08-04 05:24:38,495 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 0 transitions, 0 flow [2023-08-04 05:24:38,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:38,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 05:24:38,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 05:24:38,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:24:38,705 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 05:24:38,707 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 05:24:38,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 110 transitions, 225 flow [2023-08-04 05:24:38,739 INFO L124 PetriNetUnfolderBase]: 12/167 cut-off events. [2023-08-04 05:24:38,739 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:24:38,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 167 events. 12/167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 357 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 89. Up to 4 conditions per place. [2023-08-04 05:24:38,740 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 110 transitions, 225 flow [2023-08-04 05:24:38,742 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 110 transitions, 225 flow [2023-08-04 05:24:38,742 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:24:38,742 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 110 transitions, 225 flow [2023-08-04 05:24:38,742 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 110 transitions, 225 flow [2023-08-04 05:24:38,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 110 transitions, 225 flow [2023-08-04 05:24:38,757 INFO L124 PetriNetUnfolderBase]: 12/167 cut-off events. [2023-08-04 05:24:38,757 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:24:38,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 167 events. 12/167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 357 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 89. Up to 4 conditions per place. [2023-08-04 05:24:38,760 INFO L119 LiptonReduction]: Number of co-enabled transitions 3402 [2023-08-04 05:24:40,864 INFO L134 LiptonReduction]: Checked pairs total: 4167 [2023-08-04 05:24:40,865 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-08-04 05:24:40,866 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 05:24:40,867 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;@1a0398dc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:24:40,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 05:24:40,870 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:24:40,870 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2023-08-04 05:24:40,870 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:24:40,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:24:40,870 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 05:24:40,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 05:24:40,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:24:40,871 INFO L85 PathProgramCache]: Analyzing trace with hash -475986832, now seen corresponding path program 1 times [2023-08-04 05:24:40,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:24:40,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860164218] [2023-08-04 05:24:40,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:24:40,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:24:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:24:40,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:24:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:24:40,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:24:40,904 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:24:40,904 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-04 05:24:40,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 05:24:40,904 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 05:24:40,905 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-04 05:24:40,905 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 05:24:40,905 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 05:24:40,920 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:24:40,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 138 transitions, 288 flow [2023-08-04 05:24:40,940 INFO L124 PetriNetUnfolderBase]: 19/257 cut-off events. [2023-08-04 05:24:40,940 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-04 05:24:40,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 257 events. 19/257 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 790 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 168. Up to 6 conditions per place. [2023-08-04 05:24:40,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 138 transitions, 288 flow [2023-08-04 05:24:40,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 138 transitions, 288 flow [2023-08-04 05:24:40,943 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:24:40,943 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 138 transitions, 288 flow [2023-08-04 05:24:40,943 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 138 transitions, 288 flow [2023-08-04 05:24:40,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 138 transitions, 288 flow [2023-08-04 05:24:40,961 INFO L124 PetriNetUnfolderBase]: 19/257 cut-off events. [2023-08-04 05:24:40,962 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-04 05:24:40,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 257 events. 19/257 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 790 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 168. Up to 6 conditions per place. [2023-08-04 05:24:40,967 INFO L119 LiptonReduction]: Number of co-enabled transitions 8316 [2023-08-04 05:24:43,097 INFO L134 LiptonReduction]: Checked pairs total: 9899 [2023-08-04 05:24:43,097 INFO L136 LiptonReduction]: Total number of compositions: 140 [2023-08-04 05:24:43,099 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:24:43,100 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;@1a0398dc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:24:43,100 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 05:24:43,101 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:24:43,101 INFO L124 PetriNetUnfolderBase]: 1/7 cut-off events. [2023-08-04 05:24:43,101 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:24:43,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:24:43,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-04 05:24:43,101 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:24:43,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:24:43,102 INFO L85 PathProgramCache]: Analyzing trace with hash 868822, now seen corresponding path program 1 times [2023-08-04 05:24:43,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:24:43,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281031495] [2023-08-04 05:24:43,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:24:43,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:24:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:24:43,123 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 05:24:43,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:24:43,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281031495] [2023-08-04 05:24:43,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281031495] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:24:43,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:24:43,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:24:43,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996667083] [2023-08-04 05:24:43,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:24:43,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:24:43,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:24:43,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:24:43,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:24:43,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 278 [2023-08-04 05:24:43,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:43,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:24:43,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 278 [2023-08-04 05:24:43,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:24:43,241 INFO L124 PetriNetUnfolderBase]: 769/1216 cut-off events. [2023-08-04 05:24:43,241 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-04 05:24:43,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2443 conditions, 1216 events. 769/1216 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5016 event pairs, 270 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 474. Up to 1183 conditions per place. [2023-08-04 05:24:43,245 INFO L140 encePairwiseOnDemand]: 274/278 looper letters, 26 selfloop transitions, 2 changer transitions 6/36 dead transitions. [2023-08-04 05:24:43,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 36 transitions, 150 flow [2023-08-04 05:24:43,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:24:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:24:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-04 05:24:43,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880095923261391 [2023-08-04 05:24:43,247 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-04 05:24:43,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-04 05:24:43,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:24:43,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-04 05:24:43,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:43,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:43,251 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:43,251 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 68 flow. Second operand 3 states and 407 transitions. [2023-08-04 05:24:43,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 36 transitions, 150 flow [2023-08-04 05:24:43,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 148 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 05:24:43,252 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 66 flow [2023-08-04 05:24:43,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-08-04 05:24:43,255 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-08-04 05:24:43,255 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 66 flow [2023-08-04 05:24:43,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:43,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:24:43,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:24:43,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 05:24:43,256 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:24:43,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:24:43,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2075986288, now seen corresponding path program 1 times [2023-08-04 05:24:43,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:24:43,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626486274] [2023-08-04 05:24:43,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:24:43,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:24:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:24:43,315 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 05:24:43,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:24:43,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626486274] [2023-08-04 05:24:43,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626486274] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:24:43,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843192287] [2023-08-04 05:24:43,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:24:43,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:24:43,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:24:43,321 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 05:24:43,345 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 05:24:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:24:43,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:24:43,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:24:43,393 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 05:24:43,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:24:43,412 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 05:24:43,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843192287] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:24:43,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:24:43,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-04 05:24:43,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992982019] [2023-08-04 05:24:43,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:24:43,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 05:24:43,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:24:43,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 05:24:43,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 05:24:43,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 278 [2023-08-04 05:24:43,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:43,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:24:43,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 278 [2023-08-04 05:24:43,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:24:43,516 INFO L124 PetriNetUnfolderBase]: 415/694 cut-off events. [2023-08-04 05:24:43,517 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-08-04 05:24:43,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 694 events. 415/694 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2871 event pairs, 30 based on Foata normal form. 6/624 useless extension candidates. Maximal degree in co-relation 316. Up to 445 conditions per place. [2023-08-04 05:24:43,521 INFO L140 encePairwiseOnDemand]: 273/278 looper letters, 36 selfloop transitions, 3 changer transitions 1/42 dead transitions. [2023-08-04 05:24:43,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 42 transitions, 184 flow [2023-08-04 05:24:43,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:24:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:24:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-04 05:24:43,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4802158273381295 [2023-08-04 05:24:43,523 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-04 05:24:43,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-04 05:24:43,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:24:43,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-04 05:24:43,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:43,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:43,528 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:43,528 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 66 flow. Second operand 4 states and 534 transitions. [2023-08-04 05:24:43,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 42 transitions, 184 flow [2023-08-04 05:24:43,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 42 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:24:43,531 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 80 flow [2023-08-04 05:24:43,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2023-08-04 05:24:43,532 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2023-08-04 05:24:43,532 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 80 flow [2023-08-04 05:24:43,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:43,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:24:43,533 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2023-08-04 05:24:43,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 05:24:43,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-04 05:24:43,743 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:24:43,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:24:43,744 INFO L85 PathProgramCache]: Analyzing trace with hash -657861173, now seen corresponding path program 1 times [2023-08-04 05:24:43,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:24:43,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711627621] [2023-08-04 05:24:43,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:24:43,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:24:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:24:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:24:43,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:24:43,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711627621] [2023-08-04 05:24:43,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711627621] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:24:43,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:24:43,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:24:43,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347765753] [2023-08-04 05:24:43,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:24:43,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:24:43,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:24:43,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:24:43,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:24:43,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 278 [2023-08-04 05:24:43,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:43,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:24:43,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 278 [2023-08-04 05:24:43,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:24:43,868 INFO L124 PetriNetUnfolderBase]: 379/639 cut-off events. [2023-08-04 05:24:43,868 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2023-08-04 05:24:43,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1555 conditions, 639 events. 379/639 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2616 event pairs, 280 based on Foata normal form. 36/593 useless extension candidates. Maximal degree in co-relation 403. Up to 514 conditions per place. [2023-08-04 05:24:43,871 INFO L140 encePairwiseOnDemand]: 276/278 looper letters, 20 selfloop transitions, 0 changer transitions 12/34 dead transitions. [2023-08-04 05:24:43,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 166 flow [2023-08-04 05:24:43,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:24:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:24:43,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-08-04 05:24:43,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48081534772182255 [2023-08-04 05:24:43,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-08-04 05:24:43,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-08-04 05:24:43,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:24:43,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-08-04 05:24:43,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:43,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:43,876 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:43,876 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 80 flow. Second operand 3 states and 401 transitions. [2023-08-04 05:24:43,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 166 flow [2023-08-04 05:24:43,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 159 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 05:24:43,878 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 69 flow [2023-08-04 05:24:43,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-08-04 05:24:43,879 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2023-08-04 05:24:43,879 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 69 flow [2023-08-04 05:24:43,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:43,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:24:43,879 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:24:43,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 05:24:43,879 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:24:43,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:24:43,880 INFO L85 PathProgramCache]: Analyzing trace with hash -844870513, now seen corresponding path program 1 times [2023-08-04 05:24:43,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:24:43,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955446088] [2023-08-04 05:24:43,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:24:43,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:24:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:24:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:24:43,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:24:43,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955446088] [2023-08-04 05:24:43,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955446088] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:24:43,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:24:43,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:24:43,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515161063] [2023-08-04 05:24:43,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:24:43,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:24:43,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:24:43,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:24:43,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:24:43,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 278 [2023-08-04 05:24:43,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:43,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:24:43,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 278 [2023-08-04 05:24:43,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:24:43,997 INFO L124 PetriNetUnfolderBase]: 258/454 cut-off events. [2023-08-04 05:24:43,997 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2023-08-04 05:24:43,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 454 events. 258/454 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1815 event pairs, 149 based on Foata normal form. 25/445 useless extension candidates. Maximal degree in co-relation 1047. Up to 288 conditions per place. [2023-08-04 05:24:43,999 INFO L140 encePairwiseOnDemand]: 274/278 looper letters, 34 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2023-08-04 05:24:44,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 194 flow [2023-08-04 05:24:44,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:24:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:24:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-04 05:24:44,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4892086330935252 [2023-08-04 05:24:44,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-04 05:24:44,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-04 05:24:44,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:24:44,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-04 05:24:44,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:44,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:44,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:44,005 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 69 flow. Second operand 3 states and 408 transitions. [2023-08-04 05:24:44,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 194 flow [2023-08-04 05:24:44,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 192 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 05:24:44,006 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 86 flow [2023-08-04 05:24:44,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2023-08-04 05:24:44,007 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-08-04 05:24:44,007 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 86 flow [2023-08-04 05:24:44,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:44,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:24:44,007 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:24:44,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 05:24:44,008 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:24:44,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:24:44,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1812831092, now seen corresponding path program 1 times [2023-08-04 05:24:44,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:24:44,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365495805] [2023-08-04 05:24:44,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:24:44,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:24:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:24:44,058 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 05:24:44,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:24:44,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365495805] [2023-08-04 05:24:44,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365495805] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:24:44,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:24:44,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 05:24:44,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855678698] [2023-08-04 05:24:44,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:24:44,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:24:44,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:24:44,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:24:44,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:24:44,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 278 [2023-08-04 05:24:44,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 86 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 05:24:44,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:24:44,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 278 [2023-08-04 05:24:44,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:24:44,118 INFO L124 PetriNetUnfolderBase]: 223/401 cut-off events. [2023-08-04 05:24:44,119 INFO L125 PetriNetUnfolderBase]: For 261/261 co-relation queries the response was YES. [2023-08-04 05:24:44,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 401 events. 223/401 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1652 event pairs, 84 based on Foata normal form. 35/407 useless extension candidates. Maximal degree in co-relation 986. Up to 389 conditions per place. [2023-08-04 05:24:44,120 INFO L140 encePairwiseOnDemand]: 275/278 looper letters, 23 selfloop transitions, 2 changer transitions 4/31 dead transitions. [2023-08-04 05:24:44,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 171 flow [2023-08-04 05:24:44,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:24:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:24:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-04 05:24:44,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47721822541966424 [2023-08-04 05:24:44,122 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-04 05:24:44,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-04 05:24:44,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:24:44,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-04 05:24:44,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:44,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:44,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:44,125 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 86 flow. Second operand 3 states and 398 transitions. [2023-08-04 05:24:44,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 171 flow [2023-08-04 05:24:44,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:24:44,129 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 101 flow [2023-08-04 05:24:44,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-04 05:24:44,130 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2023-08-04 05:24:44,130 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 101 flow [2023-08-04 05:24:44,130 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 05:24:44,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:24:44,130 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:24:44,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 05:24:44,131 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:24:44,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:24:44,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1821993026, now seen corresponding path program 2 times [2023-08-04 05:24:44,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:24:44,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152123193] [2023-08-04 05:24:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:24:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:24:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:24:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:24:44,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:24:44,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152123193] [2023-08-04 05:24:44,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152123193] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:24:44,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:24:44,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 05:24:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349242834] [2023-08-04 05:24:44,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:24:44,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 05:24:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:24:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 05:24:44,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 05:24:44,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 278 [2023-08-04 05:24:44,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:44,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:24:44,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 278 [2023-08-04 05:24:44,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:24:44,286 INFO L124 PetriNetUnfolderBase]: 231/439 cut-off events. [2023-08-04 05:24:44,286 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2023-08-04 05:24:44,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 439 events. 231/439 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2057 event pairs, 45 based on Foata normal form. 28/437 useless extension candidates. Maximal degree in co-relation 1103. Up to 299 conditions per place. [2023-08-04 05:24:44,288 INFO L140 encePairwiseOnDemand]: 273/278 looper letters, 35 selfloop transitions, 5 changer transitions 9/51 dead transitions. [2023-08-04 05:24:44,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 288 flow [2023-08-04 05:24:44,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 05:24:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 05:24:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-08-04 05:24:44,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47050359712230216 [2023-08-04 05:24:44,291 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-08-04 05:24:44,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-08-04 05:24:44,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:24:44,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-08-04 05:24:44,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:44,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:44,295 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:44,295 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 101 flow. Second operand 5 states and 654 transitions. [2023-08-04 05:24:44,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 288 flow [2023-08-04 05:24:44,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 286 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:24:44,298 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 136 flow [2023-08-04 05:24:44,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-08-04 05:24:44,299 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2023-08-04 05:24:44,299 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 136 flow [2023-08-04 05:24:44,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:44,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:24:44,300 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:24:44,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 05:24:44,300 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:24:44,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:24:44,301 INFO L85 PathProgramCache]: Analyzing trace with hash -647508371, now seen corresponding path program 1 times [2023-08-04 05:24:44,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:24:44,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216109889] [2023-08-04 05:24:44,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:24:44,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:24:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:24:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:24:44,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:24:44,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216109889] [2023-08-04 05:24:44,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216109889] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:24:44,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:24:44,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 05:24:44,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172844790] [2023-08-04 05:24:44,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:24:44,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 05:24:44,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:24:44,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 05:24:44,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-04 05:24:44,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 278 [2023-08-04 05:24:44,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:44,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:24:44,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 278 [2023-08-04 05:24:44,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:24:44,601 INFO L124 PetriNetUnfolderBase]: 461/907 cut-off events. [2023-08-04 05:24:44,601 INFO L125 PetriNetUnfolderBase]: For 645/645 co-relation queries the response was YES. [2023-08-04 05:24:44,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2623 conditions, 907 events. 461/907 cut-off events. For 645/645 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4809 event pairs, 138 based on Foata normal form. 4/880 useless extension candidates. Maximal degree in co-relation 2611. Up to 495 conditions per place. [2023-08-04 05:24:44,606 INFO L140 encePairwiseOnDemand]: 272/278 looper letters, 105 selfloop transitions, 11 changer transitions 4/121 dead transitions. [2023-08-04 05:24:44,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 121 transitions, 767 flow [2023-08-04 05:24:44,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 05:24:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 05:24:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1034 transitions. [2023-08-04 05:24:44,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46492805755395683 [2023-08-04 05:24:44,610 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1034 transitions. [2023-08-04 05:24:44,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1034 transitions. [2023-08-04 05:24:44,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:24:44,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1034 transitions. [2023-08-04 05:24:44,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.25) internal successors, (1034), 8 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:44,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 278.0) internal successors, (2502), 9 states have internal predecessors, (2502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:44,616 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 278.0) internal successors, (2502), 9 states have internal predecessors, (2502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:44,616 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 136 flow. Second operand 8 states and 1034 transitions. [2023-08-04 05:24:44,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 121 transitions, 767 flow [2023-08-04 05:24:44,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 121 transitions, 767 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:24:44,622 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 209 flow [2023-08-04 05:24:44,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=209, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-08-04 05:24:44,623 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2023-08-04 05:24:44,623 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 209 flow [2023-08-04 05:24:44,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:24:44,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:24:44,624 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:24:44,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 05:24:44,624 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:24:44,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:24:44,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1737206501, now seen corresponding path program 2 times [2023-08-04 05:24:44,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:24:44,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779561966] [2023-08-04 05:24:44,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:24:44,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:24:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:24:44,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:24:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:24:44,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:24:44,658 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:24:44,658 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 05:24:44,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-04 05:24:44,658 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2023-08-04 05:24:44,659 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (1/2) [2023-08-04 05:24:44,661 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 05:24:44,661 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 05:24:44,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 05:24:44 BasicIcfg [2023-08-04 05:24:44,710 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 05:24:44,711 INFO L158 Benchmark]: Toolchain (without parser) took 10861.63ms. Allocated memory was 369.1MB in the beginning and 497.0MB in the end (delta: 127.9MB). Free memory was 316.9MB in the beginning and 378.2MB in the end (delta: -61.3MB). Peak memory consumption was 69.7MB. Max. memory is 16.0GB. [2023-08-04 05:24:44,711 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 369.1MB. Free memory is still 319.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 05:24:44,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.65ms. Allocated memory is still 369.1MB. Free memory was 316.5MB in the beginning and 296.6MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-04 05:24:44,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.38ms. Allocated memory is still 369.1MB. Free memory was 296.6MB in the beginning and 294.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:24:44,712 INFO L158 Benchmark]: Boogie Preprocessor took 22.01ms. Allocated memory is still 369.1MB. Free memory was 294.5MB in the beginning and 292.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:24:44,712 INFO L158 Benchmark]: RCFGBuilder took 410.16ms. Allocated memory is still 369.1MB. Free memory was 292.7MB in the beginning and 277.3MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-04 05:24:44,712 INFO L158 Benchmark]: TraceAbstraction took 9904.98ms. Allocated memory is still 497.0MB. Free memory was 463.9MB in the beginning and 378.2MB in the end (delta: 85.7MB). Peak memory consumption was 86.7MB. Max. memory is 16.0GB. [2023-08-04 05:24:44,714 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.13ms. Allocated memory is still 369.1MB. Free memory is still 319.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 441.65ms. Allocated memory is still 369.1MB. Free memory was 316.5MB in the beginning and 296.6MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.38ms. Allocated memory is still 369.1MB. Free memory was 296.6MB in the beginning and 294.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 22.01ms. Allocated memory is still 369.1MB. Free memory was 294.5MB in the beginning and 292.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 410.16ms. Allocated memory is still 369.1MB. Free memory was 292.7MB in the beginning and 277.3MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 9904.98ms. Allocated memory is still 497.0MB. Free memory was 463.9MB in the beginning and 378.2MB in the end (delta: 85.7MB). Peak memory consumption was 86.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 237]: Unsoundness Warning unspecified type, defaulting to int C: short [237] - GenericResultAtLocation [Line: 237]: Unsoundness Warning unspecified type, defaulting to int C: short [237] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 106 PlacesBefore, 21 PlacesAfterwards, 110 TransitionsBefore, 21 TransitionsAfterwards, 3402 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 26 ConcurrentYvCompositions, 4 ChoiceCompositions, 122 TotalNumberOfCompositions, 4257 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3457, independent: 3373, independent conditional: 0, independent unconditional: 3373, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2103, independent: 2072, independent conditional: 0, independent unconditional: 2072, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3457, independent: 1301, independent conditional: 0, independent unconditional: 1301, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 2103, unknown conditional: 0, unknown unconditional: 2103] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 106 PlacesBefore, 20 PlacesAfterwards, 110 TransitionsBefore, 20 TransitionsAfterwards, 3402 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 25 ConcurrentYvCompositions, 4 ChoiceCompositions, 119 TotalNumberOfCompositions, 4167 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3390, independent: 3308, independent conditional: 0, independent unconditional: 3308, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2094, independent: 2060, independent conditional: 0, independent unconditional: 2060, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3390, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 2094, unknown conditional: 0, unknown unconditional: 2094] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 134 PlacesBefore, 30 PlacesAfterwards, 138 TransitionsBefore, 28 TransitionsAfterwards, 8316 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 89 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 6 ChoiceCompositions, 140 TotalNumberOfCompositions, 9899 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7504, independent: 7384, independent conditional: 0, independent unconditional: 7384, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4831, independent: 4782, independent conditional: 0, independent unconditional: 4782, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7504, independent: 2602, independent conditional: 0, independent unconditional: 2602, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 4831, unknown conditional: 0, unknown unconditional: 4831] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, 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 - CounterExampleResult [Line: 690]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L697] 0 volatile int stoppingFlag; [L698] 0 volatile int pendingIo; [L699] 0 volatile int stoppingEvent; [L700] 0 volatile int stopped; [L756] 0 pthread_t t[2]; [L757] 0 pendingIo = 1 [L758] 0 stoppingFlag = 0 [L759] 0 stoppingEvent = 0 [L760] 0 stopped = 0 [L761] 0 int asdf=0; VAL [asdf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L761] COND TRUE 0 asdf<2 [L761] FCALL, FORK 0 pthread_create(&t[asdf], 0, BCSP_PnpStop, 0) VAL [asdf=0, pendingIo=1, pthread_create(&t[asdf], 0, BCSP_PnpStop, 0)=-1, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L761] 0 asdf++ VAL [asdf=1, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L761] COND TRUE 0 asdf<2 [L761] FCALL, FORK 0 pthread_create(&t[asdf], 0, BCSP_PnpStop, 0) VAL [asdf=1, pendingIo=1, pthread_create(&t[asdf], 0, BCSP_PnpStop, 0)=0, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L761] 0 asdf++ VAL [asdf=2, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L761] COND FALSE 0 !(asdf<2) [L762] CALL 0 BCSP_PnpAdd(0) [L734] 0 int status; [L735] CALL, EXPR 0 BCSP_IoIncrement() [L703] 0 int lsf = stoppingFlag; [L705] COND FALSE 0 !(\read(lsf)) VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L745] 1 stoppingFlag = 1 [L747] CALL 1 BCSP_IoDecrement() [L725] 1 int pending; [L726] CALL, EXPR 1 dec() [L719] 1 pendingIo-- [L720] 1 int tmp = pendingIo; [L722] 1 return tmp; [L726] RET, EXPR 1 dec() [L726] 1 pending = dec() [L727] COND TRUE 1 pending == 0 [L729] 1 stoppingEvent = 1 [L747] RET 1 BCSP_IoDecrement() [L749] 1 int lse = stoppingEvent; [L751] CALL 1 assume_abort_if_not(lse) [L686] COND FALSE 1 !(!cond) [L751] RET 1 assume_abort_if_not(lse) [L752] 1 stopped = 1 [L753] 1 return 0; [L709] 0 int lp = pendingIo; VAL [lp=0, lsf=0, pendingIo=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L712] 0 pendingIo = lp + 1 [L715] 0 return 0; [L735] RET, EXPR 0 BCSP_IoIncrement() [L735] 0 status = BCSP_IoIncrement() [L736] COND TRUE 0 status == 0 [L737] 0 int local_assertion = !stopped; [L738] CALL 0 __VERIFIER_assert(local_assertion) [L689] COND TRUE 0 !(cond) [L690] 0 reach_error() VAL [\old(cond)=0, cond=0, pendingIo=1, stopped=1, stoppingEvent=1, stoppingFlag=1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 130 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.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 9 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=2, InterpolantAutomatonStates: 10, 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, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 58 SizeOfPredicates, 0 NumberOfNonLiveVariables, 93 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 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, 156 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.7s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 564 IncrementalHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 12 mSDtfsCounter, 564 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=7, InterpolantAutomatonStates: 29, 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, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 86 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 30/33 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, 130 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: 2.2s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred 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 RESULT: Ultimate proved your program to be incorrect! [2023-08-04 05:24:44,748 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...