/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_mix010.oepc_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:36:34,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:36:34,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:36:34,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:36:34,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:36:34,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:36:34,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:36:34,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:36:34,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:36:34,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:36:34,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:36:34,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:36:34,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:36:34,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:36:34,451 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:36:34,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:36:34,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:36:34,452 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:36:34,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:36:34,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:36:34,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:36:34,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:36:34,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:36:34,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:36:34,454 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:36:34,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:36:34,455 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:36:34,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:36:34,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:36:34,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:36:34,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:36:34,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:36:34,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:36:34,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:36:34,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:36:34,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:36:34,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:36:34,458 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:36:34,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:36:34,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:36:34,458 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:36:34,460 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 05:36:34,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:36:34,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:36:34,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:36:34,701 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:36:34,701 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:36:34,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix010.oepc_bound2.i [2023-08-04 05:36:35,894 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:36:36,123 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:36:36,123 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix010.oepc_bound2.i [2023-08-04 05:36:36,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8ca08be3/f8b7f1e0c9bb4931a2da776ba6320cad/FLAG4091468b6 [2023-08-04 05:36:36,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8ca08be3/f8b7f1e0c9bb4931a2da776ba6320cad [2023-08-04 05:36:36,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:36:36,154 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:36:36,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:36:36,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:36:36,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:36:36,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:36:36" (1/1) ... [2023-08-04 05:36:36,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e440a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:36, skipping insertion in model container [2023-08-04 05:36:36,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:36:36" (1/1) ... [2023-08-04 05:36:36,208 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:36:36,394 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_mix010.oepc_bound2.i[945,958] [2023-08-04 05:36:36,608 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:36:36,616 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:36:36,626 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_mix010.oepc_bound2.i[945,958] [2023-08-04 05:36:36,643 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:36:36,651 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:36:36,703 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:36:36,735 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:36:36,735 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:36:36,741 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:36:36,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:36 WrapperNode [2023-08-04 05:36:36,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:36:36,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:36:36,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:36:36,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:36:36,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:36" (1/1) ... [2023-08-04 05:36:36,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:36" (1/1) ... [2023-08-04 05:36:36,816 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 156 [2023-08-04 05:36:36,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:36:36,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:36:36,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:36:36,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:36:36,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:36" (1/1) ... [2023-08-04 05:36:36,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:36" (1/1) ... [2023-08-04 05:36:36,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:36" (1/1) ... [2023-08-04 05:36:36,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:36" (1/1) ... [2023-08-04 05:36:36,850 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:36" (1/1) ... [2023-08-04 05:36:36,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:36" (1/1) ... [2023-08-04 05:36:36,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:36" (1/1) ... [2023-08-04 05:36:36,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:36" (1/1) ... [2023-08-04 05:36:36,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:36:36,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:36:36,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:36:36,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:36:36,872 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:36" (1/1) ... [2023-08-04 05:36:36,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:36:36,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:36:36,905 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 05:36:36,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 05:36:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:36:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:36:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:36:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:36:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:36:36,943 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 05:36:36,943 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 05:36:36,943 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 05:36:36,943 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 05:36:36,943 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 05:36:36,943 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 05:36:36,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:36:36,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:36:36,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:36:36,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:36:36,945 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 05:36:37,073 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:36:37,075 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:36:37,382 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:36:37,512 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:36:37,512 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 05:36:37,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:36:37 BoogieIcfgContainer [2023-08-04 05:36:37,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:36:37,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:36:37,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:36:37,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:36:37,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:36:36" (1/3) ... [2023-08-04 05:36:37,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c2df2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:36:37, skipping insertion in model container [2023-08-04 05:36:37,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:36" (2/3) ... [2023-08-04 05:36:37,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c2df2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:36:37, skipping insertion in model container [2023-08-04 05:36:37,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:36:37" (3/3) ... [2023-08-04 05:36:37,522 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix010.oepc_bound2.i [2023-08-04 05:36:37,529 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:36:37,537 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:36:37,537 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 05:36:37,537 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:36:37,595 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:36:37,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:36:37,764 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-04 05:36:37,764 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:37,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 460 events. 30/460 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2029 event pairs, 0 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 277. Up to 16 conditions per place. [2023-08-04 05:36:37,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:36:37,778 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 136 transitions, 287 flow [2023-08-04 05:36:37,781 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:36:37,793 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 136 transitions, 287 flow [2023-08-04 05:36:37,795 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 136 transitions, 287 flow [2023-08-04 05:36:37,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:36:37,868 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-04 05:36:37,868 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:37,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 460 events. 30/460 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2029 event pairs, 0 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 277. Up to 16 conditions per place. [2023-08-04 05:36:37,877 INFO L119 LiptonReduction]: Number of co-enabled transitions 3116 [2023-08-04 05:36:41,328 INFO L134 LiptonReduction]: Checked pairs total: 8111 [2023-08-04 05:36:41,329 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-08-04 05:36:41,340 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:36:41,345 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;@396c670d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:36:41,345 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:36:41,348 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:36:41,348 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-04 05:36:41,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:41,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:36:41,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 05:36:41,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:36:41,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:36:41,353 INFO L85 PathProgramCache]: Analyzing trace with hash 17912630, now seen corresponding path program 1 times [2023-08-04 05:36:41,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:36:41,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463915850] [2023-08-04 05:36:41,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:41,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:36:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:36:41,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:36:41,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463915850] [2023-08-04 05:36:41,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463915850] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:36:41,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:36:41,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:36:41,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448544974] [2023-08-04 05:36:41,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:36:41,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:36:41,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:36:41,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:36:41,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:36:41,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 249 [2023-08-04 05:36:41,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:41,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:36:41,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 249 [2023-08-04 05:36:41,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:36:42,474 INFO L124 PetriNetUnfolderBase]: 3071/5199 cut-off events. [2023-08-04 05:36:42,475 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-08-04 05:36:42,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10049 conditions, 5199 events. 3071/5199 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 33620 event pairs, 824 based on Foata normal form. 180/4778 useless extension candidates. Maximal degree in co-relation 8470. Up to 3262 conditions per place. [2023-08-04 05:36:42,508 INFO L140 encePairwiseOnDemand]: 245/249 looper letters, 46 selfloop transitions, 2 changer transitions 8/59 dead transitions. [2023-08-04 05:36:42,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 245 flow [2023-08-04 05:36:42,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:36:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:36:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-08-04 05:36:42,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5528781793842035 [2023-08-04 05:36:42,528 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-08-04 05:36:42,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-08-04 05:36:42,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:36:42,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-08-04 05:36:42,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:42,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:42,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:42,545 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 89 flow. Second operand 3 states and 413 transitions. [2023-08-04 05:36:42,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 245 flow [2023-08-04 05:36:42,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 245 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:36:42,552 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 73 flow [2023-08-04 05:36:42,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-08-04 05:36:42,559 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2023-08-04 05:36:42,560 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 73 flow [2023-08-04 05:36:42,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:42,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:36:42,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:36:42,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 05:36:42,561 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:36:42,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:36:42,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1347502609, now seen corresponding path program 1 times [2023-08-04 05:36:42,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:36:42,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339708486] [2023-08-04 05:36:42,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:42,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:36:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:36:42,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:36:42,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339708486] [2023-08-04 05:36:42,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339708486] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:36:42,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:36:42,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:36:42,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376916701] [2023-08-04 05:36:42,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:36:42,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:36:42,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:36:42,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:36:42,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:36:42,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 249 [2023-08-04 05:36:42,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:42,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:36:42,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 249 [2023-08-04 05:36:42,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:36:43,145 INFO L124 PetriNetUnfolderBase]: 2059/3278 cut-off events. [2023-08-04 05:36:43,146 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2023-08-04 05:36:43,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6734 conditions, 3278 events. 2059/3278 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 17555 event pairs, 1264 based on Foata normal form. 0/3074 useless extension candidates. Maximal degree in co-relation 6719. Up to 3120 conditions per place. [2023-08-04 05:36:43,161 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 28 selfloop transitions, 2 changer transitions 1/34 dead transitions. [2023-08-04 05:36:43,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 145 flow [2023-08-04 05:36:43,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:36:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:36:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-08-04 05:36:43,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087014725568942 [2023-08-04 05:36:43,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-08-04 05:36:43,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-08-04 05:36:43,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:36:43,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-08-04 05:36:43,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:43,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:43,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:43,167 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 73 flow. Second operand 3 states and 380 transitions. [2023-08-04 05:36:43,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 145 flow [2023-08-04 05:36:43,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 139 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:36:43,169 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 77 flow [2023-08-04 05:36:43,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-04 05:36:43,170 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-04 05:36:43,170 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 77 flow [2023-08-04 05:36:43,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:43,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:36:43,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:36:43,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 05:36:43,171 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:36:43,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:36:43,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1940077393, now seen corresponding path program 1 times [2023-08-04 05:36:43,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:36:43,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645669659] [2023-08-04 05:36:43,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:43,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:36:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:36:43,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:36:43,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645669659] [2023-08-04 05:36:43,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645669659] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:36:43,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978252181] [2023-08-04 05:36:43,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:43,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:36:43,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:36:43,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:36:43,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 05:36:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:43,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:36:43,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:36:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:36:43,349 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:36:43,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978252181] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:36:43,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:36:43,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:36:43,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398784505] [2023-08-04 05:36:43,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:36:43,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:36:43,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:36:43,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:36:43,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:36:43,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 249 [2023-08-04 05:36:43,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:43,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:36:43,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 249 [2023-08-04 05:36:43,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:36:43,670 INFO L124 PetriNetUnfolderBase]: 1840/2867 cut-off events. [2023-08-04 05:36:43,671 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 05:36:43,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5679 conditions, 2867 events. 1840/2867 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14859 event pairs, 1131 based on Foata normal form. 0/2706 useless extension candidates. Maximal degree in co-relation 5663. Up to 2694 conditions per place. [2023-08-04 05:36:43,689 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 32 selfloop transitions, 2 changer transitions 1/38 dead transitions. [2023-08-04 05:36:43,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 163 flow [2023-08-04 05:36:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:36:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:36:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-04 05:36:43,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5140562248995983 [2023-08-04 05:36:43,691 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-04 05:36:43,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-04 05:36:43,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:36:43,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-04 05:36:43,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:43,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:43,694 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:43,694 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 77 flow. Second operand 3 states and 384 transitions. [2023-08-04 05:36:43,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 163 flow [2023-08-04 05:36:43,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 159 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:36:43,696 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 81 flow [2023-08-04 05:36:43,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-08-04 05:36:43,697 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-08-04 05:36:43,697 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 81 flow [2023-08-04 05:36:43,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:43,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:36:43,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:36:43,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 05:36:43,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:36:43,906 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:36:43,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:36:43,906 INFO L85 PathProgramCache]: Analyzing trace with hash -640391570, now seen corresponding path program 1 times [2023-08-04 05:36:43,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:36:43,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062928056] [2023-08-04 05:36:43,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:43,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:36:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:36:43,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:36:43,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062928056] [2023-08-04 05:36:43,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062928056] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:36:43,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738891497] [2023-08-04 05:36:43,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:43,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:36:43,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:36:43,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:36:43,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 05:36:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:44,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:36:44,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:36:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:36:44,069 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:36:44,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738891497] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:36:44,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:36:44,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:36:44,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485009956] [2023-08-04 05:36:44,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:36:44,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:36:44,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:36:44,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:36:44,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:36:44,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 249 [2023-08-04 05:36:44,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:44,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:36:44,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 249 [2023-08-04 05:36:44,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:36:44,423 INFO L124 PetriNetUnfolderBase]: 1716/2591 cut-off events. [2023-08-04 05:36:44,424 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-08-04 05:36:44,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5259 conditions, 2591 events. 1716/2591 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13030 event pairs, 1019 based on Foata normal form. 0/2490 useless extension candidates. Maximal degree in co-relation 5243. Up to 2182 conditions per place. [2023-08-04 05:36:44,437 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 36 selfloop transitions, 2 changer transitions 1/42 dead transitions. [2023-08-04 05:36:44,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 183 flow [2023-08-04 05:36:44,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:36:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:36:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-04 05:36:44,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5194109772423026 [2023-08-04 05:36:44,439 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-04 05:36:44,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-04 05:36:44,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:36:44,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-04 05:36:44,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:44,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:44,443 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:44,443 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 81 flow. Second operand 3 states and 388 transitions. [2023-08-04 05:36:44,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 183 flow [2023-08-04 05:36:44,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 179 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:36:44,444 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 85 flow [2023-08-04 05:36:44,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-08-04 05:36:44,445 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2023-08-04 05:36:44,445 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 85 flow [2023-08-04 05:36:44,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:44,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:36:44,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:36:44,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 05:36:44,652 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,SelfDestructingSolverStorable3 [2023-08-04 05:36:44,652 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:36:44,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:36:44,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1452110590, now seen corresponding path program 1 times [2023-08-04 05:36:44,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:36:44,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312873837] [2023-08-04 05:36:44,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:44,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:36:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:36:44,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:36:44,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312873837] [2023-08-04 05:36:44,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312873837] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:36:44,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142126197] [2023-08-04 05:36:44,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:44,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:36:44,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:36:44,742 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:36:44,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 05:36:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:44,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:36:44,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:36:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:36:44,876 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:36:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:36:44,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142126197] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:36:44,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:36:44,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:36:44,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714391972] [2023-08-04 05:36:44,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:36:44,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:36:44,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:36:44,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:36:44,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:36:44,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 249 [2023-08-04 05:36:44,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 85 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:44,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:36:44,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 249 [2023-08-04 05:36:44,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:36:44,943 INFO L124 PetriNetUnfolderBase]: 6/21 cut-off events. [2023-08-04 05:36:44,944 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:44,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 21 events. 6/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 4/25 useless extension candidates. Maximal degree in co-relation 47. Up to 14 conditions per place. [2023-08-04 05:36:44,944 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2023-08-04 05:36:44,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 12 transitions, 51 flow [2023-08-04 05:36:44,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:36:44,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:36:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2023-08-04 05:36:44,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738955823293173 [2023-08-04 05:36:44,946 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 472 transitions. [2023-08-04 05:36:44,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 472 transitions. [2023-08-04 05:36:44,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:36:44,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 472 transitions. [2023-08-04 05:36:44,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:44,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:44,949 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:44,949 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 85 flow. Second operand 4 states and 472 transitions. [2023-08-04 05:36:44,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 12 transitions, 51 flow [2023-08-04 05:36:44,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 12 transitions, 49 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:36:44,950 INFO L231 Difference]: Finished difference. Result has 19 places, 0 transitions, 0 flow [2023-08-04 05:36:44,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=19, PETRI_TRANSITIONS=0} [2023-08-04 05:36:44,952 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -24 predicate places. [2023-08-04 05:36:44,952 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 0 transitions, 0 flow [2023-08-04 05:36:44,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:44,955 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 05:36:44,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 05:36:44,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 05:36:44,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 05:36:45,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:36:45,163 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 05:36:45,165 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 05:36:45,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:36:45,206 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-04 05:36:45,207 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:45,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 460 events. 30/460 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2029 event pairs, 0 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 277. Up to 16 conditions per place. [2023-08-04 05:36:45,208 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:36:45,209 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 107 transitions, 229 flow [2023-08-04 05:36:45,209 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:36:45,209 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 107 transitions, 229 flow [2023-08-04 05:36:45,210 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 107 transitions, 229 flow [2023-08-04 05:36:45,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 107 transitions, 229 flow [2023-08-04 05:36:45,226 INFO L124 PetriNetUnfolderBase]: 6/228 cut-off events. [2023-08-04 05:36:45,226 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:45,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 228 events. 6/228 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 679 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 161. Up to 8 conditions per place. [2023-08-04 05:36:45,229 INFO L119 LiptonReduction]: Number of co-enabled transitions 1666 [2023-08-04 05:36:47,977 INFO L134 LiptonReduction]: Checked pairs total: 3842 [2023-08-04 05:36:47,977 INFO L136 LiptonReduction]: Total number of compositions: 86 [2023-08-04 05:36:47,979 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 05:36:47,979 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;@396c670d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:36:47,980 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:36:47,982 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:36:47,983 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2023-08-04 05:36:47,983 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:47,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:36:47,983 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 05:36:47,983 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 05:36:47,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:36:47,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1713574154, now seen corresponding path program 1 times [2023-08-04 05:36:47,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:36:47,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916792144] [2023-08-04 05:36:47,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:47,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:36:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:36:48,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:36:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:36:48,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:36:48,036 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:36:48,037 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 05:36:48,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 05:36:48,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 05:36:48,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 05:36:48,037 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 05:36:48,039 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 05:36:48,039 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 05:36:48,039 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 05:36:48,068 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:36:48,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 164 transitions, 364 flow [2023-08-04 05:36:48,201 INFO L124 PetriNetUnfolderBase]: 93/1411 cut-off events. [2023-08-04 05:36:48,201 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 05:36:48,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 1411 events. 93/1411 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9793 event pairs, 0 based on Foata normal form. 0/1250 useless extension candidates. Maximal degree in co-relation 1025. Up to 54 conditions per place. [2023-08-04 05:36:48,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 164 transitions, 364 flow [2023-08-04 05:36:48,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 164 transitions, 364 flow [2023-08-04 05:36:48,217 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:36:48,218 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 164 transitions, 364 flow [2023-08-04 05:36:48,218 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 164 transitions, 364 flow [2023-08-04 05:36:48,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 164 transitions, 364 flow [2023-08-04 05:36:48,362 INFO L124 PetriNetUnfolderBase]: 93/1411 cut-off events. [2023-08-04 05:36:48,362 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 05:36:48,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 1411 events. 93/1411 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9793 event pairs, 0 based on Foata normal form. 0/1250 useless extension candidates. Maximal degree in co-relation 1025. Up to 54 conditions per place. [2023-08-04 05:36:48,398 INFO L119 LiptonReduction]: Number of co-enabled transitions 7632 [2023-08-04 05:36:51,589 INFO L134 LiptonReduction]: Checked pairs total: 25841 [2023-08-04 05:36:51,589 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-08-04 05:36:51,592 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:36:51,595 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;@396c670d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:36:51,595 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 05:36:51,597 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:36:51,597 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-04 05:36:51,598 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:51,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:36:51,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 05:36:51,598 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:36:51,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:36:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash 30140315, now seen corresponding path program 1 times [2023-08-04 05:36:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:36:51,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543440013] [2023-08-04 05:36:51,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:51,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:36:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:51,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:36:51,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:36:51,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543440013] [2023-08-04 05:36:51,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543440013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:36:51,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:36:51,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:36:51,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825578108] [2023-08-04 05:36:51,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:36:51,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:36:51,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:36:51,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:36:51,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:36:51,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 283 [2023-08-04 05:36:51,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:51,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:36:51,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 283 [2023-08-04 05:36:51,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:38:08,789 INFO L124 PetriNetUnfolderBase]: 633758/832639 cut-off events. [2023-08-04 05:38:08,789 INFO L125 PetriNetUnfolderBase]: For 9452/9452 co-relation queries the response was YES. [2023-08-04 05:38:11,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635962 conditions, 832639 events. 633758/832639 cut-off events. For 9452/9452 co-relation queries the response was YES. Maximal size of possible extension queue 24985. Compared 6539801 event pairs, 105182 based on Foata normal form. 17577/755138 useless extension candidates. Maximal degree in co-relation 1377074. Up to 729279 conditions per place. [2023-08-04 05:38:14,442 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 75 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2023-08-04 05:38:14,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 94 transitions, 401 flow [2023-08-04 05:38:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:38:14,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:38:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2023-08-04 05:38:14,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5842167255594818 [2023-08-04 05:38:14,445 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 496 transitions. [2023-08-04 05:38:14,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions. [2023-08-04 05:38:14,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:38:14,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions. [2023-08-04 05:38:14,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:38:14,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:38:14,451 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:38:14,451 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 156 flow. Second operand 3 states and 496 transitions. [2023-08-04 05:38:14,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 94 transitions, 401 flow [2023-08-04 05:38:14,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 94 transitions, 395 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-04 05:38:14,463 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 169 flow [2023-08-04 05:38:14,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2023-08-04 05:38:14,464 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 3 predicate places. [2023-08-04 05:38:14,464 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 169 flow [2023-08-04 05:38:14,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:38:14,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:38:14,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:38:14,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 05:38:14,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:38:14,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:38:14,465 INFO L85 PathProgramCache]: Analyzing trace with hash 416071361, now seen corresponding path program 1 times [2023-08-04 05:38:14,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:38:14,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687335902] [2023-08-04 05:38:14,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:38:14,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:38:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:38:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:38:14,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:38:14,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687335902] [2023-08-04 05:38:14,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687335902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:38:14,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:38:14,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:38:14,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202772687] [2023-08-04 05:38:14,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:38:14,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:38:14,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:38:14,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:38:14,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:38:14,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 283 [2023-08-04 05:38:14,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:38:14,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:38:14,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 283 [2023-08-04 05:38:14,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:39:34,752 INFO L124 PetriNetUnfolderBase]: 618374/806902 cut-off events. [2023-08-04 05:39:34,753 INFO L125 PetriNetUnfolderBase]: For 61828/61828 co-relation queries the response was YES. [2023-08-04 05:39:37,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695309 conditions, 806902 events. 618374/806902 cut-off events. For 61828/61828 co-relation queries the response was YES. Maximal size of possible extension queue 23297. Compared 6000463 event pairs, 518026 based on Foata normal form. 0/700564 useless extension candidates. Maximal degree in co-relation 1116494. Up to 771849 conditions per place. [2023-08-04 05:39:40,710 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 48 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-04 05:39:40,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 66 transitions, 282 flow [2023-08-04 05:39:40,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:39:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:39:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2023-08-04 05:39:40,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5347467608951708 [2023-08-04 05:39:40,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2023-08-04 05:39:40,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2023-08-04 05:39:40,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:39:40,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2023-08-04 05:39:40,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:39:40,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:39:40,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:39:40,715 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 169 flow. Second operand 3 states and 454 transitions. [2023-08-04 05:39:40,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 66 transitions, 282 flow [2023-08-04 05:39:40,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 66 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:39:40,717 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 178 flow [2023-08-04 05:39:40,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2023-08-04 05:39:40,718 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2023-08-04 05:39:40,718 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 178 flow [2023-08-04 05:39:40,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:39:40,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:39:40,719 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:39:40,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 05:39:40,719 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:39:40,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:39:40,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1182881578, now seen corresponding path program 1 times [2023-08-04 05:39:40,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:39:40,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659886769] [2023-08-04 05:39:40,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:39:40,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:39:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:39:40,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:39:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:39:40,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:39:40,765 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:39:40,766 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 05:39:40,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 05:39:40,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 05:39:40,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 05:39:40,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 05:39:40,766 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 05:39:40,767 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 05:39:40,769 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 05:39:40,769 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 05:39:40,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 05:39:40 BasicIcfg [2023-08-04 05:39:40,830 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 05:39:40,830 INFO L158 Benchmark]: Toolchain (without parser) took 184675.85ms. Allocated memory was 608.2MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 551.7MB in the beginning and 9.4GB in the end (delta: -8.9GB). Peak memory consumption was 6.5GB. Max. memory is 16.0GB. [2023-08-04 05:39:40,830 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 371.2MB. Free memory is still 315.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 05:39:40,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 587.37ms. Allocated memory is still 608.2MB. Free memory was 551.5MB in the beginning and 527.6MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-04 05:39:40,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.78ms. Allocated memory is still 608.2MB. Free memory was 527.6MB in the beginning and 525.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:39:40,831 INFO L158 Benchmark]: Boogie Preprocessor took 52.60ms. Allocated memory is still 608.2MB. Free memory was 525.2MB in the beginning and 523.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:39:40,831 INFO L158 Benchmark]: RCFGBuilder took 643.43ms. Allocated memory is still 608.2MB. Free memory was 523.1MB in the beginning and 559.0MB in the end (delta: -35.9MB). Peak memory consumption was 36.6MB. Max. memory is 16.0GB. [2023-08-04 05:39:40,832 INFO L158 Benchmark]: TraceAbstraction took 183313.28ms. Allocated memory was 608.2MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 559.0MB in the beginning and 9.4GB in the end (delta: -8.8GB). Peak memory consumption was 6.5GB. Max. memory is 16.0GB. [2023-08-04 05:39:40,833 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 371.2MB. Free memory is still 315.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 587.37ms. Allocated memory is still 608.2MB. Free memory was 551.5MB in the beginning and 527.6MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 73.78ms. Allocated memory is still 608.2MB. Free memory was 527.6MB in the beginning and 525.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 52.60ms. Allocated memory is still 608.2MB. Free memory was 525.2MB in the beginning and 523.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 643.43ms. Allocated memory is still 608.2MB. Free memory was 523.1MB in the beginning and 559.0MB in the end (delta: -35.9MB). Peak memory consumption was 36.6MB. Max. memory is 16.0GB. * TraceAbstraction took 183313.28ms. Allocated memory was 608.2MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 559.0MB in the beginning and 9.4GB in the end (delta: -8.8GB). Peak memory consumption was 6.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 138 PlacesBefore, 43 PlacesAfterwards, 136 TransitionsBefore, 37 TransitionsAfterwards, 3116 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 113 TotalNumberOfCompositions, 8111 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3616, independent: 3425, independent conditional: 0, independent unconditional: 3425, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1615, independent: 1584, independent conditional: 0, independent unconditional: 1584, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3616, independent: 1841, independent conditional: 0, independent unconditional: 1841, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 1615, unknown conditional: 0, unknown unconditional: 1615] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 160, Positive conditional cache size: 0, Positive unconditional cache size: 160, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 112 PlacesBefore, 34 PlacesAfterwards, 107 TransitionsBefore, 27 TransitionsAfterwards, 1666 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 86 TotalNumberOfCompositions, 3842 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1954, independent: 1831, independent conditional: 0, independent unconditional: 1831, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 844, independent: 823, independent conditional: 0, independent unconditional: 823, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1954, independent: 1008, independent conditional: 0, independent unconditional: 1008, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 844, unknown conditional: 0, unknown unconditional: 844] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 172 PlacesBefore, 72 PlacesAfterwards, 164 TransitionsBefore, 60 TransitionsAfterwards, 7632 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 119 TotalNumberOfCompositions, 25841 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7854, independent: 7480, independent conditional: 0, independent unconditional: 7480, dependent: 374, dependent conditional: 0, dependent unconditional: 374, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3477, independent: 3422, independent conditional: 0, independent unconditional: 3422, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7854, independent: 4058, independent conditional: 0, independent unconditional: 4058, dependent: 319, dependent conditional: 0, dependent unconditional: 319, unknown: 3477, unknown conditional: 0, unknown unconditional: 3477] , Statistics on independence cache: Total cache size (in pairs): 365, Positive cache size: 336, Positive conditional cache size: 0, Positive unconditional cache size: 336, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t257[2]; [L851] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t257={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L851] COND TRUE 0 asdf<2 [L851] FCALL, FORK 0 pthread_create(&t257[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t257[asdf], ((void *)0), P0, ((void *)0))=-1, t257={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L851] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t257={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L851] COND TRUE 0 asdf<2 [L851] FCALL, FORK 0 pthread_create(&t257[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t257[asdf], ((void *)0), P0, ((void *)0))=0, t257={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 2 a$w_buff1 = a$w_buff0 [L752] 2 a$w_buff0 = 1 [L753] 2 a$w_buff1_used = a$w_buff0_used [L754] 2 a$w_buff0_used = (_Bool)1 [L755] CALL 2 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=1, a$w_buff1_used=1, a=0, expression=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] - UnprovableResult [Line: 18]: 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, 160 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: 7.5s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 9 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 558 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 10/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 with 2 thread instances CFG has 10 procedures, 188 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: 172.7s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 169.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 2 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=2, InterpolantAutomatonStates: 6, 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.1s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 160 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: 2.9s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 05:39:40,851 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...