/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-wmm_mix000.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:25:15,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:25:15,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:25:15,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:25:15,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:25:15,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:25:15,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:25:15,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:25:15,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:25:15,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:25:15,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:25:15,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:25:15,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:25:15,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:25:15,157 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:25:15,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:25:15,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:25:15,158 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:25:15,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:25:15,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:25:15,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:25:15,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:25:15,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:25:15,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:25:15,159 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:25:15,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:25:15,160 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:25:15,160 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:25:15,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:25:15,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:25:15,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:25:15,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:25:15,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:25:15,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:25:15,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:25:15,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:25:15,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:25:15,162 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:25:15,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:25:15,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:25:15,163 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:25:15,163 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:25:15,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:25:15,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:25:15,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:25:15,407 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:25:15,407 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:25:15,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix000.opt_bound2.i [2023-08-04 05:25:16,607 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:25:16,820 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:25:16,820 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix000.opt_bound2.i [2023-08-04 05:25:16,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43e2f1bf/3df299d4cab540b4b052ca56eb95b27d/FLAGafb5c34bb [2023-08-04 05:25:16,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43e2f1bf/3df299d4cab540b4b052ca56eb95b27d [2023-08-04 05:25:16,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:25:16,855 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:25:16,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:25:16,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:25:16,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:25:16,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:25:16" (1/1) ... [2023-08-04 05:25:16,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae06af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:16, skipping insertion in model container [2023-08-04 05:25:16,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:25:16" (1/1) ... [2023-08-04 05:25:16,906 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:25:17,082 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-wmm_mix000.opt_bound2.i[987,1000] [2023-08-04 05:25:17,262 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:25:17,270 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:25:17,289 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-wmm_mix000.opt_bound2.i[987,1000] [2023-08-04 05:25:17,303 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 05:25:17,305 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 05:25:17,336 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:25:17,357 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:25:17,357 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:25:17,363 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:25:17,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:17 WrapperNode [2023-08-04 05:25:17,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:25:17,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:25:17,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:25:17,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:25:17,370 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:25:17" (1/1) ... [2023-08-04 05:25:17,406 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:25:17" (1/1) ... [2023-08-04 05:25:17,438 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2023-08-04 05:25:17,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:25:17,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:25:17,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:25:17,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:25:17,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:17" (1/1) ... [2023-08-04 05:25:17,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:17" (1/1) ... [2023-08-04 05:25:17,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:17" (1/1) ... [2023-08-04 05:25:17,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:17" (1/1) ... [2023-08-04 05:25:17,459 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:17" (1/1) ... [2023-08-04 05:25:17,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:17" (1/1) ... [2023-08-04 05:25:17,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:17" (1/1) ... [2023-08-04 05:25:17,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:17" (1/1) ... [2023-08-04 05:25:17,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:25:17,470 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:25:17,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:25:17,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:25:17,471 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:17" (1/1) ... [2023-08-04 05:25:17,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:25:17,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:25:17,514 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:25:17,534 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:25:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:25:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:25:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:25:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:25:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:25:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 05:25:17,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 05:25:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 05:25:17,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 05:25:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:25:17,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:25:17,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:25:17,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:25:17,558 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:25:17,695 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:25:17,698 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:25:18,010 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:25:18,180 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:25:18,180 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-04 05:25:18,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:25:18 BoogieIcfgContainer [2023-08-04 05:25:18,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:25:18,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:25:18,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:25:18,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:25:18,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:25:16" (1/3) ... [2023-08-04 05:25:18,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0be9c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:25:18, skipping insertion in model container [2023-08-04 05:25:18,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:25:17" (2/3) ... [2023-08-04 05:25:18,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0be9c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:25:18, skipping insertion in model container [2023-08-04 05:25:18,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:25:18" (3/3) ... [2023-08-04 05:25:18,189 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix000.opt_bound2.i [2023-08-04 05:25:18,195 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:25:18,202 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:25:18,202 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 05:25:18,202 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:25:18,246 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:25:18,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 105 transitions, 220 flow [2023-08-04 05:25:18,379 INFO L124 PetriNetUnfolderBase]: 14/222 cut-off events. [2023-08-04 05:25:18,380 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:25:18,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 222 events. 14/222 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 624 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 131. Up to 8 conditions per place. [2023-08-04 05:25:18,386 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 105 transitions, 220 flow [2023-08-04 05:25:18,390 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 104 transitions, 216 flow [2023-08-04 05:25:18,394 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:25:18,411 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 104 transitions, 216 flow [2023-08-04 05:25:18,415 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 104 transitions, 216 flow [2023-08-04 05:25:18,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 104 transitions, 216 flow [2023-08-04 05:25:18,446 INFO L124 PetriNetUnfolderBase]: 14/221 cut-off events. [2023-08-04 05:25:18,446 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:25:18,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 221 events. 14/221 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 617 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-04 05:25:18,449 INFO L119 LiptonReduction]: Number of co-enabled transitions 1506 [2023-08-04 05:25:21,453 INFO L134 LiptonReduction]: Checked pairs total: 4128 [2023-08-04 05:25:21,453 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-04 05:25:21,464 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:25:21,469 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;@c236144, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:25:21,469 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:25:21,473 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:25:21,473 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-08-04 05:25:21,473 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:25:21,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:25:21,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 05:25:21,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:25:21,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:25:21,478 INFO L85 PathProgramCache]: Analyzing trace with hash 473560100, now seen corresponding path program 1 times [2023-08-04 05:25:21,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:25:21,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390417701] [2023-08-04 05:25:21,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:25:21,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:25:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:25:21,701 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:25:21,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:25:21,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390417701] [2023-08-04 05:25:21,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390417701] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:25:21,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:25:21,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:25:21,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317208834] [2023-08-04 05:25:21,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:25:21,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:25:21,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:25:21,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:25:21,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:25:21,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 197 [2023-08-04 05:25:21,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have 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:25:21,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:25:21,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 197 [2023-08-04 05:25:21,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:25:21,946 INFO L124 PetriNetUnfolderBase]: 352/655 cut-off events. [2023-08-04 05:25:21,947 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:25:21,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1287 conditions, 655 events. 352/655 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3056 event pairs, 160 based on Foata normal form. 28/559 useless extension candidates. Maximal degree in co-relation 1275. Up to 609 conditions per place. [2023-08-04 05:25:21,953 INFO L140 encePairwiseOnDemand]: 193/197 looper letters, 23 selfloop transitions, 2 changer transitions 1/29 dead transitions. [2023-08-04 05:25:21,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 118 flow [2023-08-04 05:25:21,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:25:21,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:25:21,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2023-08-04 05:25:21,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494077834179357 [2023-08-04 05:25:21,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 292 transitions. [2023-08-04 05:25:21,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 292 transitions. [2023-08-04 05:25:21,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:25:21,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 292 transitions. [2023-08-04 05:25:21,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have 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:25:21,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have 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:25:21,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have 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:25:21,989 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 60 flow. Second operand 3 states and 292 transitions. [2023-08-04 05:25:21,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 118 flow [2023-08-04 05:25:21,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:25:21,993 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 66 flow [2023-08-04 05:25:21,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-04 05:25:21,997 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-08-04 05:25:21,997 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 66 flow [2023-08-04 05:25:21,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have 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:25:21,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:25:21,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:25:21,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 05:25:21,999 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:25:22,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:25:22,001 INFO L85 PathProgramCache]: Analyzing trace with hash 799663589, now seen corresponding path program 1 times [2023-08-04 05:25:22,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:25:22,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488656410] [2023-08-04 05:25:22,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:25:22,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:25:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:25:22,129 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:25:22,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:25:22,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488656410] [2023-08-04 05:25:22,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488656410] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:25:22,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989482839] [2023-08-04 05:25:22,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:25:22,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:25:22,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:25:22,133 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:25:22,142 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:25:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:25:22,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:25:22,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:25:22,277 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:25:22,277 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:25:22,292 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:25:22,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989482839] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:25:22,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:25:22,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:25:22,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210335573] [2023-08-04 05:25:22,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:25:22,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:25:22,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:25:22,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:25:22,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:25:22,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 197 [2023-08-04 05:25:22,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have 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:25:22,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:25:22,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 197 [2023-08-04 05:25:22,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:25:22,339 INFO L124 PetriNetUnfolderBase]: 6/21 cut-off events. [2023-08-04 05:25:22,339 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 05:25:22,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 21 events. 6/21 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 4/25 useless extension candidates. Maximal degree in co-relation 52. Up to 14 conditions per place. [2023-08-04 05:25:22,341 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2023-08-04 05:25:22,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 12 transitions, 55 flow [2023-08-04 05:25:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:25:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:25:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 360 transitions. [2023-08-04 05:25:22,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45685279187817257 [2023-08-04 05:25:22,353 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 360 transitions. [2023-08-04 05:25:22,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 360 transitions. [2023-08-04 05:25:22,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:25:22,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 360 transitions. [2023-08-04 05:25:22,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have 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:25:22,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have 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:25:22,360 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have 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:25:22,360 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 66 flow. Second operand 4 states and 360 transitions. [2023-08-04 05:25:22,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 12 transitions, 55 flow [2023-08-04 05:25:22,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 12 transitions, 49 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 05:25:22,361 INFO L231 Difference]: Finished difference. Result has 15 places, 0 transitions, 0 flow [2023-08-04 05:25:22,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=15, PETRI_TRANSITIONS=0} [2023-08-04 05:25:22,362 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -15 predicate places. [2023-08-04 05:25:22,362 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 0 transitions, 0 flow [2023-08-04 05:25:22,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have 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:25:22,365 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 05:25:22,365 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 05:25:22,365 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 05:25:22,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 05:25:22,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:25:22,574 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 05:25:22,576 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 05:25:22,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 105 transitions, 220 flow [2023-08-04 05:25:22,601 INFO L124 PetriNetUnfolderBase]: 14/222 cut-off events. [2023-08-04 05:25:22,601 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:25:22,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 222 events. 14/222 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 624 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 131. Up to 8 conditions per place. [2023-08-04 05:25:22,602 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 105 transitions, 220 flow [2023-08-04 05:25:22,603 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 78 transitions, 166 flow [2023-08-04 05:25:22,603 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:25:22,603 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 78 transitions, 166 flow [2023-08-04 05:25:22,603 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 78 transitions, 166 flow [2023-08-04 05:25:22,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 78 transitions, 166 flow [2023-08-04 05:25:22,613 INFO L124 PetriNetUnfolderBase]: 2/114 cut-off events. [2023-08-04 05:25:22,614 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:25:22,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 160 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-04 05:25:22,615 INFO L119 LiptonReduction]: Number of co-enabled transitions 656 [2023-08-04 05:25:25,114 INFO L134 LiptonReduction]: Checked pairs total: 1436 [2023-08-04 05:25:25,114 INFO L136 LiptonReduction]: Total number of compositions: 65 [2023-08-04 05:25:25,116 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 05:25:25,117 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;@c236144, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:25:25,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 05:25:25,120 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:25:25,120 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-04 05:25:25,120 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:25:25,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:25:25,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 05:25:25,120 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 05:25:25,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:25:25,121 INFO L85 PathProgramCache]: Analyzing trace with hash 535957822, now seen corresponding path program 1 times [2023-08-04 05:25:25,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:25:25,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583685607] [2023-08-04 05:25:25,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:25:25,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:25:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:25:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:25:25,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:25:25,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583685607] [2023-08-04 05:25:25,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583685607] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:25:25,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:25:25,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:25:25,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162864931] [2023-08-04 05:25:25,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:25:25,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:25:25,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:25:25,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:25:25,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:25:25,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 170 [2023-08-04 05:25:25,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have 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:25:25,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:25:25,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 170 [2023-08-04 05:25:25,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:25:25,213 INFO L124 PetriNetUnfolderBase]: 65/147 cut-off events. [2023-08-04 05:25:25,213 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:25:25,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 147 events. 65/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 490 event pairs, 20 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 280. Up to 126 conditions per place. [2023-08-04 05:25:25,214 INFO L140 encePairwiseOnDemand]: 167/170 looper letters, 17 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-08-04 05:25:25,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 22 transitions, 92 flow [2023-08-04 05:25:25,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:25:25,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:25:25,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2023-08-04 05:25:25,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5568627450980392 [2023-08-04 05:25:25,216 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 284 transitions. [2023-08-04 05:25:25,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 284 transitions. [2023-08-04 05:25:25,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:25:25,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 284 transitions. [2023-08-04 05:25:25,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have 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:25:25,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have 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:25:25,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have 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:25:25,219 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 3 states and 284 transitions. [2023-08-04 05:25:25,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 22 transitions, 92 flow [2023-08-04 05:25:25,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:25:25,220 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 54 flow [2023-08-04 05:25:25,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-08-04 05:25:25,221 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 3 predicate places. [2023-08-04 05:25:25,221 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 54 flow [2023-08-04 05:25:25,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have 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:25:25,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:25:25,222 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 05:25:25,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 05:25:25,222 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 05:25:25,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:25:25,223 INFO L85 PathProgramCache]: Analyzing trace with hash -576200393, now seen corresponding path program 1 times [2023-08-04 05:25:25,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:25:25,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475939995] [2023-08-04 05:25:25,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:25:25,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:25:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:25:25,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:25:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:25:25,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:25:25,284 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:25:25,284 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 05:25:25,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 05:25:25,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 05:25:25,285 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 05:25:25,285 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 05:25:25,286 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 05:25:25,286 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 05:25:25,309 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:25:25,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 123 transitions, 270 flow [2023-08-04 05:25:25,357 INFO L124 PetriNetUnfolderBase]: 30/459 cut-off events. [2023-08-04 05:25:25,357 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 05:25:25,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 459 events. 30/459 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1950 event pairs, 0 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 331. Up to 18 conditions per place. [2023-08-04 05:25:25,360 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 123 transitions, 270 flow [2023-08-04 05:25:25,364 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 122 transitions, 264 flow [2023-08-04 05:25:25,364 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:25:25,365 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 122 transitions, 264 flow [2023-08-04 05:25:25,366 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 122 transitions, 264 flow [2023-08-04 05:25:25,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 122 transitions, 264 flow [2023-08-04 05:25:25,401 INFO L124 PetriNetUnfolderBase]: 30/458 cut-off events. [2023-08-04 05:25:25,401 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 05:25:25,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 458 events. 30/458 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1941 event pairs, 0 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 329. Up to 18 conditions per place. [2023-08-04 05:25:25,408 INFO L119 LiptonReduction]: Number of co-enabled transitions 3584 [2023-08-04 05:25:28,090 INFO L134 LiptonReduction]: Checked pairs total: 11069 [2023-08-04 05:25:28,091 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-08-04 05:25:28,093 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:25:28,094 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;@c236144, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:25:28,094 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 05:25:28,096 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:25:28,097 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-08-04 05:25:28,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:25:28,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:25:28,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 05:25:28,097 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:25:28,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:25:28,098 INFO L85 PathProgramCache]: Analyzing trace with hash 762774844, now seen corresponding path program 1 times [2023-08-04 05:25:28,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:25:28,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866463132] [2023-08-04 05:25:28,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:25:28,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:25:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:25:28,128 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:25:28,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:25:28,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866463132] [2023-08-04 05:25:28,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866463132] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:25:28,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:25:28,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:25:28,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546981207] [2023-08-04 05:25:28,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:25:28,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:25:28,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:25:28,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:25:28,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:25:28,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 220 [2023-08-04 05:25:28,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have 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:25:28,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:25:28,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 220 [2023-08-04 05:25:28,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:25:31,904 INFO L124 PetriNetUnfolderBase]: 21488/30712 cut-off events. [2023-08-04 05:25:31,905 INFO L125 PetriNetUnfolderBase]: For 444/444 co-relation queries the response was YES. [2023-08-04 05:25:31,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60602 conditions, 30712 events. 21488/30712 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 195719 event pairs, 15656 based on Foata normal form. 860/26564 useless extension candidates. Maximal degree in co-relation 13359. Up to 29265 conditions per place. [2023-08-04 05:25:32,061 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 35 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-08-04 05:25:32,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 182 flow [2023-08-04 05:25:32,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:25:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:25:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-04 05:25:32,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2023-08-04 05:25:32,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-04 05:25:32,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-04 05:25:32,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:25:32,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-04 05:25:32,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have 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:25:32,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have 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:25:32,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have 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:25:32,066 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 100 flow. Second operand 3 states and 336 transitions. [2023-08-04 05:25:32,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 182 flow [2023-08-04 05:25:32,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 180 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 05:25:32,072 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 108 flow [2023-08-04 05:25:32,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-08-04 05:25:32,075 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2023-08-04 05:25:32,075 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 108 flow [2023-08-04 05:25:32,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have 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:25:32,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:25:32,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:25:32,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 05:25:32,077 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:25:32,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:25:32,079 INFO L85 PathProgramCache]: Analyzing trace with hash -550189373, now seen corresponding path program 1 times [2023-08-04 05:25:32,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:25:32,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504572017] [2023-08-04 05:25:32,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:25:32,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:25:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:25:32,148 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:25:32,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:25:32,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504572017] [2023-08-04 05:25:32,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504572017] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:25:32,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792351389] [2023-08-04 05:25:32,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:25:32,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:25:32,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:25:32,150 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:25:32,174 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:25:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:25:32,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:25:32,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:25:32,247 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:25:32,247 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:25:32,263 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:25:32,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792351389] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:25:32,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:25:32,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:25:32,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028248671] [2023-08-04 05:25:32,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:25:32,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:25:32,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:25:32,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:25:32,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:25:32,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 220 [2023-08-04 05:25:32,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 108 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:25:32,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:25:32,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 220 [2023-08-04 05:25:32,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:25:34,805 INFO L124 PetriNetUnfolderBase]: 18130/25534 cut-off events. [2023-08-04 05:25:34,805 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2023-08-04 05:25:34,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50365 conditions, 25534 events. 18130/25534 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 1040. Compared 155413 event pairs, 8812 based on Foata normal form. 4/21570 useless extension candidates. Maximal degree in co-relation 13361. Up to 24281 conditions per place. [2023-08-04 05:25:34,927 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 40 selfloop transitions, 3 changer transitions 1/51 dead transitions. [2023-08-04 05:25:34,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 218 flow [2023-08-04 05:25:34,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:25:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:25:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions. [2023-08-04 05:25:34,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965909090909091 [2023-08-04 05:25:34,929 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 437 transitions. [2023-08-04 05:25:34,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 437 transitions. [2023-08-04 05:25:34,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:25:34,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 437 transitions. [2023-08-04 05:25:34,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have 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:25:34,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have 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:25:34,933 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have 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:25:34,933 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 108 flow. Second operand 4 states and 437 transitions. [2023-08-04 05:25:34,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 218 flow [2023-08-04 05:25:34,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:25:34,935 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 120 flow [2023-08-04 05:25:34,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-08-04 05:25:34,936 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2023-08-04 05:25:34,936 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 120 flow [2023-08-04 05:25:34,936 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:25:34,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:25:34,937 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:25:34,945 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:25:35,142 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:25:35,143 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:25:35,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:25:35,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1182705675, now seen corresponding path program 1 times [2023-08-04 05:25:35,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:25:35,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856959443] [2023-08-04 05:25:35,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:25:35,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:25:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:25:35,295 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:25:35,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:25:35,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856959443] [2023-08-04 05:25:35,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856959443] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:25:35,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:25:35,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:25:35,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273097165] [2023-08-04 05:25:35,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:25:35,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:25:35,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:25:35,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:25:35,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:25:35,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 220 [2023-08-04 05:25:35,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have 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:25:35,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:25:35,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 220 [2023-08-04 05:25:35,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:25:37,531 INFO L124 PetriNetUnfolderBase]: 16282/22999 cut-off events. [2023-08-04 05:25:37,531 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2023-08-04 05:25:37,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45334 conditions, 22999 events. 16282/22999 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 967. Compared 139219 event pairs, 3258 based on Foata normal form. 0/19831 useless extension candidates. Maximal degree in co-relation 21213. Up to 20801 conditions per place. [2023-08-04 05:25:37,623 INFO L140 encePairwiseOnDemand]: 215/220 looper letters, 47 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2023-08-04 05:25:37,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 57 transitions, 259 flow [2023-08-04 05:25:37,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:25:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:25:37,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-04 05:25:37,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5409090909090909 [2023-08-04 05:25:37,625 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-04 05:25:37,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-04 05:25:37,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:25:37,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-04 05:25:37,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have 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:25:37,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have 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:25:37,630 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have 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:25:37,630 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 120 flow. Second operand 3 states and 357 transitions. [2023-08-04 05:25:37,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 57 transitions, 259 flow [2023-08-04 05:25:37,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 252 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 05:25:37,634 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 134 flow [2023-08-04 05:25:37,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-04 05:25:37,635 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2023-08-04 05:25:37,635 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 134 flow [2023-08-04 05:25:37,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have 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:25:37,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:25:37,636 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:25:37,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 05:25:37,636 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:25:37,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:25:37,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1990857426, now seen corresponding path program 1 times [2023-08-04 05:25:37,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:25:37,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084337593] [2023-08-04 05:25:37,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:25:37,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:25:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:25:37,677 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:25:37,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:25:37,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084337593] [2023-08-04 05:25:37,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084337593] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:25:37,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:25:37,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 05:25:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726295861] [2023-08-04 05:25:37,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:25:37,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:25:37,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:25:37,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:25:37,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:25:37,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 220 [2023-08-04 05:25:37,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have 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:25:37,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:25:37,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 220 [2023-08-04 05:25:37,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:25:39,625 INFO L124 PetriNetUnfolderBase]: 16138/22615 cut-off events. [2023-08-04 05:25:39,625 INFO L125 PetriNetUnfolderBase]: For 1561/1561 co-relation queries the response was YES. [2023-08-04 05:25:39,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47910 conditions, 22615 events. 16138/22615 cut-off events. For 1561/1561 co-relation queries the response was YES. Maximal size of possible extension queue 969. Compared 136254 event pairs, 12146 based on Foata normal form. 0/19479 useless extension candidates. Maximal degree in co-relation 22525. Up to 21409 conditions per place. [2023-08-04 05:25:39,729 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 45 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-08-04 05:25:39,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 255 flow [2023-08-04 05:25:39,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:25:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:25:39,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-08-04 05:25:39,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5196969696969697 [2023-08-04 05:25:39,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-08-04 05:25:39,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-08-04 05:25:39,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:25:39,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-08-04 05:25:39,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have 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:25:39,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have 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:25:39,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have 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:25:39,734 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 134 flow. Second operand 3 states and 343 transitions. [2023-08-04 05:25:39,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 255 flow [2023-08-04 05:25:39,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:25:39,736 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 145 flow [2023-08-04 05:25:39,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2023-08-04 05:25:39,737 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2023-08-04 05:25:39,737 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 145 flow [2023-08-04 05:25:39,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have 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:25:39,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:25:39,738 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:25:39,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 05:25:39,738 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:25:39,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:25:39,738 INFO L85 PathProgramCache]: Analyzing trace with hash -18034304, now seen corresponding path program 1 times [2023-08-04 05:25:39,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:25:39,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408514920] [2023-08-04 05:25:39,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:25:39,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:25:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:25:39,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:25:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:25:39,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:25:39,787 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:25:39,787 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 05:25:39,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 05:25:39,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 05:25:39,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 05:25:39,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 05:25:39,788 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 05:25:39,789 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 05:25:39,790 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 05:25:39,790 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 05:25:39,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 05:25:39 BasicIcfg [2023-08-04 05:25:39,863 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 05:25:39,863 INFO L158 Benchmark]: Toolchain (without parser) took 23008.04ms. Allocated memory was 612.4MB in the beginning and 3.8GB in the end (delta: 3.2GB). Free memory was 557.6MB in the beginning and 2.6GB in the end (delta: -2.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-04 05:25:39,863 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 388.0MB. Free memory is still 336.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 05:25:39,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.65ms. Allocated memory is still 612.4MB. Free memory was 557.4MB in the beginning and 533.5MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-04 05:25:39,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.02ms. Allocated memory is still 612.4MB. Free memory was 533.5MB in the beginning and 530.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 05:25:39,864 INFO L158 Benchmark]: Boogie Preprocessor took 29.51ms. Allocated memory is still 612.4MB. Free memory was 530.9MB in the beginning and 528.9MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-04 05:25:39,865 INFO L158 Benchmark]: RCFGBuilder took 712.57ms. Allocated memory is still 612.4MB. Free memory was 528.9MB in the beginning and 570.9MB in the end (delta: -42.0MB). Peak memory consumption was 41.0MB. Max. memory is 16.0GB. [2023-08-04 05:25:39,865 INFO L158 Benchmark]: TraceAbstraction took 21678.73ms. Allocated memory was 612.4MB in the beginning and 3.8GB in the end (delta: 3.2GB). Free memory was 569.8MB in the beginning and 2.6GB in the end (delta: -2.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-04 05:25:39,866 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 388.0MB. Free memory is still 336.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 507.65ms. Allocated memory is still 612.4MB. Free memory was 557.4MB in the beginning and 533.5MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 74.02ms. Allocated memory is still 612.4MB. Free memory was 533.5MB in the beginning and 530.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 29.51ms. Allocated memory is still 612.4MB. Free memory was 530.9MB in the beginning and 528.9MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 712.57ms. Allocated memory is still 612.4MB. Free memory was 528.9MB in the beginning and 570.9MB in the end (delta: -42.0MB). Peak memory consumption was 41.0MB. Max. memory is 16.0GB. * TraceAbstraction took 21678.73ms. Allocated memory was 612.4MB in the beginning and 3.8GB in the end (delta: 3.2GB). Free memory was 569.8MB in the beginning and 2.6GB in the end (delta: -2.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 105 PlacesBefore, 30 PlacesAfterwards, 104 TransitionsBefore, 26 TransitionsAfterwards, 1506 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 4128 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2178, independent: 2037, independent conditional: 0, independent unconditional: 2037, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 809, independent: 783, independent conditional: 0, independent unconditional: 783, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2178, independent: 1254, independent conditional: 0, independent unconditional: 1254, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 809, unknown conditional: 0, unknown unconditional: 809] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, 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.5s, 82 PlacesBefore, 23 PlacesAfterwards, 78 TransitionsBefore, 18 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 22 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 1436 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1040, independent: 946, independent conditional: 0, independent unconditional: 946, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 359, independent: 348, independent conditional: 0, independent unconditional: 348, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1040, independent: 598, independent conditional: 0, independent unconditional: 598, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 359, unknown conditional: 0, unknown unconditional: 359] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 127 PlacesBefore, 48 PlacesAfterwards, 122 TransitionsBefore, 40 TransitionsAfterwards, 3584 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 97 TotalNumberOfCompositions, 11069 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3968, independent: 3732, independent conditional: 0, independent unconditional: 3732, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1771, independent: 1731, independent conditional: 0, independent unconditional: 1731, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3968, independent: 2001, independent conditional: 0, independent unconditional: 2001, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 1771, unknown conditional: 0, unknown unconditional: 1771] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 177, Positive conditional cache size: 0, Positive unconditional cache size: 177, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t0[2]; [L827] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L827] COND TRUE 0 asdf<2 [L827] FCALL, FORK 0 pthread_create(&t0[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0[asdf], ((void *)0), P0, ((void *)0))=-1, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L827] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L827] COND TRUE 0 asdf<2 [L827] FCALL, FORK 0 pthread_create(&t0[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0[asdf], ((void *)0), P0, ((void *)0))=0, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L827] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L827] COND FALSE 0 !(asdf<2) [L828] 0 pthread_t t1[2]; [L829] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L829] COND TRUE 0 asdf<2 [L829] FCALL, FORK 0 pthread_create(&t1[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1[asdf], ((void *)0), P1, ((void *)0))=1, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 3 x$w_buff1 = x$w_buff0 [L775] 3 x$w_buff0 = 1 [L776] 3 x$w_buff1_used = x$w_buff0_used [L777] 3 x$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L829] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L829] COND TRUE 0 asdf<2 [L829] FCALL, FORK 0 pthread_create(&t1[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1[asdf], ((void *)0), P1, ((void *)0))=2, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 4 x$w_buff1 = x$w_buff0 [L775] 4 x$w_buff0 = 1 [L776] 4 x$w_buff1_used = x$w_buff0_used [L777] 4 x$w_buff0_used = (_Bool)1 [L778] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x=0, y=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 120 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 83 IncrementalHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 2 mSDtfsCounter, 83 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=1, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 51 SizeOfPredicates, 0 NumberOfNonLiveVariables, 151 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 138 locations, 6 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: 14.5s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 288 IncrementalHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 9 mSDtfsCounter, 288 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=4, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 12/15 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 5 procedures, 120 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.7s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=1, InterpolantAutomatonStates: 3, 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, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 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:25:39,888 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...