/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_mix035_power.opt_rmo.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 06:00:21,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 06:00:21,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 06:00:21,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 06:00:21,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 06:00:21,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 06:00:21,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 06:00:21,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 06:00:21,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 06:00:21,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 06:00:21,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 06:00:21,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 06:00:21,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 06:00:21,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 06:00:21,285 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 06:00:21,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 06:00:21,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 06:00:21,286 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 06:00:21,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 06:00:21,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 06:00:21,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 06:00:21,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 06:00:21,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 06:00:21,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 06:00:21,290 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 06:00:21,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 06:00:21,291 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 06:00:21,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 06:00:21,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 06:00:21,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 06:00:21,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:00:21,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 06:00:21,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 06:00:21,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 06:00:21,294 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 06:00:21,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 06:00:21,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 06:00:21,295 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 06:00:21,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 06:00:21,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 06:00:21,295 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 06:00:21,296 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 06:00:21,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 06:00:21,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 06:00:21,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 06:00:21,523 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 06:00:21,523 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 06:00:21,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix035_power.opt_rmo.opt_bound2.i [2023-08-04 06:00:22,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 06:00:23,035 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 06:00:23,035 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix035_power.opt_rmo.opt_bound2.i [2023-08-04 06:00:23,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c18d51d57/cc24b2882f7c480ca65e1e71f73881cd/FLAG68cd9c801 [2023-08-04 06:00:23,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c18d51d57/cc24b2882f7c480ca65e1e71f73881cd [2023-08-04 06:00:23,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 06:00:23,064 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 06:00:23,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 06:00:23,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 06:00:23,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 06:00:23,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:00:23" (1/1) ... [2023-08-04 06:00:23,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f31865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:00:23, skipping insertion in model container [2023-08-04 06:00:23,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:00:23" (1/1) ... [2023-08-04 06:00:23,112 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 06:00:23,249 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_mix035_power.opt_rmo.opt_bound2.i[1001,1014] [2023-08-04 06:00:23,450 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:00:23,462 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 06:00:23,473 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_mix035_power.opt_rmo.opt_bound2.i[1001,1014] [2023-08-04 06:00:23,489 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 06:00:23,491 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 06:00:23,543 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:00:23,577 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:00:23,578 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:00:23,584 INFO L206 MainTranslator]: Completed translation [2023-08-04 06:00:23,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:00:23 WrapperNode [2023-08-04 06:00:23,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 06:00:23,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 06:00:23,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 06:00:23,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 06:00:23,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:00:23" (1/1) ... [2023-08-04 06:00:23,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:00:23" (1/1) ... [2023-08-04 06:00:23,668 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 155 [2023-08-04 06:00:23,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 06:00:23,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 06:00:23,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 06:00:23,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 06:00:23,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:00:23" (1/1) ... [2023-08-04 06:00:23,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:00:23" (1/1) ... [2023-08-04 06:00:23,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:00:23" (1/1) ... [2023-08-04 06:00:23,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:00:23" (1/1) ... [2023-08-04 06:00:23,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:00:23" (1/1) ... [2023-08-04 06:00:23,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:00:23" (1/1) ... [2023-08-04 06:00:23,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:00:23" (1/1) ... [2023-08-04 06:00:23,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:00:23" (1/1) ... [2023-08-04 06:00:23,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 06:00:23,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 06:00:23,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 06:00:23,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 06:00:23,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:00:23" (1/1) ... [2023-08-04 06:00:23,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:00:23,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:00:23,750 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 06:00:23,752 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 06:00:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 06:00:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 06:00:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 06:00:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 06:00:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 06:00:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 06:00:23,781 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 06:00:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 06:00:23,781 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 06:00:23,782 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 06:00:23,782 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 06:00:23,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 06:00:23,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 06:00:23,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 06:00:23,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 06:00:23,784 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 06:00:23,976 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 06:00:23,978 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 06:00:24,273 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 06:00:24,426 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 06:00:24,427 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 06:00:24,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:00:24 BoogieIcfgContainer [2023-08-04 06:00:24,429 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 06:00:24,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 06:00:24,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 06:00:24,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 06:00:24,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 06:00:23" (1/3) ... [2023-08-04 06:00:24,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13894849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:00:24, skipping insertion in model container [2023-08-04 06:00:24,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:00:23" (2/3) ... [2023-08-04 06:00:24,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13894849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:00:24, skipping insertion in model container [2023-08-04 06:00:24,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:00:24" (3/3) ... [2023-08-04 06:00:24,442 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix035_power.opt_rmo.opt_bound2.i [2023-08-04 06:00:24,449 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 06:00:24,458 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 06:00:24,458 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 06:00:24,459 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 06:00:24,514 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:00:24,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 133 transitions, 281 flow [2023-08-04 06:00:24,704 INFO L124 PetriNetUnfolderBase]: 30/459 cut-off events. [2023-08-04 06:00:24,704 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:00:24,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 459 events. 30/459 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2043 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 272. Up to 16 conditions per place. [2023-08-04 06:00:24,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 133 transitions, 281 flow [2023-08-04 06:00:24,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 132 transitions, 277 flow [2023-08-04 06:00:24,727 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:00:24,742 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 132 transitions, 277 flow [2023-08-04 06:00:24,746 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 132 transitions, 277 flow [2023-08-04 06:00:24,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 132 transitions, 277 flow [2023-08-04 06:00:24,809 INFO L124 PetriNetUnfolderBase]: 30/458 cut-off events. [2023-08-04 06:00:24,810 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:00:24,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 458 events. 30/458 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2031 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 270. Up to 16 conditions per place. [2023-08-04 06:00:24,833 INFO L119 LiptonReduction]: Number of co-enabled transitions 2730 [2023-08-04 06:00:28,371 INFO L134 LiptonReduction]: Checked pairs total: 6505 [2023-08-04 06:00:28,371 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-04 06:00:28,383 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:00:28,389 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;@13be19a5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:00:28,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 06:00:28,393 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:00:28,394 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-04 06:00:28,394 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:00:28,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:00:28,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:00:28,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:00:28,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:00:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash 538345468, now seen corresponding path program 1 times [2023-08-04 06:00:28,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:00:28,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918011238] [2023-08-04 06:00:28,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:28,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:00:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:28,661 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 06:00:28,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:00:28,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918011238] [2023-08-04 06:00:28,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918011238] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:00:28,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:00:28,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:00:28,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351814716] [2023-08-04 06:00:28,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:00:28,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:00:28,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:00:28,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:00:28,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:00:28,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 245 [2023-08-04 06:00:28,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:28,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:00:28,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 245 [2023-08-04 06:00:28,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:00:29,268 INFO L124 PetriNetUnfolderBase]: 2659/4213 cut-off events. [2023-08-04 06:00:29,269 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 06:00:29,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8345 conditions, 4213 events. 2659/4213 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 23500 event pairs, 1648 based on Foata normal form. 144/3629 useless extension candidates. Maximal degree in co-relation 8332. Up to 4008 conditions per place. [2023-08-04 06:00:29,305 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 30 selfloop transitions, 2 changer transitions 1/37 dead transitions. [2023-08-04 06:00:29,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 153 flow [2023-08-04 06:00:29,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:00:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:00:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-08-04 06:00:29,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5129251700680272 [2023-08-04 06:00:29,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-08-04 06:00:29,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-08-04 06:00:29,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:00:29,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-08-04 06:00:29,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:29,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:29,346 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:29,347 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 81 flow. Second operand 3 states and 377 transitions. [2023-08-04 06:00:29,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 153 flow [2023-08-04 06:00:29,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 153 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:00:29,353 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 87 flow [2023-08-04 06:00:29,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-04 06:00:29,359 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-04 06:00:29,359 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 87 flow [2023-08-04 06:00:29,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:29,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:00:29,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:00:29,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 06:00:29,360 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:00:29,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:00:29,362 INFO L85 PathProgramCache]: Analyzing trace with hash -490657502, now seen corresponding path program 1 times [2023-08-04 06:00:29,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:00:29,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880120372] [2023-08-04 06:00:29,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:29,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:00:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:29,522 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 06:00:29,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:00:29,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880120372] [2023-08-04 06:00:29,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880120372] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:00:29,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276769191] [2023-08-04 06:00:29,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:29,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:00:29,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:00:29,527 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 06:00:29,559 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 06:00:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:29,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:00:29,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:00:29,675 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 06:00:29,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:00:29,690 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 06:00:29,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276769191] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:00:29,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:00:29,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:00:29,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441450808] [2023-08-04 06:00:29,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:00:29,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:00:29,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:00:29,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:00:29,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:00:29,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245 [2023-08-04 06:00:29,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:29,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:00:29,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245 [2023-08-04 06:00:29,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:00:29,730 INFO L124 PetriNetUnfolderBase]: 6/20 cut-off events. [2023-08-04 06:00:29,730 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 06:00:29,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 20 events. 6/20 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/24 useless extension candidates. Maximal degree in co-relation 51. Up to 14 conditions per place. [2023-08-04 06:00:29,731 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 0 selfloop transitions, 0 changer transitions 11/11 dead transitions. [2023-08-04 06:00:29,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 11 transitions, 53 flow [2023-08-04 06:00:29,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:00:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:00:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2023-08-04 06:00:29,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47346938775510206 [2023-08-04 06:00:29,733 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 464 transitions. [2023-08-04 06:00:29,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 464 transitions. [2023-08-04 06:00:29,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:00:29,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 464 transitions. [2023-08-04 06:00:29,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:29,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:29,758 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:29,759 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 87 flow. Second operand 4 states and 464 transitions. [2023-08-04 06:00:29,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 11 transitions, 53 flow [2023-08-04 06:00:29,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 11 transitions, 47 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 06:00:29,760 INFO L231 Difference]: Finished difference. Result has 15 places, 0 transitions, 0 flow [2023-08-04 06:00:29,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=15, PETRI_TRANSITIONS=0} [2023-08-04 06:00:29,760 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -25 predicate places. [2023-08-04 06:00:29,761 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 0 transitions, 0 flow [2023-08-04 06:00:29,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:29,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 06:00:29,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 06:00:29,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 06:00:29,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 06:00:29,965 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 06:00:29,966 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 06:00:29,968 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 06:00:29,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 133 transitions, 281 flow [2023-08-04 06:00:30,015 INFO L124 PetriNetUnfolderBase]: 30/459 cut-off events. [2023-08-04 06:00:30,015 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:00:30,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 459 events. 30/459 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2043 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 272. Up to 16 conditions per place. [2023-08-04 06:00:30,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 133 transitions, 281 flow [2023-08-04 06:00:30,018 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 104 transitions, 223 flow [2023-08-04 06:00:30,018 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:00:30,018 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 104 transitions, 223 flow [2023-08-04 06:00:30,019 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 104 transitions, 223 flow [2023-08-04 06:00:30,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 104 transitions, 223 flow [2023-08-04 06:00:30,038 INFO L124 PetriNetUnfolderBase]: 6/227 cut-off events. [2023-08-04 06:00:30,039 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:00:30,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 227 events. 6/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 680 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 156. Up to 8 conditions per place. [2023-08-04 06:00:30,041 INFO L119 LiptonReduction]: Number of co-enabled transitions 1408 [2023-08-04 06:00:33,064 INFO L134 LiptonReduction]: Checked pairs total: 3300 [2023-08-04 06:00:33,064 INFO L136 LiptonReduction]: Total number of compositions: 84 [2023-08-04 06:00:33,066 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 06:00:33,067 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;@13be19a5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:00:33,067 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 06:00:33,070 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:00:33,070 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-04 06:00:33,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:00:33,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:00:33,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 06:00:33,071 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 06:00:33,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:00:33,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2000894350, now seen corresponding path program 1 times [2023-08-04 06:00:33,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:00:33,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132035973] [2023-08-04 06:00:33,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:33,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:00:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:33,144 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 06:00:33,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:00:33,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132035973] [2023-08-04 06:00:33,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132035973] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:00:33,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:00:33,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:00:33,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587418904] [2023-08-04 06:00:33,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:00:33,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:00:33,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:00:33,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:00:33,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:00:33,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 217 [2023-08-04 06:00:33,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:33,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:00:33,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 217 [2023-08-04 06:00:33,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:00:33,296 INFO L124 PetriNetUnfolderBase]: 559/969 cut-off events. [2023-08-04 06:00:33,296 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 06:00:33,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1997 conditions, 969 events. 559/969 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4547 event pairs, 304 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1976. Up to 900 conditions per place. [2023-08-04 06:00:33,302 INFO L140 encePairwiseOnDemand]: 214/217 looper letters, 24 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-04 06:00:33,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 127 flow [2023-08-04 06:00:33,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:00:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:00:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-04 06:00:33,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5668202764976958 [2023-08-04 06:00:33,304 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-04 06:00:33,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-04 06:00:33,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:00:33,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-04 06:00:33,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:33,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:33,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:33,342 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 67 flow. Second operand 3 states and 369 transitions. [2023-08-04 06:00:33,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 127 flow [2023-08-04 06:00:33,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 127 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:00:33,343 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 75 flow [2023-08-04 06:00:33,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-04 06:00:33,346 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-08-04 06:00:33,346 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 75 flow [2023-08-04 06:00:33,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:33,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:00:33,347 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 06:00:33,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 06:00:33,347 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 06:00:33,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:00:33,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2002861333, now seen corresponding path program 1 times [2023-08-04 06:00:33,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:00:33,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733850569] [2023-08-04 06:00:33,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:33,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:00:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:00:33,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:00:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:00:33,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:00:33,421 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:00:33,421 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 06:00:33,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 06:00:33,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 06:00:33,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 06:00:33,422 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 06:00:33,423 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 06:00:33,424 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 06:00:33,424 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 06:00:33,452 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:00:33,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 159 transitions, 354 flow [2023-08-04 06:00:33,588 INFO L124 PetriNetUnfolderBase]: 93/1418 cut-off events. [2023-08-04 06:00:33,590 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 06:00:33,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 1418 events. 93/1418 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 9893 event pairs, 0 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 1023. Up to 54 conditions per place. [2023-08-04 06:00:33,600 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 159 transitions, 354 flow [2023-08-04 06:00:33,609 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 158 transitions, 348 flow [2023-08-04 06:00:33,610 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:00:33,610 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 158 transitions, 348 flow [2023-08-04 06:00:33,610 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 158 transitions, 348 flow [2023-08-04 06:00:33,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 158 transitions, 348 flow [2023-08-04 06:00:33,740 INFO L124 PetriNetUnfolderBase]: 93/1417 cut-off events. [2023-08-04 06:00:33,741 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-04 06:00:33,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 1417 events. 93/1417 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 9881 event pairs, 0 based on Foata normal form. 0/1252 useless extension candidates. Maximal degree in co-relation 1020. Up to 54 conditions per place. [2023-08-04 06:00:33,775 INFO L119 LiptonReduction]: Number of co-enabled transitions 6644 [2023-08-04 06:00:37,034 INFO L134 LiptonReduction]: Checked pairs total: 20314 [2023-08-04 06:00:37,035 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-08-04 06:00:37,042 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:00:37,050 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;@13be19a5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:00:37,050 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 06:00:37,053 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:00:37,053 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-04 06:00:37,053 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:00:37,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:00:37,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:00:37,054 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 06:00:37,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:00:37,054 INFO L85 PathProgramCache]: Analyzing trace with hash 908664515, now seen corresponding path program 1 times [2023-08-04 06:00:37,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:00:37,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195550825] [2023-08-04 06:00:37,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:37,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:00:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:37,104 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 06:00:37,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:00:37,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195550825] [2023-08-04 06:00:37,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195550825] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:00:37,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:00:37,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:00:37,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941944905] [2023-08-04 06:00:37,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:00:37,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:00:37,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:00:37,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:00:37,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:00:37,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 278 [2023-08-04 06:00:37,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:37,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:00:37,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 278 [2023-08-04 06:00:37,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:01:35,422 INFO L124 PetriNetUnfolderBase]: 468866/641561 cut-off events. [2023-08-04 06:01:35,422 INFO L125 PetriNetUnfolderBase]: For 8764/8764 co-relation queries the response was YES. [2023-08-04 06:01:37,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239411 conditions, 641561 events. 468866/641561 cut-off events. For 8764/8764 co-relation queries the response was YES. Maximal size of possible extension queue 18621. Compared 5125142 event pairs, 380024 based on Foata normal form. 13020/558369 useless extension candidates. Maximal degree in co-relation 266825. Up to 587323 conditions per place. [2023-08-04 06:01:40,283 INFO L140 encePairwiseOnDemand]: 274/278 looper letters, 44 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-04 06:01:40,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 59 transitions, 242 flow [2023-08-04 06:01:40,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:01:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:01:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2023-08-04 06:01:40,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5323741007194245 [2023-08-04 06:01:40,286 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2023-08-04 06:01:40,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2023-08-04 06:01:40,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:01:40,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2023-08-04 06:01:40,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:40,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:40,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:40,289 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 142 flow. Second operand 3 states and 444 transitions. [2023-08-04 06:01:40,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 59 transitions, 242 flow [2023-08-04 06:01:40,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 59 transitions, 238 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 06:01:40,299 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 148 flow [2023-08-04 06:01:40,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2023-08-04 06:01:40,300 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 3 predicate places. [2023-08-04 06:01:40,300 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 148 flow [2023-08-04 06:01:40,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:40,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:01:40,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:01:40,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 06:01:40,301 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 06:01:40,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:01:40,302 INFO L85 PathProgramCache]: Analyzing trace with hash 415759306, now seen corresponding path program 1 times [2023-08-04 06:01:40,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:01:40,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459200056] [2023-08-04 06:01:40,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:01:40,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:01:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:01:40,343 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 06:01:40,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:01:40,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459200056] [2023-08-04 06:01:40,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459200056] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:01:40,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62054652] [2023-08-04 06:01:40,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:01:40,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:01:40,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:01:40,347 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 06:01:40,349 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 06:01:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:01:40,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:01:40,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:01:40,447 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 06:01:40,447 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:01:40,461 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 06:01:40,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62054652] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:01:40,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:01:40,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:01:40,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073705259] [2023-08-04 06:01:40,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:01:40,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:01:40,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:01:40,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:01:40,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:01:40,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 278 [2023-08-04 06:01:40,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:40,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:01:40,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 278 [2023-08-04 06:01:40,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:02:28,872 INFO L124 PetriNetUnfolderBase]: 389314/527541 cut-off events. [2023-08-04 06:02:28,873 INFO L125 PetriNetUnfolderBase]: For 6392/6392 co-relation queries the response was YES. [2023-08-04 06:02:31,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019510 conditions, 527541 events. 389314/527541 cut-off events. For 6392/6392 co-relation queries the response was YES. Maximal size of possible extension queue 15623. Compared 4044864 event pairs, 247180 based on Foata normal form. 4/450601 useless extension candidates. Maximal degree in co-relation 266714. Up to 484009 conditions per place. [2023-08-04 06:02:34,841 INFO L140 encePairwiseOnDemand]: 274/278 looper letters, 49 selfloop transitions, 3 changer transitions 1/66 dead transitions. [2023-08-04 06:02:34,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 276 flow [2023-08-04 06:02:34,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:02:34,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:02:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 578 transitions. [2023-08-04 06:02:34,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197841726618705 [2023-08-04 06:02:34,845 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 578 transitions. [2023-08-04 06:02:34,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 578 transitions. [2023-08-04 06:02:34,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:02:34,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 578 transitions. [2023-08-04 06:02:34,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:02:34,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:02:34,850 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:02:34,850 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 148 flow. Second operand 4 states and 578 transitions. [2023-08-04 06:02:34,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 276 flow [2023-08-04 06:02:34,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:02:34,853 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 160 flow [2023-08-04 06:02:34,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=74, PETRI_TRANSITIONS=55} [2023-08-04 06:02:34,853 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 7 predicate places. [2023-08-04 06:02:34,854 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 160 flow [2023-08-04 06:02:34,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:02:34,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:02:34,855 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:02:34,868 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 06:02:35,061 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 06:02:35,062 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 06:02:35,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:02:35,062 INFO L85 PathProgramCache]: Analyzing trace with hash -604424046, now seen corresponding path program 1 times [2023-08-04 06:02:35,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:02:35,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928233409] [2023-08-04 06:02:35,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:02:35,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:02:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:02:35,221 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 06:02:35,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:02:35,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928233409] [2023-08-04 06:02:35,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928233409] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:02:35,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:02:35,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:02:35,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533485942] [2023-08-04 06:02:35,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:02:35,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:02:35,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:02:35,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:02:35,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:02:35,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 278 [2023-08-04 06:02:35,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 55 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:02:35,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:02:35,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 278 [2023-08-04 06:02:35,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:03:11,903 INFO L124 PetriNetUnfolderBase]: 335018/441133 cut-off events. [2023-08-04 06:03:11,903 INFO L125 PetriNetUnfolderBase]: For 5801/5801 co-relation queries the response was YES. [2023-08-04 06:03:13,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865246 conditions, 441133 events. 335018/441133 cut-off events. For 5801/5801 co-relation queries the response was YES. Maximal size of possible extension queue 13888. Compared 3176881 event pairs, 55610 based on Foata normal form. 0/386573 useless extension candidates. Maximal degree in co-relation 226605. Up to 383649 conditions per place. [2023-08-04 06:03:15,510 INFO L140 encePairwiseOnDemand]: 273/278 looper letters, 67 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2023-08-04 06:03:15,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 83 transitions, 369 flow [2023-08-04 06:03:15,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:03:15,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:03:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2023-08-04 06:03:15,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5707434052757794 [2023-08-04 06:03:15,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 476 transitions. [2023-08-04 06:03:15,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 476 transitions. [2023-08-04 06:03:15,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:03:15,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 476 transitions. [2023-08-04 06:03:15,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:03:15,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:03:15,517 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:03:15,517 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 160 flow. Second operand 3 states and 476 transitions. [2023-08-04 06:03:15,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 83 transitions, 369 flow [2023-08-04 06:03:15,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 83 transitions, 362 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 06:03:15,520 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 174 flow [2023-08-04 06:03:15,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2023-08-04 06:03:15,521 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 7 predicate places. [2023-08-04 06:03:15,521 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 174 flow [2023-08-04 06:03:15,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:03:15,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:03:15,522 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:03:15,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 06:03:15,522 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 06:03:15,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:03:15,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1013805614, now seen corresponding path program 1 times [2023-08-04 06:03:15,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:03:15,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883992054] [2023-08-04 06:03:15,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:03:15,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:03:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:03:15,564 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 06:03:15,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:03:15,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883992054] [2023-08-04 06:03:15,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883992054] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:03:15,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:03:15,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 06:03:15,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231406761] [2023-08-04 06:03:15,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:03:15,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:03:15,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:03:15,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:03:15,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:03:15,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 278 [2023-08-04 06:03:15,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:03:15,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:03:15,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 278 [2023-08-04 06:03:15,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:03:58,622 INFO L124 PetriNetUnfolderBase]: 326858/450157 cut-off events. [2023-08-04 06:03:58,623 INFO L125 PetriNetUnfolderBase]: For 32390/32390 co-relation queries the response was YES. [2023-08-04 06:04:00,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919006 conditions, 450157 events. 326858/450157 cut-off events. For 32390/32390 co-relation queries the response was YES. Maximal size of possible extension queue 14055. Compared 3553891 event pairs, 274810 based on Foata normal form. 0/397933 useless extension candidates. Maximal degree in co-relation 239669. Up to 406153 conditions per place. [2023-08-04 06:04:02,189 INFO L140 encePairwiseOnDemand]: 275/278 looper letters, 53 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-04 06:04:02,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 68 transitions, 309 flow [2023-08-04 06:04:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:04:02,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:04:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-08-04 06:04:02,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5383693045563549 [2023-08-04 06:04:02,191 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-08-04 06:04:02,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-08-04 06:04:02,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:04:02,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-08-04 06:04:02,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:04:02,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:04:02,196 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:04:02,196 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 174 flow. Second operand 3 states and 449 transitions. [2023-08-04 06:04:02,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 68 transitions, 309 flow [2023-08-04 06:04:02,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 68 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:04:02,233 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 183 flow [2023-08-04 06:04:02,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2023-08-04 06:04:02,233 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 9 predicate places. [2023-08-04 06:04:02,234 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 183 flow [2023-08-04 06:04:02,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:04:02,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:04:02,234 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:04:02,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 06:04:02,234 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 06:04:02,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:04:02,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1798318950, now seen corresponding path program 1 times [2023-08-04 06:04:02,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:04:02,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978020104] [2023-08-04 06:04:02,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:04:02,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:04:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:04:02,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:04:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:04:02,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:04:02,292 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:04:02,295 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 06:04:02,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 06:04:02,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 06:04:02,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 06:04:02,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 06:04:02,296 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 06:04:02,297 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 06:04:02,300 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 06:04:02,301 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 06:04:02,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 06:04:02 BasicIcfg [2023-08-04 06:04:02,371 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 06:04:02,371 INFO L158 Benchmark]: Toolchain (without parser) took 219307.36ms. Allocated memory was 482.3MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 435.1MB in the beginning and 12.2GB in the end (delta: -11.7GB). Peak memory consumption was 3.8GB. Max. memory is 16.0GB. [2023-08-04 06:04:02,371 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 337.6MB. Free memory is still 292.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 06:04:02,371 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.41ms. Allocated memory is still 482.3MB. Free memory was 434.8MB in the beginning and 411.5MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 06:04:02,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.82ms. Allocated memory is still 482.3MB. Free memory was 411.5MB in the beginning and 408.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-04 06:04:02,372 INFO L158 Benchmark]: Boogie Preprocessor took 33.89ms. Allocated memory is still 482.3MB. Free memory was 408.8MB in the beginning and 406.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:04:02,372 INFO L158 Benchmark]: RCFGBuilder took 714.01ms. Allocated memory is still 482.3MB. Free memory was 406.7MB in the beginning and 421.6MB in the end (delta: -14.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.0GB. [2023-08-04 06:04:02,372 INFO L158 Benchmark]: TraceAbstraction took 217936.73ms. Allocated memory was 482.3MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 420.9MB in the beginning and 12.2GB in the end (delta: -11.7GB). Peak memory consumption was 3.8GB. Max. memory is 16.0GB. [2023-08-04 06:04:02,373 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 337.6MB. Free memory is still 292.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 523.41ms. Allocated memory is still 482.3MB. Free memory was 434.8MB in the beginning and 411.5MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 79.82ms. Allocated memory is still 482.3MB. Free memory was 411.5MB in the beginning and 408.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.89ms. Allocated memory is still 482.3MB. Free memory was 408.8MB in the beginning and 406.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 714.01ms. Allocated memory is still 482.3MB. Free memory was 406.7MB in the beginning and 421.6MB in the end (delta: -14.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.0GB. * TraceAbstraction took 217936.73ms. Allocated memory was 482.3MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 420.9MB in the beginning and 12.2GB in the end (delta: -11.7GB). Peak memory consumption was 3.8GB. 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.6s, 134 PlacesBefore, 40 PlacesAfterwards, 132 TransitionsBefore, 34 TransitionsAfterwards, 2730 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 112 TotalNumberOfCompositions, 6505 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3450, independent: 3284, independent conditional: 0, independent unconditional: 3284, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1426, independent: 1395, independent conditional: 0, independent unconditional: 1395, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3450, independent: 1889, independent conditional: 0, independent unconditional: 1889, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 1426, unknown conditional: 0, unknown unconditional: 1426] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 109 PlacesBefore, 33 PlacesAfterwards, 104 TransitionsBefore, 26 TransitionsAfterwards, 1408 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 84 TotalNumberOfCompositions, 3300 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1617, independent: 1497, independent conditional: 0, independent unconditional: 1497, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 697, independent: 683, independent conditional: 0, independent unconditional: 683, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1617, independent: 814, independent conditional: 0, independent unconditional: 814, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 697, unknown conditional: 0, unknown unconditional: 697] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 166 PlacesBefore, 67 PlacesAfterwards, 158 TransitionsBefore, 55 TransitionsAfterwards, 6644 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 119 TotalNumberOfCompositions, 20314 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6792, independent: 6473, independent conditional: 0, independent unconditional: 6473, dependent: 319, dependent conditional: 0, dependent unconditional: 319, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3040, independent: 2991, independent conditional: 0, independent unconditional: 2991, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6792, independent: 3482, independent conditional: 0, independent unconditional: 3482, dependent: 270, dependent conditional: 0, dependent unconditional: 270, unknown: 3040, unknown conditional: 0, unknown unconditional: 3040] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 246, Positive conditional cache size: 0, Positive unconditional cache size: 246, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff1_thd0; [L732] 0 _Bool x$r_buff1_thd1; [L733] 0 _Bool x$r_buff1_thd2; [L734] 0 _Bool x$r_buff1_thd3; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L841] 0 pthread_t t916[2]; [L842] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t916={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L842] COND TRUE 0 asdf<2 [L842] FCALL, FORK 0 pthread_create(&t916[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t916[asdf], ((void *)0), P0, ((void *)0))=-4, t916={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L842] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t916={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L842] COND TRUE 0 asdf<2 [L842] FCALL, FORK 0 pthread_create(&t916[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t916[asdf], ((void *)0), P0, ((void *)0))=-3, t916={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L842] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t916={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L842] COND FALSE 0 !(asdf<2) [L843] 0 pthread_t t917[2]; [L844] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t916={5:0}, t917={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L844] COND TRUE 0 asdf<2 [L844] FCALL, FORK 0 pthread_create(&t917[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t917[asdf], ((void *)0), P1, ((void *)0))=-2, t916={5:0}, t917={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L778] 3 x$w_buff1 = x$w_buff0 [L779] 3 x$w_buff0 = 1 [L780] 3 x$w_buff1_used = x$w_buff0_used [L781] 3 x$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L783] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L844] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t916={5:0}, t917={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L844] COND TRUE 0 asdf<2 [L844] FCALL, FORK 0 pthread_create(&t917[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t917[asdf], ((void *)0), P1, ((void *)0))=-1, t916={5:0}, t917={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L778] 4 x$w_buff1 = x$w_buff0 [L779] 4 x$w_buff0 = 1 [L780] 4 x$w_buff1_used = x$w_buff0_used [L781] 4 x$w_buff0_used = (_Bool)1 [L782] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=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 7 procedures, 155 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: 5.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 1 mSDtfsCounter, 95 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=87occurred 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, 159 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 10 procedures, 181 locations, 7 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: 208.8s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 204.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 435 IncrementalHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 8 mSDtfsCounter, 435 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=183occurred 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.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 160 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 7 procedures, 155 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: 3.5s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.1s 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, 50 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 50 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=75occurred 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, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 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 06:04:02,396 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...