/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_rfi004_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 06:22:00,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 06:22:00,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 06:22:00,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 06:22:00,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 06:22:00,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 06:22:00,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 06:22:00,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 06:22:00,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 06:22:00,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 06:22:00,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 06:22:00,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 06:22:00,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 06:22:00,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 06:22:00,851 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 06:22:00,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 06:22:00,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 06:22:00,852 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 06:22:00,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 06:22:00,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 06:22:00,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 06:22:00,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 06:22:00,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 06:22:00,854 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 06:22:00,855 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 06:22:00,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 06:22:00,855 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 06:22:00,856 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 06:22:00,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 06:22:00,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 06:22:00,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:22:00,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 06:22:00,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 06:22:00,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 06:22:00,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 06:22:00,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 06:22:00,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 06:22:00,858 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 06:22:00,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 06:22:00,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 06:22:00,859 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 06:22:00,859 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 06:22:01,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 06:22:01,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 06:22:01,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 06:22:01,110 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 06:22:01,110 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 06:22:01,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi004_bound2.i [2023-08-04 06:22:02,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 06:22:02,435 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 06:22:02,436 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi004_bound2.i [2023-08-04 06:22:02,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715c9c49e/5e7ff2171fc6482e9ebe7b22e253ec4a/FLAG9b4a7eacc [2023-08-04 06:22:02,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715c9c49e/5e7ff2171fc6482e9ebe7b22e253ec4a [2023-08-04 06:22:02,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 06:22:02,465 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 06:22:02,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 06:22:02,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 06:22:02,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 06:22:02,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:22:02" (1/1) ... [2023-08-04 06:22:02,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@410eaa0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:22:02, skipping insertion in model container [2023-08-04 06:22:02,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:22:02" (1/1) ... [2023-08-04 06:22:02,517 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 06:22:02,635 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_rfi004_bound2.i[983,996] [2023-08-04 06:22:02,832 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:22:02,843 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 06:22:02,852 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_rfi004_bound2.i[983,996] [2023-08-04 06:22:02,871 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 06:22:02,872 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 06:22:02,908 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:22:02,936 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:22:02,937 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:22:02,942 INFO L206 MainTranslator]: Completed translation [2023-08-04 06:22:02,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:22:02 WrapperNode [2023-08-04 06:22:02,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 06:22:02,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 06:22:02,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 06:22:02,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 06:22:02,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:22:02" (1/1) ... [2023-08-04 06:22:02,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:22:02" (1/1) ... [2023-08-04 06:22:03,007 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2023-08-04 06:22:03,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 06:22:03,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 06:22:03,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 06:22:03,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 06:22:03,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:22:02" (1/1) ... [2023-08-04 06:22:03,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:22:02" (1/1) ... [2023-08-04 06:22:03,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:22:02" (1/1) ... [2023-08-04 06:22:03,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:22:02" (1/1) ... [2023-08-04 06:22:03,034 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:22:02" (1/1) ... [2023-08-04 06:22:03,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:22:02" (1/1) ... [2023-08-04 06:22:03,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:22:02" (1/1) ... [2023-08-04 06:22:03,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:22:02" (1/1) ... [2023-08-04 06:22:03,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 06:22:03,043 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 06:22:03,043 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 06:22:03,043 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 06:22:03,044 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:22:02" (1/1) ... [2023-08-04 06:22:03,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:22:03,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:22:03,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 06:22:03,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 06:22:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 06:22:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 06:22:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 06:22:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 06:22:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 06:22:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 06:22:03,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 06:22:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 06:22:03,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 06:22:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 06:22:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 06:22:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 06:22:03,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 06:22:03,111 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 06:22:03,217 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 06:22:03,218 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 06:22:03,459 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 06:22:03,613 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 06:22:03,613 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-04 06:22:03,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:22:03 BoogieIcfgContainer [2023-08-04 06:22:03,617 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 06:22:03,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 06:22:03,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 06:22:03,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 06:22:03,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 06:22:02" (1/3) ... [2023-08-04 06:22:03,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11201354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:22:03, skipping insertion in model container [2023-08-04 06:22:03,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:22:02" (2/3) ... [2023-08-04 06:22:03,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11201354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:22:03, skipping insertion in model container [2023-08-04 06:22:03,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:22:03" (3/3) ... [2023-08-04 06:22:03,628 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_rfi004_bound2.i [2023-08-04 06:22:03,635 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 06:22:03,644 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 06:22:03,644 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 06:22:03,644 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 06:22:03,695 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:22:03,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 105 transitions, 220 flow [2023-08-04 06:22:03,802 INFO L124 PetriNetUnfolderBase]: 14/223 cut-off events. [2023-08-04 06:22:03,802 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:22:03,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 223 events. 14/223 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 632 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 130. Up to 8 conditions per place. [2023-08-04 06:22:03,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 105 transitions, 220 flow [2023-08-04 06:22:03,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 104 transitions, 216 flow [2023-08-04 06:22:03,815 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:22:03,823 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 104 transitions, 216 flow [2023-08-04 06:22:03,825 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 104 transitions, 216 flow [2023-08-04 06:22:03,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 104 transitions, 216 flow [2023-08-04 06:22:03,875 INFO L124 PetriNetUnfolderBase]: 14/222 cut-off events. [2023-08-04 06:22:03,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:22:03,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 222 events. 14/222 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 629 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 128. Up to 8 conditions per place. [2023-08-04 06:22:03,878 INFO L119 LiptonReduction]: Number of co-enabled transitions 1472 [2023-08-04 06:22:06,624 INFO L134 LiptonReduction]: Checked pairs total: 3530 [2023-08-04 06:22:06,624 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-08-04 06:22:06,636 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:22:06,641 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;@6c08e474, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:22:06,642 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 06:22:06,645 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:22:06,645 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2023-08-04 06:22:06,645 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:22:06,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:06,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:22:06,646 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:22:06,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:06,650 INFO L85 PathProgramCache]: Analyzing trace with hash 442038206, now seen corresponding path program 1 times [2023-08-04 06:22:06,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:06,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588839141] [2023-08-04 06:22:06,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:06,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:22:06,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:22:06,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588839141] [2023-08-04 06:22:06,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588839141] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:22:06,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:22:06,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:22:06,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030627863] [2023-08-04 06:22:06,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:22:06,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:22:06,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:22:06,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:22:06,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:22:06,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 198 [2023-08-04 06:22:06,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:06,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:22:06,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 198 [2023-08-04 06:22:06,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:07,126 INFO L124 PetriNetUnfolderBase]: 352/654 cut-off events. [2023-08-04 06:22:07,127 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:22:07,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 654 events. 352/654 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2958 event pairs, 160 based on Foata normal form. 28/550 useless extension candidates. Maximal degree in co-relation 1282. Up to 609 conditions per place. [2023-08-04 06:22:07,137 INFO L140 encePairwiseOnDemand]: 194/198 looper letters, 23 selfloop transitions, 2 changer transitions 1/28 dead transitions. [2023-08-04 06:22:07,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 116 flow [2023-08-04 06:22:07,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:22:07,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:22:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2023-08-04 06:22:07,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49663299663299665 [2023-08-04 06:22:07,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2023-08-04 06:22:07,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2023-08-04 06:22:07,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:07,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2023-08-04 06:22:07,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:07,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:07,186 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:07,187 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 58 flow. Second operand 3 states and 295 transitions. [2023-08-04 06:22:07,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 116 flow [2023-08-04 06:22:07,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 116 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:22:07,192 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 64 flow [2023-08-04 06:22:07,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-04 06:22:07,202 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2023-08-04 06:22:07,202 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 64 flow [2023-08-04 06:22:07,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:07,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:07,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:22:07,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 06:22:07,204 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:22:07,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:07,206 INFO L85 PathProgramCache]: Analyzing trace with hash 200579272, now seen corresponding path program 1 times [2023-08-04 06:22:07,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:07,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195122832] [2023-08-04 06:22:07,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:07,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:22:07,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:22:07,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195122832] [2023-08-04 06:22:07,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195122832] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:22:07,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580294870] [2023-08-04 06:22:07,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:07,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:22:07,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:22:07,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:22:07,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 06:22:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:07,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:22:07,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:22:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:22:07,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:22:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:22:07,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580294870] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:22:07,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:22:07,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:22:07,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684970928] [2023-08-04 06:22:07,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:22:07,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:22:07,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:22:07,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:22:07,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:22:07,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 198 [2023-08-04 06:22:07,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:07,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:22:07,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 198 [2023-08-04 06:22:07,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:07,502 INFO L124 PetriNetUnfolderBase]: 6/20 cut-off events. [2023-08-04 06:22:07,502 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 06:22:07,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 20 events. 6/20 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 4/24 useless extension candidates. Maximal degree in co-relation 51. Up to 14 conditions per place. [2023-08-04 06:22:07,503 INFO L140 encePairwiseOnDemand]: 195/198 looper letters, 0 selfloop transitions, 0 changer transitions 11/11 dead transitions. [2023-08-04 06:22:07,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 11 transitions, 53 flow [2023-08-04 06:22:07,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:22:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:22:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 364 transitions. [2023-08-04 06:22:07,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595959595959596 [2023-08-04 06:22:07,507 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 364 transitions. [2023-08-04 06:22:07,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 364 transitions. [2023-08-04 06:22:07,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:07,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 364 transitions. [2023-08-04 06:22:07,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:07,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:07,512 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:07,512 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 64 flow. Second operand 4 states and 364 transitions. [2023-08-04 06:22:07,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 11 transitions, 53 flow [2023-08-04 06:22:07,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 11 transitions, 47 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 06:22:07,513 INFO L231 Difference]: Finished difference. Result has 14 places, 0 transitions, 0 flow [2023-08-04 06:22:07,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=14, PETRI_TRANSITIONS=0} [2023-08-04 06:22:07,514 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -15 predicate places. [2023-08-04 06:22:07,514 INFO L495 AbstractCegarLoop]: Abstraction has has 14 places, 0 transitions, 0 flow [2023-08-04 06:22:07,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:07,517 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 06:22:07,517 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 06:22:07,518 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 06:22:07,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 06:22:07,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:22:07,725 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 06:22:07,728 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 06:22:07,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 105 transitions, 220 flow [2023-08-04 06:22:07,758 INFO L124 PetriNetUnfolderBase]: 14/223 cut-off events. [2023-08-04 06:22:07,758 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:22:07,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 223 events. 14/223 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 632 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 130. Up to 8 conditions per place. [2023-08-04 06:22:07,759 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 105 transitions, 220 flow [2023-08-04 06:22:07,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 78 transitions, 166 flow [2023-08-04 06:22:07,760 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:22:07,760 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 78 transitions, 166 flow [2023-08-04 06:22:07,761 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 78 transitions, 166 flow [2023-08-04 06:22:07,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 78 transitions, 166 flow [2023-08-04 06:22:07,772 INFO L124 PetriNetUnfolderBase]: 2/115 cut-off events. [2023-08-04 06:22:07,772 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:22:07,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 166 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 4 conditions per place. [2023-08-04 06:22:07,773 INFO L119 LiptonReduction]: Number of co-enabled transitions 620 [2023-08-04 06:22:10,054 INFO L134 LiptonReduction]: Checked pairs total: 1319 [2023-08-04 06:22:10,054 INFO L136 LiptonReduction]: Total number of compositions: 66 [2023-08-04 06:22:10,057 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 06:22:10,058 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;@6c08e474, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:22:10,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 06:22:10,061 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:22:10,061 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-04 06:22:10,061 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:22:10,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:10,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:22:10,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 06:22:10,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:10,062 INFO L85 PathProgramCache]: Analyzing trace with hash 505418107, now seen corresponding path program 1 times [2023-08-04 06:22:10,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:10,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575233139] [2023-08-04 06:22:10,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:10,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 06:22:10,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:22:10,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575233139] [2023-08-04 06:22:10,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575233139] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:22:10,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:22:10,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:22:10,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079306653] [2023-08-04 06:22:10,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:22:10,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:22:10,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:22:10,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:22:10,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:22:10,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 171 [2023-08-04 06:22:10,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:10,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:22:10,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 171 [2023-08-04 06:22:10,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:10,145 INFO L124 PetriNetUnfolderBase]: 65/147 cut-off events. [2023-08-04 06:22:10,145 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:22:10,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 147 events. 65/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 513 event pairs, 20 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 288. Up to 126 conditions per place. [2023-08-04 06:22:10,147 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 17 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-04 06:22:10,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 21 transitions, 90 flow [2023-08-04 06:22:10,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:22:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:22:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2023-08-04 06:22:10,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5594541910331384 [2023-08-04 06:22:10,148 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 287 transitions. [2023-08-04 06:22:10,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 287 transitions. [2023-08-04 06:22:10,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:10,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 287 transitions. [2023-08-04 06:22:10,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:10,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:10,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:10,152 INFO L175 Difference]: Start difference. First operand has 22 places, 17 transitions, 44 flow. Second operand 3 states and 287 transitions. [2023-08-04 06:22:10,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 21 transitions, 90 flow [2023-08-04 06:22:10,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 90 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:22:10,153 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 52 flow [2023-08-04 06:22:10,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-08-04 06:22:10,154 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 3 predicate places. [2023-08-04 06:22:10,154 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 52 flow [2023-08-04 06:22:10,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:10,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:10,155 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 06:22:10,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 06:22:10,155 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 06:22:10,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:10,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1513697932, now seen corresponding path program 1 times [2023-08-04 06:22:10,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:10,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403528153] [2023-08-04 06:22:10,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:10,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:22:10,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:22:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:22:10,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:22:10,215 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:22:10,215 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 06:22:10,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 06:22:10,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 06:22:10,216 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 06:22:10,217 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 06:22:10,217 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 06:22:10,217 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 06:22:10,235 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:22:10,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 123 transitions, 270 flow [2023-08-04 06:22:10,275 INFO L124 PetriNetUnfolderBase]: 30/463 cut-off events. [2023-08-04 06:22:10,276 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 06:22:10,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 463 events. 30/463 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2020 event pairs, 0 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 332. Up to 18 conditions per place. [2023-08-04 06:22:10,277 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 123 transitions, 270 flow [2023-08-04 06:22:10,278 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 122 transitions, 264 flow [2023-08-04 06:22:10,278 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:22:10,279 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 122 transitions, 264 flow [2023-08-04 06:22:10,279 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 122 transitions, 264 flow [2023-08-04 06:22:10,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 122 transitions, 264 flow [2023-08-04 06:22:10,315 INFO L124 PetriNetUnfolderBase]: 30/462 cut-off events. [2023-08-04 06:22:10,316 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 06:22:10,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 462 events. 30/462 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1999 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 332. Up to 18 conditions per place. [2023-08-04 06:22:10,322 INFO L119 LiptonReduction]: Number of co-enabled transitions 3512 [2023-08-04 06:22:12,960 INFO L134 LiptonReduction]: Checked pairs total: 10792 [2023-08-04 06:22:12,961 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-08-04 06:22:12,964 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:22:12,970 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;@6c08e474, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:22:12,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 06:22:12,974 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:22:12,974 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-04 06:22:12,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:22:12,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:12,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:22:12,975 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:22:12,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:12,976 INFO L85 PathProgramCache]: Analyzing trace with hash 732177497, now seen corresponding path program 1 times [2023-08-04 06:22:12,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:12,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70196660] [2023-08-04 06:22:12,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:12,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:22:13,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:22:13,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70196660] [2023-08-04 06:22:13,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70196660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:22:13,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:22:13,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:22:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280444981] [2023-08-04 06:22:13,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:22:13,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:22:13,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:22:13,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:22:13,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:22:13,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 220 [2023-08-04 06:22:13,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:13,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:22:13,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 220 [2023-08-04 06:22:13,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:15,462 INFO L124 PetriNetUnfolderBase]: 15012/23307 cut-off events. [2023-08-04 06:22:15,463 INFO L125 PetriNetUnfolderBase]: For 372/372 co-relation queries the response was YES. [2023-08-04 06:22:15,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44461 conditions, 23307 events. 15012/23307 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 162860 event pairs, 10800 based on Foata normal form. 620/19739 useless extension candidates. Maximal degree in co-relation 9780. Up to 20629 conditions per place. [2023-08-04 06:22:15,659 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 33 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-08-04 06:22:15,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 178 flow [2023-08-04 06:22:15,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:22:15,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:22:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-08-04 06:22:15,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2023-08-04 06:22:15,662 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-08-04 06:22:15,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-08-04 06:22:15,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:15,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-08-04 06:22:15,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:15,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:15,665 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:15,665 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 100 flow. Second operand 3 states and 340 transitions. [2023-08-04 06:22:15,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 178 flow [2023-08-04 06:22:15,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 176 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 06:22:15,667 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 108 flow [2023-08-04 06:22:15,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-08-04 06:22:15,668 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2023-08-04 06:22:15,668 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 108 flow [2023-08-04 06:22:15,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:15,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:15,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:22:15,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 06:22:15,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:22:15,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:15,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2007529323, now seen corresponding path program 1 times [2023-08-04 06:22:15,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:15,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209253895] [2023-08-04 06:22:15,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:15,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:22:15,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:22:15,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209253895] [2023-08-04 06:22:15,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209253895] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:22:15,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532849878] [2023-08-04 06:22:15,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:15,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:22:15,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:22:15,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:22:15,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 06:22:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:15,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:22:15,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:22:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:22:15,830 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:22:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:22:15,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532849878] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:22:15,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:22:15,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-04 06:22:15,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003974687] [2023-08-04 06:22:15,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:22:15,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 06:22:15,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:22:15,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 06:22:15,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 06:22:15,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 220 [2023-08-04 06:22:15,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:15,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:22:15,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 220 [2023-08-04 06:22:15,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:17,716 INFO L124 PetriNetUnfolderBase]: 12690/19413 cut-off events. [2023-08-04 06:22:17,717 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2023-08-04 06:22:17,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37012 conditions, 19413 events. 12690/19413 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 129319 event pairs, 5964 based on Foata normal form. 4/16105 useless extension candidates. Maximal degree in co-relation 9806. Up to 17113 conditions per place. [2023-08-04 06:22:17,793 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 38 selfloop transitions, 3 changer transitions 1/51 dead transitions. [2023-08-04 06:22:17,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 214 flow [2023-08-04 06:22:17,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:22:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:22:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 443 transitions. [2023-08-04 06:22:17,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034090909090909 [2023-08-04 06:22:17,795 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 443 transitions. [2023-08-04 06:22:17,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 443 transitions. [2023-08-04 06:22:17,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:17,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 443 transitions. [2023-08-04 06:22:17,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:17,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:17,800 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:17,800 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 108 flow. Second operand 4 states and 443 transitions. [2023-08-04 06:22:17,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 214 flow [2023-08-04 06:22:17,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:22:17,802 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 120 flow [2023-08-04 06:22:17,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-08-04 06:22:17,802 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2023-08-04 06:22:17,803 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 120 flow [2023-08-04 06:22:17,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:17,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:17,803 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:22:17,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-04 06:22:18,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-04 06:22:18,011 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:22:18,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:18,012 INFO L85 PathProgramCache]: Analyzing trace with hash 216836626, now seen corresponding path program 1 times [2023-08-04 06:22:18,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:18,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389682298] [2023-08-04 06:22:18,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:18,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:22:18,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:22:18,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389682298] [2023-08-04 06:22:18,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389682298] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:22:18,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:22:18,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:22:18,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662460610] [2023-08-04 06:22:18,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:22:18,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:22:18,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:22:18,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:22:18,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:22:18,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 220 [2023-08-04 06:22:18,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:18,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:22:18,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 220 [2023-08-04 06:22:18,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:19,454 INFO L124 PetriNetUnfolderBase]: 10842/16973 cut-off events. [2023-08-04 06:22:19,455 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2023-08-04 06:22:19,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32092 conditions, 16973 events. 10842/16973 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 114079 event pairs, 2106 based on Foata normal form. 0/14237 useless extension candidates. Maximal degree in co-relation 8489. Up to 13633 conditions per place. [2023-08-04 06:22:19,502 INFO L140 encePairwiseOnDemand]: 215/220 looper letters, 45 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2023-08-04 06:22:19,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 57 transitions, 255 flow [2023-08-04 06:22:19,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:22:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:22:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-04 06:22:19,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546969696969697 [2023-08-04 06:22:19,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-04 06:22:19,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-04 06:22:19,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:19,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-04 06:22:19,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:19,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:19,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:19,507 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 120 flow. Second operand 3 states and 361 transitions. [2023-08-04 06:22:19,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 57 transitions, 255 flow [2023-08-04 06:22:19,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 248 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 06:22:19,509 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 134 flow [2023-08-04 06:22:19,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-04 06:22:19,511 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2023-08-04 06:22:19,511 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 134 flow [2023-08-04 06:22:19,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:19,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:19,511 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:22:19,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 06:22:19,511 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:22:19,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1868098113, now seen corresponding path program 1 times [2023-08-04 06:22:19,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:19,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287656514] [2023-08-04 06:22:19,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:19,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:22:19,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:22:19,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287656514] [2023-08-04 06:22:19,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287656514] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:22:19,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:22:19,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 06:22:19,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077903134] [2023-08-04 06:22:19,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:22:19,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:22:19,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:22:19,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:22:19,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:22:19,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 220 [2023-08-04 06:22:19,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:19,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:22:19,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 220 [2023-08-04 06:22:19,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:20,932 INFO L124 PetriNetUnfolderBase]: 10698/16013 cut-off events. [2023-08-04 06:22:20,932 INFO L125 PetriNetUnfolderBase]: For 1286/1286 co-relation queries the response was YES. [2023-08-04 06:22:20,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33500 conditions, 16013 events. 10698/16013 cut-off events. For 1286/1286 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 104468 event pairs, 8154 based on Foata normal form. 0/13573 useless extension candidates. Maximal degree in co-relation 8829. Up to 14281 conditions per place. [2023-08-04 06:22:21,000 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 42 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-08-04 06:22:21,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 247 flow [2023-08-04 06:22:21,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:22:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:22:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-04 06:22:21,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5242424242424243 [2023-08-04 06:22:21,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-04 06:22:21,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-04 06:22:21,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:21,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-04 06:22:21,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:21,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:21,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:21,008 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 134 flow. Second operand 3 states and 346 transitions. [2023-08-04 06:22:21,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 247 flow [2023-08-04 06:22:21,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 53 transitions, 243 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:22:21,012 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 145 flow [2023-08-04 06:22:21,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2023-08-04 06:22:21,013 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2023-08-04 06:22:21,013 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 145 flow [2023-08-04 06:22:21,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:22:21,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:21,013 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:22:21,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 06:22:21,014 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:22:21,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:21,014 INFO L85 PathProgramCache]: Analyzing trace with hash -2129954816, now seen corresponding path program 1 times [2023-08-04 06:22:21,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:21,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708353336] [2023-08-04 06:22:21,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:21,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:22:21,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:22:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:22:21,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:22:21,066 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:22:21,067 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 06:22:21,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 06:22:21,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 06:22:21,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 06:22:21,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 06:22:21,067 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 06:22:21,068 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 06:22:21,069 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 06:22:21,069 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 06:22:21,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 06:22:21 BasicIcfg [2023-08-04 06:22:21,137 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 06:22:21,138 INFO L158 Benchmark]: Toolchain (without parser) took 18672.53ms. Allocated memory was 341.8MB in the beginning and 2.5GB in the end (delta: 2.1GB). Free memory was 295.9MB in the beginning and 1.5GB in the end (delta: -1.2GB). Peak memory consumption was 874.2MB. Max. memory is 16.0GB. [2023-08-04 06:22:21,138 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 341.8MB. Free memory is still 298.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 06:22:21,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.28ms. Allocated memory is still 341.8MB. Free memory was 295.7MB in the beginning and 272.9MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 06:22:21,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.72ms. Allocated memory is still 341.8MB. Free memory was 272.9MB in the beginning and 270.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:22:21,139 INFO L158 Benchmark]: Boogie Preprocessor took 34.27ms. Allocated memory is still 341.8MB. Free memory was 270.5MB in the beginning and 268.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:22:21,139 INFO L158 Benchmark]: RCFGBuilder took 573.52ms. Allocated memory was 341.8MB in the beginning and 440.4MB in the end (delta: 98.6MB). Free memory was 268.7MB in the beginning and 399.7MB in the end (delta: -131.0MB). Peak memory consumption was 26.0MB. Max. memory is 16.0GB. [2023-08-04 06:22:21,139 INFO L158 Benchmark]: TraceAbstraction took 17517.35ms. Allocated memory was 440.4MB in the beginning and 2.5GB in the end (delta: 2.0GB). Free memory was 398.7MB in the beginning and 1.5GB in the end (delta: -1.1GB). Peak memory consumption was 875.5MB. Max. memory is 16.0GB. [2023-08-04 06:22:21,140 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.10ms. Allocated memory is still 341.8MB. Free memory is still 298.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 477.28ms. Allocated memory is still 341.8MB. Free memory was 295.7MB in the beginning and 272.9MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 63.72ms. Allocated memory is still 341.8MB. Free memory was 272.9MB in the beginning and 270.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.27ms. Allocated memory is still 341.8MB. Free memory was 270.5MB in the beginning and 268.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 573.52ms. Allocated memory was 341.8MB in the beginning and 440.4MB in the end (delta: 98.6MB). Free memory was 268.7MB in the beginning and 399.7MB in the end (delta: -131.0MB). Peak memory consumption was 26.0MB. Max. memory is 16.0GB. * TraceAbstraction took 17517.35ms. Allocated memory was 440.4MB in the beginning and 2.5GB in the end (delta: 2.0GB). Free memory was 398.7MB in the beginning and 1.5GB in the end (delta: -1.1GB). Peak memory consumption was 875.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 105 PlacesBefore, 29 PlacesAfterwards, 104 TransitionsBefore, 25 TransitionsAfterwards, 1472 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 93 TotalNumberOfCompositions, 3530 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1678, independent: 1553, independent conditional: 0, independent unconditional: 1553, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 795, independent: 770, independent conditional: 0, independent unconditional: 770, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1678, independent: 783, independent conditional: 0, independent unconditional: 783, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 795, unknown conditional: 0, unknown unconditional: 795] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 82 PlacesBefore, 22 PlacesAfterwards, 78 TransitionsBefore, 17 TransitionsAfterwards, 620 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 23 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 1319 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 761, independent: 685, independent conditional: 0, independent unconditional: 685, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 317, independent: 308, independent conditional: 0, independent unconditional: 308, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 761, independent: 377, independent conditional: 0, independent unconditional: 377, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 317, unknown conditional: 0, unknown unconditional: 317] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 127 PlacesBefore, 48 PlacesAfterwards, 122 TransitionsBefore, 40 TransitionsAfterwards, 3512 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 97 TotalNumberOfCompositions, 10792 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4711, independent: 4475, independent conditional: 0, independent unconditional: 4475, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1751, independent: 1710, independent conditional: 0, independent unconditional: 1710, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4711, independent: 2765, independent conditional: 0, independent unconditional: 2765, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 1751, unknown conditional: 0, unknown unconditional: 1751] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 187, Positive conditional cache size: 0, Positive unconditional cache size: 187, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1649[2]; [L816] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1649={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] COND TRUE 0 asdf<2 [L816] FCALL, FORK 0 pthread_create(&t1649[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1649[asdf], ((void *)0), P0, ((void *)0))=-4, t1649={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1649={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] COND TRUE 0 asdf<2 [L816] FCALL, FORK 0 pthread_create(&t1649[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1649[asdf], ((void *)0), P0, ((void *)0))=-3, t1649={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1649={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] COND FALSE 0 !(asdf<2) [L817] 0 pthread_t t1650[2]; [L818] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1649={5:0}, t1650={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L818] COND TRUE 0 asdf<2 [L818] FCALL, FORK 0 pthread_create(&t1650[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t1650[asdf], ((void *)0), P1, ((void *)0))=-2, t1649={5:0}, t1650={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L773] 3 y$w_buff1 = y$w_buff0 [L774] 3 y$w_buff0 = 1 [L775] 3 y$w_buff1_used = y$w_buff0_used [L776] 3 y$w_buff0_used = (_Bool)1 [L777] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L777] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L778] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 3 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L818] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1649={5:0}, t1650={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L818] COND TRUE 0 asdf<2 [L818] FCALL, FORK 0 pthread_create(&t1650[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t1650[asdf], ((void *)0), P1, ((void *)0))=-1, t1649={5:0}, t1650={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L773] 4 y$w_buff1 = y$w_buff0 [L774] 4 y$w_buff0 = 1 [L775] 4 y$w_buff1_used = y$w_buff0_used [L776] 4 y$w_buff0_used = (_Bool)1 [L777] CALL 4 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=1, y$w_buff1_used=1, y=0, z=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 120 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.0s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 83 IncrementalHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 2 mSDtfsCounter, 83 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=1, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 51 SizeOfPredicates, 0 NumberOfNonLiveVariables, 151 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.8s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 270 IncrementalHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 9 mSDtfsCounter, 270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=4, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 12/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 120 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.5s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred 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 06:22:21,160 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...