/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_mix022_tso_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:49:14,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:49:14,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:49:14,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:49:14,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:49:14,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:49:14,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:49:14,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:49:14,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:49:14,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:49:14,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:49:14,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:49:14,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:49:14,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:49:14,856 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:49:14,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:49:14,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:49:14,856 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:49:14,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:49:14,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:49:14,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:49:14,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:49:14,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:49:14,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:49:14,857 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:49:14,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:49:14,858 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:49:14,858 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:49:14,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:49:14,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:49:14,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:49:14,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:49:14,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:49:14,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:49:14,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:49:14,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:49:14,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:49:14,860 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:49:14,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:49:14,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:49:14,860 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:49:14,861 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:49:15,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:49:15,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:49:15,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:49:15,082 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:49:15,083 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:49:15,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix022_tso_bound2.i [2023-08-04 05:49:16,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:49:16,385 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:49:16,385 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix022_tso_bound2.i [2023-08-04 05:49:16,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc92f8c34/8ba0ab4882f1447f8204d3438514bb47/FLAG4b362836a [2023-08-04 05:49:16,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc92f8c34/8ba0ab4882f1447f8204d3438514bb47 [2023-08-04 05:49:16,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:49:16,419 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:49:16,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:49:16,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:49:16,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:49:16,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:49:16" (1/1) ... [2023-08-04 05:49:16,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7646279b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:16, skipping insertion in model container [2023-08-04 05:49:16,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:49:16" (1/1) ... [2023-08-04 05:49:16,472 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:49:16,612 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_mix022_tso_bound2.i[944,957] [2023-08-04 05:49:16,849 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:49:16,856 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:49:16,866 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_mix022_tso_bound2.i[944,957] [2023-08-04 05:49:16,880 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:49:16,882 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:49:16,922 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:49:16,945 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:49:16,945 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:49:16,950 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:49:16,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:16 WrapperNode [2023-08-04 05:49:16,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:49:16,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:49:16,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:49:16,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:49:16,957 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:49:16" (1/1) ... [2023-08-04 05:49:16,968 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:49:16" (1/1) ... [2023-08-04 05:49:16,987 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2023-08-04 05:49:16,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:49:16,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:49:16,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:49:16,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:49:16,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:16" (1/1) ... [2023-08-04 05:49:16,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:16" (1/1) ... [2023-08-04 05:49:16,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:16" (1/1) ... [2023-08-04 05:49:16,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:16" (1/1) ... [2023-08-04 05:49:17,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:16" (1/1) ... [2023-08-04 05:49:17,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:16" (1/1) ... [2023-08-04 05:49:17,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:16" (1/1) ... [2023-08-04 05:49:17,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:16" (1/1) ... [2023-08-04 05:49:17,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:49:17,021 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:49:17,021 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:49:17,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:49:17,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:16" (1/1) ... [2023-08-04 05:49:17,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:49:17,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:49:17,053 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:49:17,067 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:49:17,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:49:17,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:49:17,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:49:17,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:49:17,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:49:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 05:49:17,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 05:49:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 05:49:17,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 05:49:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:49:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:49:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:49:17,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:49:17,093 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:49:17,191 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:49:17,193 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:49:17,425 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:49:17,573 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:49:17,573 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-04 05:49:17,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:49:17 BoogieIcfgContainer [2023-08-04 05:49:17,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:49:17,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:49:17,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:49:17,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:49:17,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:49:16" (1/3) ... [2023-08-04 05:49:17,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3d7aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:49:17, skipping insertion in model container [2023-08-04 05:49:17,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:49:16" (2/3) ... [2023-08-04 05:49:17,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3d7aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:49:17, skipping insertion in model container [2023-08-04 05:49:17,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:49:17" (3/3) ... [2023-08-04 05:49:17,585 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix022_tso_bound2.i [2023-08-04 05:49:17,592 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:49:17,600 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:49:17,600 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 05:49:17,600 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:49:17,636 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:49:17,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 103 transitions, 216 flow [2023-08-04 05:49:17,716 INFO L124 PetriNetUnfolderBase]: 14/220 cut-off events. [2023-08-04 05:49:17,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:49:17,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 220 events. 14/220 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 614 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-04 05:49:17,721 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 103 transitions, 216 flow [2023-08-04 05:49:17,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 102 transitions, 212 flow [2023-08-04 05:49:17,727 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:49:17,734 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 102 transitions, 212 flow [2023-08-04 05:49:17,737 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 102 transitions, 212 flow [2023-08-04 05:49:17,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 102 transitions, 212 flow [2023-08-04 05:49:17,781 INFO L124 PetriNetUnfolderBase]: 14/219 cut-off events. [2023-08-04 05:49:17,782 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:49:17,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 219 events. 14/219 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 610 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2023-08-04 05:49:17,784 INFO L119 LiptonReduction]: Number of co-enabled transitions 1506 [2023-08-04 05:49:21,017 INFO L134 LiptonReduction]: Checked pairs total: 3748 [2023-08-04 05:49:21,017 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-08-04 05:49:21,026 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:49:21,030 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;@533e2ed0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:49:21,030 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:49:21,032 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:49:21,033 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-08-04 05:49:21,033 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:49:21,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:21,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 05:49:21,033 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:49:21,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:21,036 INFO L85 PathProgramCache]: Analyzing trace with hash 479203248, now seen corresponding path program 1 times [2023-08-04 05:49:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:21,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916518813] [2023-08-04 05:49:21,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:21,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:21,175 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:49:21,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:49:21,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916518813] [2023-08-04 05:49:21,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916518813] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:49:21,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:49:21,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:49:21,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606141791] [2023-08-04 05:49:21,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:49:21,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:49:21,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:49:21,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:49:21,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:49:21,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 196 [2023-08-04 05:49:21,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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:49:21,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:49:21,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 196 [2023-08-04 05:49:21,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:49:21,334 INFO L124 PetriNetUnfolderBase]: 270/509 cut-off events. [2023-08-04 05:49:21,334 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 05:49:21,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 509 events. 270/509 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2225 event pairs, 218 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 991. Up to 471 conditions per place. [2023-08-04 05:49:21,338 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 21 selfloop transitions, 2 changer transitions 1/27 dead transitions. [2023-08-04 05:49:21,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 110 flow [2023-08-04 05:49:21,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:49:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:49:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-08-04 05:49:21,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-08-04 05:49:21,348 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-08-04 05:49:21,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-08-04 05:49:21,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:49:21,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-08-04 05:49:21,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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:49:21,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 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:49:21,363 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 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:49:21,365 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 54 flow. Second operand 3 states and 280 transitions. [2023-08-04 05:49:21,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 110 flow [2023-08-04 05:49:21,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:49:21,367 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 62 flow [2023-08-04 05:49:21,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-04 05:49:21,375 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2023-08-04 05:49:21,375 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 62 flow [2023-08-04 05:49:21,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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:49:21,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:21,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:49:21,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 05:49:21,376 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:49:21,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:21,376 INFO L85 PathProgramCache]: Analyzing trace with hash -912136505, now seen corresponding path program 1 times [2023-08-04 05:49:21,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:21,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311907664] [2023-08-04 05:49:21,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:21,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:21,508 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:49:21,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:49:21,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311907664] [2023-08-04 05:49:21,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311907664] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:49:21,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539610332] [2023-08-04 05:49:21,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:21,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:49:21,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:49:21,529 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:49:21,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 05:49:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:21,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:49:21,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:49:21,618 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:49:21,618 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:49:21,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539610332] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:49:21,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:49:21,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:49:21,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892504999] [2023-08-04 05:49:21,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:49:21,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:49:21,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:49:21,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:49:21,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:49:21,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 196 [2023-08-04 05:49:21,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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:49:21,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:49:21,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 196 [2023-08-04 05:49:21,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:49:21,774 INFO L124 PetriNetUnfolderBase]: 258/469 cut-off events. [2023-08-04 05:49:21,774 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 05:49:21,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 469 events. 258/469 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2035 event pairs, 154 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 947. Up to 393 conditions per place. [2023-08-04 05:49:21,779 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 27 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-08-04 05:49:21,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 138 flow [2023-08-04 05:49:21,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:49:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:49:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2023-08-04 05:49:21,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4846938775510204 [2023-08-04 05:49:21,785 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 285 transitions. [2023-08-04 05:49:21,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 285 transitions. [2023-08-04 05:49:21,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:49:21,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 285 transitions. [2023-08-04 05:49:21,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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:49:21,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 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:49:21,788 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 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:49:21,788 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 62 flow. Second operand 3 states and 285 transitions. [2023-08-04 05:49:21,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 138 flow [2023-08-04 05:49:21,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:49:21,790 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 66 flow [2023-08-04 05:49:21,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2023-08-04 05:49:21,790 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2023-08-04 05:49:21,791 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 66 flow [2023-08-04 05:49:21,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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:49:21,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:21,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:49:21,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 05:49:21,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:49:21,992 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:49:21,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:21,993 INFO L85 PathProgramCache]: Analyzing trace with hash -912153513, now seen corresponding path program 1 times [2023-08-04 05:49:21,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:21,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377740996] [2023-08-04 05:49:21,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:21,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:22,057 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:49:22,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:49:22,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377740996] [2023-08-04 05:49:22,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377740996] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:49:22,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069444235] [2023-08-04 05:49:22,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:22,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:49:22,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:49:22,059 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:49:22,061 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:49:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:22,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:49:22,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:49:22,143 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:49:22,143 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:49:22,154 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:49:22,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069444235] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:49:22,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:49:22,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:49:22,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830149905] [2023-08-04 05:49:22,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:49:22,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:49:22,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:49:22,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:49:22,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:49:22,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 196 [2023-08-04 05:49:22,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 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:49:22,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:49:22,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 196 [2023-08-04 05:49:22,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:49:22,183 INFO L124 PetriNetUnfolderBase]: 6/21 cut-off events. [2023-08-04 05:49:22,183 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-08-04 05:49:22,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 21 events. 6/21 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 2 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:49:22,184 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2023-08-04 05:49:22,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 12 transitions, 51 flow [2023-08-04 05:49:22,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:49:22,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:49:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2023-08-04 05:49:22,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44387755102040816 [2023-08-04 05:49:22,185 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 348 transitions. [2023-08-04 05:49:22,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 348 transitions. [2023-08-04 05:49:22,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:49:22,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 348 transitions. [2023-08-04 05:49:22,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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:49:22,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:49:22,188 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:49:22,188 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 66 flow. Second operand 4 states and 348 transitions. [2023-08-04 05:49:22,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 12 transitions, 51 flow [2023-08-04 05:49:22,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 12 transitions, 49 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:49:22,189 INFO L231 Difference]: Finished difference. Result has 17 places, 0 transitions, 0 flow [2023-08-04 05:49:22,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=14, 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=17, PETRI_TRANSITIONS=0} [2023-08-04 05:49:22,189 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -11 predicate places. [2023-08-04 05:49:22,189 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 0 transitions, 0 flow [2023-08-04 05:49:22,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 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:49:22,191 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 05:49:22,192 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 05:49:22,192 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 05:49:22,197 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:49:22,397 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,SelfDestructingSolverStorable2 [2023-08-04 05:49:22,399 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 05:49:22,401 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 05:49:22,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 103 transitions, 216 flow [2023-08-04 05:49:22,418 INFO L124 PetriNetUnfolderBase]: 14/220 cut-off events. [2023-08-04 05:49:22,418 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:49:22,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 220 events. 14/220 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 614 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-04 05:49:22,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 103 transitions, 216 flow [2023-08-04 05:49:22,420 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 76 transitions, 162 flow [2023-08-04 05:49:22,421 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:49:22,421 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 76 transitions, 162 flow [2023-08-04 05:49:22,421 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 76 transitions, 162 flow [2023-08-04 05:49:22,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 76 transitions, 162 flow [2023-08-04 05:49:22,429 INFO L124 PetriNetUnfolderBase]: 2/112 cut-off events. [2023-08-04 05:49:22,429 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:49:22,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 163 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 75. Up to 4 conditions per place. [2023-08-04 05:49:22,430 INFO L119 LiptonReduction]: Number of co-enabled transitions 656 [2023-08-04 05:49:24,292 INFO L134 LiptonReduction]: Checked pairs total: 1699 [2023-08-04 05:49:24,292 INFO L136 LiptonReduction]: Total number of compositions: 62 [2023-08-04 05:49:24,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 05:49:24,294 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;@533e2ed0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:49:24,294 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 05:49:24,296 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:49:24,296 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-04 05:49:24,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:49:24,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:24,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 05:49:24,296 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 05:49:24,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:24,296 INFO L85 PathProgramCache]: Analyzing trace with hash 538852452, now seen corresponding path program 1 times [2023-08-04 05:49:24,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:24,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325525926] [2023-08-04 05:49:24,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:24,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:24,335 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:49:24,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:49:24,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325525926] [2023-08-04 05:49:24,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325525926] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:49:24,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:49:24,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:49:24,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489750444] [2023-08-04 05:49:24,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:49:24,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:49:24,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:49:24,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:49:24,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:49:24,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 165 [2023-08-04 05:49:24,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 19 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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:49:24,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:49:24,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 165 [2023-08-04 05:49:24,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:49:24,382 INFO L124 PetriNetUnfolderBase]: 65/145 cut-off events. [2023-08-04 05:49:24,382 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-04 05:49:24,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 145 events. 65/145 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 479 event pairs, 48 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 279. Up to 126 conditions per place. [2023-08-04 05:49:24,383 INFO L140 encePairwiseOnDemand]: 162/165 looper letters, 17 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-08-04 05:49:24,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 94 flow [2023-08-04 05:49:24,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:49:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:49:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2023-08-04 05:49:24,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2023-08-04 05:49:24,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2023-08-04 05:49:24,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2023-08-04 05:49:24,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:49:24,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2023-08-04 05:49:24,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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:49:24,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 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:49:24,390 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 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:49:24,391 INFO L175 Difference]: Start difference. First operand has 24 places, 19 transitions, 48 flow. Second operand 3 states and 275 transitions. [2023-08-04 05:49:24,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 94 flow [2023-08-04 05:49:24,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:49:24,392 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 56 flow [2023-08-04 05:49:24,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2023-08-04 05:49:24,393 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2023-08-04 05:49:24,393 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 56 flow [2023-08-04 05:49:24,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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:49:24,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:24,394 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 05:49:24,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 05:49:24,394 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 05:49:24,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:24,395 INFO L85 PathProgramCache]: Analyzing trace with hash -478155882, now seen corresponding path program 1 times [2023-08-04 05:49:24,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:24,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619170434] [2023-08-04 05:49:24,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:24,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:49:24,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:49:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:49:24,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:49:24,434 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:49:24,434 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 05:49:24,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 05:49:24,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 05:49:24,434 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 05:49:24,435 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 05:49:24,435 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 05:49:24,435 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 05:49:24,454 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:49:24,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 121 transitions, 266 flow [2023-08-04 05:49:24,502 INFO L124 PetriNetUnfolderBase]: 30/457 cut-off events. [2023-08-04 05:49:24,502 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 05:49:24,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 457 events. 30/457 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1943 event pairs, 0 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 329. Up to 18 conditions per place. [2023-08-04 05:49:24,503 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 121 transitions, 266 flow [2023-08-04 05:49:24,505 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 120 transitions, 260 flow [2023-08-04 05:49:24,505 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:49:24,505 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 120 transitions, 260 flow [2023-08-04 05:49:24,505 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 120 transitions, 260 flow [2023-08-04 05:49:24,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 120 transitions, 260 flow [2023-08-04 05:49:24,536 INFO L124 PetriNetUnfolderBase]: 30/456 cut-off events. [2023-08-04 05:49:24,536 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 05:49:24,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 456 events. 30/456 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1939 event pairs, 0 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 327. Up to 18 conditions per place. [2023-08-04 05:49:24,541 INFO L119 LiptonReduction]: Number of co-enabled transitions 3584 [2023-08-04 05:49:27,441 INFO L134 LiptonReduction]: Checked pairs total: 10501 [2023-08-04 05:49:27,441 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-04 05:49:27,442 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:49:27,443 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;@533e2ed0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:49:27,443 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 05:49:27,448 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:49:27,448 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-04 05:49:27,448 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:49:27,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:27,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 05:49:27,448 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:49:27,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:27,448 INFO L85 PathProgramCache]: Analyzing trace with hash 762763341, now seen corresponding path program 1 times [2023-08-04 05:49:27,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:27,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184721963] [2023-08-04 05:49:27,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:27,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:27,483 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:49:27,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:49:27,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184721963] [2023-08-04 05:49:27,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184721963] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:49:27,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:49:27,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:49:27,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327298171] [2023-08-04 05:49:27,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:49:27,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:49:27,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:49:27,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:49:27,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:49:27,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 217 [2023-08-04 05:49:27,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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:49:27,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:49:27,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 217 [2023-08-04 05:49:27,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:49:30,092 INFO L124 PetriNetUnfolderBase]: 16566/23826 cut-off events. [2023-08-04 05:49:30,093 INFO L125 PetriNetUnfolderBase]: For 444/444 co-relation queries the response was YES. [2023-08-04 05:49:30,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47074 conditions, 23826 events. 16566/23826 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 149542 event pairs, 12024 based on Foata normal form. 0/20198 useless extension candidates. Maximal degree in co-relation 10378. Up to 22623 conditions per place. [2023-08-04 05:49:30,193 INFO L140 encePairwiseOnDemand]: 214/217 looper letters, 33 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-04 05:49:30,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 174 flow [2023-08-04 05:49:30,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:49:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:49:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-04 05:49:30,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976958525345622 [2023-08-04 05:49:30,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-04 05:49:30,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-04 05:49:30,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:49:30,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-04 05:49:30,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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:49:30,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:49:30,197 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:49:30,197 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 94 flow. Second operand 3 states and 324 transitions. [2023-08-04 05:49:30,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 174 flow [2023-08-04 05:49:30,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 42 transitions, 172 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 05:49:30,199 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 104 flow [2023-08-04 05:49:30,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-04 05:49:30,199 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2023-08-04 05:49:30,200 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 104 flow [2023-08-04 05:49:30,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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:49:30,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:30,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:49:30,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 05:49:30,200 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:49:30,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash -378379892, now seen corresponding path program 1 times [2023-08-04 05:49:30,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:30,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777796850] [2023-08-04 05:49:30,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:30,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:30,230 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:49:30,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:49:30,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777796850] [2023-08-04 05:49:30,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777796850] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:49:30,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928728877] [2023-08-04 05:49:30,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:30,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:49:30,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:49:30,247 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:49:30,248 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:49:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:30,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:49:30,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:49:30,338 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:49:30,338 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:49:30,356 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:49:30,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928728877] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:49:30,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:49:30,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:49:30,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572743808] [2023-08-04 05:49:30,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:49:30,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:49:30,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:49:30,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:49:30,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:49:30,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217 [2023-08-04 05:49:30,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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:49:30,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:49:30,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217 [2023-08-04 05:49:30,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:49:32,085 INFO L124 PetriNetUnfolderBase]: 13986/19822 cut-off events. [2023-08-04 05:49:32,085 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2023-08-04 05:49:32,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39133 conditions, 19822 events. 13986/19822 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 826. Compared 118844 event pairs, 6732 based on Foata normal form. 4/16962 useless extension candidates. Maximal degree in co-relation 10381. Up to 18761 conditions per place. [2023-08-04 05:49:32,153 INFO L140 encePairwiseOnDemand]: 213/217 looper letters, 38 selfloop transitions, 3 changer transitions 1/49 dead transitions. [2023-08-04 05:49:32,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 210 flow [2023-08-04 05:49:32,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:49:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:49:32,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2023-08-04 05:49:32,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4873271889400922 [2023-08-04 05:49:32,155 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 423 transitions. [2023-08-04 05:49:32,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 423 transitions. [2023-08-04 05:49:32,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:49:32,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 423 transitions. [2023-08-04 05:49:32,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 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:49:32,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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:49:32,157 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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:49:32,157 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 104 flow. Second operand 4 states and 423 transitions. [2023-08-04 05:49:32,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 210 flow [2023-08-04 05:49:32,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:49:32,159 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 116 flow [2023-08-04 05:49:32,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-08-04 05:49:32,159 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-08-04 05:49:32,160 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 116 flow [2023-08-04 05:49:32,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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:49:32,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:32,160 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:49:32,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-04 05:49:32,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:49:32,365 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:49:32,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:32,365 INFO L85 PathProgramCache]: Analyzing trace with hash -220238196, now seen corresponding path program 1 times [2023-08-04 05:49:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:32,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902577536] [2023-08-04 05:49:32,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:49:32,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:49:32,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902577536] [2023-08-04 05:49:32,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902577536] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:49:32,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:49:32,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:49:32,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231754781] [2023-08-04 05:49:32,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:49:32,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:49:32,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:49:32,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:49:32,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:49:32,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 217 [2023-08-04 05:49:32,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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:49:32,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:49:32,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 217 [2023-08-04 05:49:32,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:49:34,074 INFO L124 PetriNetUnfolderBase]: 12554/17767 cut-off events. [2023-08-04 05:49:34,075 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2023-08-04 05:49:34,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35126 conditions, 17767 events. 12554/17767 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 104562 event pairs, 3066 based on Foata normal form. 0/15511 useless extension candidates. Maximal degree in co-relation 16421. Up to 16065 conditions per place. [2023-08-04 05:49:34,127 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 43 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2023-08-04 05:49:34,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 243 flow [2023-08-04 05:49:34,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:49:34,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:49:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2023-08-04 05:49:34,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5284178187403994 [2023-08-04 05:49:34,129 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2023-08-04 05:49:34,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2023-08-04 05:49:34,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:49:34,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2023-08-04 05:49:34,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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:49:34,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:49:34,131 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:49:34,131 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 116 flow. Second operand 3 states and 344 transitions. [2023-08-04 05:49:34,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 243 flow [2023-08-04 05:49:34,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 236 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 05:49:34,132 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 130 flow [2023-08-04 05:49:34,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2023-08-04 05:49:34,133 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-08-04 05:49:34,133 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 130 flow [2023-08-04 05:49:34,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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:49:34,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:34,133 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:49:34,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 05:49:34,133 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:49:34,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:34,134 INFO L85 PathProgramCache]: Analyzing trace with hash -220232537, now seen corresponding path program 1 times [2023-08-04 05:49:34,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:34,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345340615] [2023-08-04 05:49:34,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:34,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:49:34,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:49:34,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345340615] [2023-08-04 05:49:34,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345340615] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:49:34,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:49:34,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 05:49:34,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582169262] [2023-08-04 05:49:34,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:49:34,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:49:34,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:49:34,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:49:34,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:49:34,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 217 [2023-08-04 05:49:34,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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:49:34,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:49:34,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 217 [2023-08-04 05:49:34,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:49:35,488 INFO L124 PetriNetUnfolderBase]: 12458/17559 cut-off events. [2023-08-04 05:49:35,488 INFO L125 PetriNetUnfolderBase]: For 1241/1241 co-relation queries the response was YES. [2023-08-04 05:49:35,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37254 conditions, 17559 events. 12458/17559 cut-off events. For 1241/1241 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 103861 event pairs, 9330 based on Foata normal form. 0/15319 useless extension candidates. Maximal degree in co-relation 17501. Up to 16513 conditions per place. [2023-08-04 05:49:35,549 INFO L140 encePairwiseOnDemand]: 214/217 looper letters, 43 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-04 05:49:35,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 247 flow [2023-08-04 05:49:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:49:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:49:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2023-08-04 05:49:35,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5084485407066052 [2023-08-04 05:49:35,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2023-08-04 05:49:35,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2023-08-04 05:49:35,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:49:35,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2023-08-04 05:49:35,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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:49:35,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:49:35,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:49:35,553 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 130 flow. Second operand 3 states and 331 transitions. [2023-08-04 05:49:35,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 247 flow [2023-08-04 05:49:35,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 243 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:49:35,555 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 139 flow [2023-08-04 05:49:35,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-08-04 05:49:35,555 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2023-08-04 05:49:35,555 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 139 flow [2023-08-04 05:49:35,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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:49:35,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:35,556 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:49:35,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 05:49:35,556 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:49:35,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:35,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2097607225, now seen corresponding path program 1 times [2023-08-04 05:49:35,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:35,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158055208] [2023-08-04 05:49:35,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:35,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:49:35,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:49:35,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158055208] [2023-08-04 05:49:35,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158055208] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:49:35,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372037759] [2023-08-04 05:49:35,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:35,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:49:35,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:49:35,593 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:49:35,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 05:49:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:49:35,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:49:35,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:49:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:49:35,675 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:49:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:49:35,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372037759] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:49:35,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:49:35,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 05:49:35,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330201851] [2023-08-04 05:49:35,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:49:35,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:49:35,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:49:35,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:49:35,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:49:35,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217 [2023-08-04 05:49:35,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 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:49:35,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:49:35,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217 [2023-08-04 05:49:35,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:49:37,322 INFO L124 PetriNetUnfolderBase]: 11722/16103 cut-off events. [2023-08-04 05:49:37,322 INFO L125 PetriNetUnfolderBase]: For 2065/2065 co-relation queries the response was YES. [2023-08-04 05:49:37,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35575 conditions, 16103 events. 11722/16103 cut-off events. For 2065/2065 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 90600 event pairs, 4546 based on Foata normal form. 80/14711 useless extension candidates. Maximal degree in co-relation 16741. Up to 11009 conditions per place. [2023-08-04 05:49:37,396 INFO L140 encePairwiseOnDemand]: 213/217 looper letters, 60 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2023-08-04 05:49:37,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 341 flow [2023-08-04 05:49:37,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:49:37,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:49:37,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2023-08-04 05:49:37,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069124423963134 [2023-08-04 05:49:37,398 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2023-08-04 05:49:37,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2023-08-04 05:49:37,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:49:37,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2023-08-04 05:49:37,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 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:49:37,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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:49:37,400 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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:49:37,400 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 139 flow. Second operand 4 states and 440 transitions. [2023-08-04 05:49:37,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 341 flow [2023-08-04 05:49:37,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 339 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:49:37,402 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 157 flow [2023-08-04 05:49:37,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2023-08-04 05:49:37,403 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2023-08-04 05:49:37,403 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 157 flow [2023-08-04 05:49:37,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 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:49:37,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:49:37,403 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:49:37,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 05:49:37,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:49:37,609 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:49:37,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:49:37,609 INFO L85 PathProgramCache]: Analyzing trace with hash -916071804, now seen corresponding path program 1 times [2023-08-04 05:49:37,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:49:37,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370934483] [2023-08-04 05:49:37,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:49:37,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:49:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:49:37,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:49:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:49:37,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:49:37,643 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:49:37,644 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 05:49:37,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 05:49:37,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 05:49:37,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 05:49:37,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 05:49:37,644 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-04 05:49:37,645 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 05:49:37,646 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 05:49:37,646 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 05:49:37,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 05:49:37 BasicIcfg [2023-08-04 05:49:37,705 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 05:49:37,706 INFO L158 Benchmark]: Toolchain (without parser) took 21286.21ms. Allocated memory was 713.0MB in the beginning and 3.1GB in the end (delta: 2.4GB). Free memory was 658.6MB in the beginning and 1.7GB in the end (delta: -1.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2023-08-04 05:49:37,706 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 434.1MB. Free memory is still 381.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 05:49:37,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.38ms. Allocated memory is still 713.0MB. Free memory was 658.3MB in the beginning and 634.5MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 05:49:37,706 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.03ms. Allocated memory is still 713.0MB. Free memory was 634.5MB in the beginning and 631.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-04 05:49:37,706 INFO L158 Benchmark]: Boogie Preprocessor took 32.85ms. Allocated memory is still 713.0MB. Free memory was 631.3MB in the beginning and 629.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:49:37,706 INFO L158 Benchmark]: RCFGBuilder took 554.90ms. Allocated memory is still 713.0MB. Free memory was 629.2MB in the beginning and 641.5MB in the end (delta: -12.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-04 05:49:37,707 INFO L158 Benchmark]: TraceAbstraction took 20127.20ms. Allocated memory was 713.0MB in the beginning and 3.1GB in the end (delta: 2.4GB). Free memory was 641.5MB in the beginning and 1.7GB in the end (delta: -1.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2023-08-04 05:49:37,708 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 434.1MB. Free memory is still 381.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 528.38ms. Allocated memory is still 713.0MB. Free memory was 658.3MB in the beginning and 634.5MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 36.03ms. Allocated memory is still 713.0MB. Free memory was 634.5MB in the beginning and 631.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.85ms. Allocated memory is still 713.0MB. Free memory was 631.3MB in the beginning and 629.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 554.90ms. Allocated memory is still 713.0MB. Free memory was 629.2MB in the beginning and 641.5MB in the end (delta: -12.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 20127.20ms. Allocated memory was 713.0MB in the beginning and 3.1GB in the end (delta: 2.4GB). Free memory was 641.5MB in the beginning and 1.7GB in the end (delta: -1.1GB). Peak memory consumption was 1.3GB. 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.3s, 103 PlacesBefore, 28 PlacesAfterwards, 102 TransitionsBefore, 23 TransitionsAfterwards, 1506 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 93 TotalNumberOfCompositions, 3748 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1877, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 820, independent: 790, independent conditional: 0, independent unconditional: 790, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1877, independent: 954, independent conditional: 0, independent unconditional: 954, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 820, unknown conditional: 0, unknown unconditional: 820] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 57, Positive conditional cache size: 0, Positive unconditional cache size: 57, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 80 PlacesBefore, 24 PlacesAfterwards, 76 TransitionsBefore, 19 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 62 TotalNumberOfCompositions, 1699 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1087, independent: 989, independent conditional: 0, independent unconditional: 989, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 339, independent: 328, independent conditional: 0, independent unconditional: 328, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1087, independent: 661, independent conditional: 0, independent unconditional: 661, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 339, unknown conditional: 0, unknown unconditional: 339] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 125 PlacesBefore, 46 PlacesAfterwards, 120 TransitionsBefore, 37 TransitionsAfterwards, 3584 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 96 TotalNumberOfCompositions, 10501 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3564, independent: 3337, independent conditional: 0, independent unconditional: 3337, dependent: 227, dependent conditional: 0, dependent unconditional: 227, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1789, independent: 1741, independent conditional: 0, independent unconditional: 1741, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3564, independent: 1596, independent conditional: 0, independent unconditional: 1596, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 1789, unknown conditional: 0, unknown unconditional: 1789] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 143, Positive conditional cache size: 0, Positive unconditional cache size: 143, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t597[2]; [L811] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t597={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L811] COND TRUE 0 asdf<2 [L811] FCALL, FORK 0 pthread_create(&t597[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t597[asdf], ((void *)0), P0, ((void *)0))=-4, t597={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L811] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t597={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L811] COND TRUE 0 asdf<2 [L811] FCALL, FORK 0 pthread_create(&t597[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t597[asdf], ((void *)0), P0, ((void *)0))=-3, t597={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L811] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t597={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L811] COND FALSE 0 !(asdf<2) [L812] 0 pthread_t t598[2]; [L813] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t597={5:0}, t598={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L813] COND TRUE 0 asdf<2 [L813] FCALL, FORK 0 pthread_create(&t598[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t598[asdf], ((void *)0), P1, ((void *)0))=-2, t597={5:0}, t598={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L758] 3 x$w_buff1 = x$w_buff0 [L759] 3 x$w_buff0 = 2 [L760] 3 x$w_buff1_used = x$w_buff0_used [L761] 3 x$w_buff0_used = (_Bool)1 [L762] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L762] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L813] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t597={5:0}, t598={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L813] COND TRUE 0 asdf<2 [L813] FCALL, FORK 0 pthread_create(&t598[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t598[asdf], ((void *)0), P1, ((void *)0))=-1, t597={5:0}, t598={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L758] 4 x$w_buff1 = x$w_buff0 [L759] 4 x$w_buff0 = 2 [L760] 4 x$w_buff1_used = x$w_buff0_used [L761] 4 x$w_buff0_used = (_Bool)1 [L762] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND TRUE 4 !expression [L18] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=2, x$w_buff1_used=1, x=0, y=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 5 procedures, 118 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 137 IncrementalHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 7 mSDtfsCounter, 137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 75 SizeOfPredicates, 0 NumberOfNonLiveVariables, 305 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 1/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 136 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: 13.2s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 143 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 437 IncrementalHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 16 mSDtfsCounter, 437 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=5, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 343 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 30/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 118 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 05:49:37,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...