/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_mix009.oepc_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:36:20,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:36:20,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:36:20,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:36:20,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:36:20,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:36:20,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:36:20,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:36:20,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:36:20,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:36:20,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:36:20,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:36:20,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:36:20,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:36:20,348 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:36:20,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:36:20,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:36:20,349 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:36:20,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:36:20,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:36:20,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:36:20,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:36:20,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:36:20,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:36:20,356 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:36:20,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:36:20,356 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:36:20,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:36:20,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:36:20,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:36:20,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:36:20,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:36:20,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:36:20,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:36:20,359 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:36:20,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:36:20,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:36:20,359 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:36:20,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:36:20,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:36:20,360 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:36:20,360 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 05:36:20,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:36:20,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:36:20,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:36:20,573 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:36:20,574 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:36:20,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix009.oepc_bound2.i [2023-08-04 05:36:21,719 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:36:22,030 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:36:22,031 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix009.oepc_bound2.i [2023-08-04 05:36:22,046 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b26c1dfa/0aa5200a302f468bb20e578c879c14de/FLAG70b411b7b [2023-08-04 05:36:22,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b26c1dfa/0aa5200a302f468bb20e578c879c14de [2023-08-04 05:36:22,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:36:22,071 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:36:22,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:36:22,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:36:22,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:36:22,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:36:22" (1/1) ... [2023-08-04 05:36:22,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c93beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:22, skipping insertion in model container [2023-08-04 05:36:22,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:36:22" (1/1) ... [2023-08-04 05:36:22,133 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:36:22,268 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_mix009.oepc_bound2.i[945,958] [2023-08-04 05:36:22,407 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:36:22,415 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:36:22,434 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_mix009.oepc_bound2.i[945,958] [2023-08-04 05:36:22,452 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:36:22,453 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:36:22,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:36:22,539 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:36:22,539 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:36:22,545 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:36:22,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:22 WrapperNode [2023-08-04 05:36:22,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:36:22,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:36:22,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:36:22,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:36:22,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:22" (1/1) ... [2023-08-04 05:36:22,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:22" (1/1) ... [2023-08-04 05:36:22,591 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2023-08-04 05:36:22,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:36:22,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:36:22,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:36:22,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:36:22,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:22" (1/1) ... [2023-08-04 05:36:22,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:22" (1/1) ... [2023-08-04 05:36:22,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:22" (1/1) ... [2023-08-04 05:36:22,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:22" (1/1) ... [2023-08-04 05:36:22,625 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:22" (1/1) ... [2023-08-04 05:36:22,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:22" (1/1) ... [2023-08-04 05:36:22,630 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:22" (1/1) ... [2023-08-04 05:36:22,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:22" (1/1) ... [2023-08-04 05:36:22,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:36:22,635 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:36:22,636 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:36:22,636 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:36:22,636 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:22" (1/1) ... [2023-08-04 05:36:22,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:36:22,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:36:22,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 05:36:22,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 05:36:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:36:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:36:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:36:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:36:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:36:22,796 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 05:36:22,796 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 05:36:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 05:36:22,797 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 05:36:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:36:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:36:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:36:22,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:36:22,799 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 05:36:22,951 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:36:22,952 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:36:23,238 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:36:23,382 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:36:23,382 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-04 05:36:23,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:36:23 BoogieIcfgContainer [2023-08-04 05:36:23,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:36:23,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:36:23,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:36:23,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:36:23,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:36:22" (1/3) ... [2023-08-04 05:36:23,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38cb085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:36:23, skipping insertion in model container [2023-08-04 05:36:23,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:22" (2/3) ... [2023-08-04 05:36:23,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38cb085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:36:23, skipping insertion in model container [2023-08-04 05:36:23,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:36:23" (3/3) ... [2023-08-04 05:36:23,396 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix009.oepc_bound2.i [2023-08-04 05:36:23,403 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:36:23,409 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:36:23,410 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 05:36:23,410 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:36:23,453 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:36:23,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 108 transitions, 226 flow [2023-08-04 05:36:23,586 INFO L124 PetriNetUnfolderBase]: 14/224 cut-off events. [2023-08-04 05:36:23,587 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:23,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 224 events. 14/224 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 623 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 135. Up to 8 conditions per place. [2023-08-04 05:36:23,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 108 transitions, 226 flow [2023-08-04 05:36:23,598 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 108 transitions, 226 flow [2023-08-04 05:36:23,601 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:36:23,613 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 108 transitions, 226 flow [2023-08-04 05:36:23,617 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 108 transitions, 226 flow [2023-08-04 05:36:23,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 108 transitions, 226 flow [2023-08-04 05:36:23,668 INFO L124 PetriNetUnfolderBase]: 14/224 cut-off events. [2023-08-04 05:36:23,668 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:23,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 224 events. 14/224 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 623 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 135. Up to 8 conditions per place. [2023-08-04 05:36:23,672 INFO L119 LiptonReduction]: Number of co-enabled transitions 1792 [2023-08-04 05:36:26,586 INFO L134 LiptonReduction]: Checked pairs total: 4285 [2023-08-04 05:36:26,586 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-08-04 05:36:26,607 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:36:26,615 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;@1fa744e9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:36:26,615 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:36:26,619 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:36:26,620 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2023-08-04 05:36:26,620 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:26,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:36:26,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 05:36:26,621 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:36:26,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:36:26,626 INFO L85 PathProgramCache]: Analyzing trace with hash 14806028, now seen corresponding path program 1 times [2023-08-04 05:36:26,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:36:26,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977619304] [2023-08-04 05:36:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:26,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:36:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:27,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:36:27,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:36:27,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977619304] [2023-08-04 05:36:27,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977619304] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:36:27,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:36:27,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:36:27,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897685509] [2023-08-04 05:36:27,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:36:27,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:36:27,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:36:27,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:36:27,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:36:27,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 203 [2023-08-04 05:36:27,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:27,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:36:27,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 203 [2023-08-04 05:36:27,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:36:27,252 INFO L124 PetriNetUnfolderBase]: 316/636 cut-off events. [2023-08-04 05:36:27,252 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 05:36:27,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 636 events. 316/636 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3132 event pairs, 48 based on Foata normal form. 0/554 useless extension candidates. Maximal degree in co-relation 1083. Up to 445 conditions per place. [2023-08-04 05:36:27,258 INFO L140 encePairwiseOnDemand]: 199/203 looper letters, 29 selfloop transitions, 2 changer transitions 5/38 dead transitions. [2023-08-04 05:36:27,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 157 flow [2023-08-04 05:36:27,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:36:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:36:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-08-04 05:36:27,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2023-08-04 05:36:27,271 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-08-04 05:36:27,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-08-04 05:36:27,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:36:27,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-08-04 05:36:27,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:27,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:27,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:27,289 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 62 flow. Second operand 3 states and 319 transitions. [2023-08-04 05:36:27,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 157 flow [2023-08-04 05:36:27,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 157 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:36:27,295 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-08-04 05:36:27,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=58, 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=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-04 05:36:27,300 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2023-08-04 05:36:27,300 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-08-04 05:36:27,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:27,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:36:27,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 05:36:27,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 05:36:27,301 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:36:27,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:36:27,302 INFO L85 PathProgramCache]: Analyzing trace with hash 459243342, now seen corresponding path program 1 times [2023-08-04 05:36:27,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:36:27,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283889843] [2023-08-04 05:36:27,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:27,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:36:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:36:27,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:36:27,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283889843] [2023-08-04 05:36:27,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283889843] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:36:27,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:36:27,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:36:27,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554696089] [2023-08-04 05:36:27,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:36:27,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:36:27,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:36:27,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:36:27,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:36:27,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 203 [2023-08-04 05:36:27,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:27,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:36:27,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 203 [2023-08-04 05:36:27,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:36:27,444 INFO L124 PetriNetUnfolderBase]: 248/461 cut-off events. [2023-08-04 05:36:27,444 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-08-04 05:36:27,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 461 events. 248/461 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1910 event pairs, 172 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 943. Up to 434 conditions per place. [2023-08-04 05:36:27,447 INFO L140 encePairwiseOnDemand]: 200/203 looper letters, 21 selfloop transitions, 2 changer transitions 1/26 dead transitions. [2023-08-04 05:36:27,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 112 flow [2023-08-04 05:36:27,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:36:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:36:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2023-08-04 05:36:27,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48932676518883417 [2023-08-04 05:36:27,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 298 transitions. [2023-08-04 05:36:27,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 298 transitions. [2023-08-04 05:36:27,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:36:27,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 298 transitions. [2023-08-04 05:36:27,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:27,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:27,453 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:27,453 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 298 transitions. [2023-08-04 05:36:27,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 112 flow [2023-08-04 05:36:27,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:36:27,454 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 56 flow [2023-08-04 05:36:27,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-08-04 05:36:27,455 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-08-04 05:36:27,456 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 56 flow [2023-08-04 05:36:27,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:27,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:36:27,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:36:27,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 05:36:27,457 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:36:27,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:36:27,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1453503463, now seen corresponding path program 1 times [2023-08-04 05:36:27,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:36:27,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616489151] [2023-08-04 05:36:27,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:27,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:36:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:36:27,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:36:27,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616489151] [2023-08-04 05:36:27,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616489151] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:36:27,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785895405] [2023-08-04 05:36:27,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:27,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:36:27,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:36:27,531 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:36:27,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 05:36:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:27,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:36:27,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:36:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:36:27,646 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:36:27,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785895405] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:36:27,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:36:27,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:36:27,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285389700] [2023-08-04 05:36:27,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:36:27,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:36:27,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:36:27,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:36:27,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:36:27,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 203 [2023-08-04 05:36:27,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:27,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:36:27,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 203 [2023-08-04 05:36:27,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:36:27,751 INFO L124 PetriNetUnfolderBase]: 236/426 cut-off events. [2023-08-04 05:36:27,751 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 05:36:27,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 426 events. 236/426 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1860 event pairs, 108 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 858. Up to 351 conditions per place. [2023-08-04 05:36:27,755 INFO L140 encePairwiseOnDemand]: 200/203 looper letters, 25 selfloop transitions, 2 changer transitions 1/30 dead transitions. [2023-08-04 05:36:27,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 130 flow [2023-08-04 05:36:27,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:36:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:36:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2023-08-04 05:36:27,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49589490968801314 [2023-08-04 05:36:27,757 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2023-08-04 05:36:27,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2023-08-04 05:36:27,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:36:27,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2023-08-04 05:36:27,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:27,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:27,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:27,761 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 56 flow. Second operand 3 states and 302 transitions. [2023-08-04 05:36:27,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 130 flow [2023-08-04 05:36:27,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:36:27,763 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 60 flow [2023-08-04 05:36:27,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-08-04 05:36:27,764 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2023-08-04 05:36:27,765 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 60 flow [2023-08-04 05:36:27,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:27,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:36:27,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:36:27,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 05:36:27,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:36:27,972 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:36:27,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:36:27,972 INFO L85 PathProgramCache]: Analyzing trace with hash 61375296, now seen corresponding path program 1 times [2023-08-04 05:36:27,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:36:27,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160209303] [2023-08-04 05:36:27,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:27,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:36:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:36:28,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:36:28,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160209303] [2023-08-04 05:36:28,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160209303] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:36:28,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778084105] [2023-08-04 05:36:28,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:28,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:36:28,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:36:28,030 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:36:28,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 05:36:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:28,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:36:28,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:36:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:36:28,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:36:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:36:28,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778084105] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:36:28,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:36:28,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:36:28,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837496053] [2023-08-04 05:36:28,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:36:28,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:36:28,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:36:28,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:36:28,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:36:28,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 203 [2023-08-04 05:36:28,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:28,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:36:28,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 203 [2023-08-04 05:36:28,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:36:28,207 INFO L124 PetriNetUnfolderBase]: 8/26 cut-off events. [2023-08-04 05:36:28,207 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-04 05:36:28,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 26 events. 8/26 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 5/31 useless extension candidates. Maximal degree in co-relation 58. Up to 18 conditions per place. [2023-08-04 05:36:28,207 INFO L140 encePairwiseOnDemand]: 200/203 looper letters, 0 selfloop transitions, 0 changer transitions 14/14 dead transitions. [2023-08-04 05:36:28,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 14 transitions, 59 flow [2023-08-04 05:36:28,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:36:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:36:28,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 374 transitions. [2023-08-04 05:36:28,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4605911330049261 [2023-08-04 05:36:28,209 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 374 transitions. [2023-08-04 05:36:28,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 374 transitions. [2023-08-04 05:36:28,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:36:28,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 374 transitions. [2023-08-04 05:36:28,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:28,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:28,213 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:28,213 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 60 flow. Second operand 4 states and 374 transitions. [2023-08-04 05:36:28,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 14 transitions, 59 flow [2023-08-04 05:36:28,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 14 transitions, 57 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:36:28,214 INFO L231 Difference]: Finished difference. Result has 18 places, 0 transitions, 0 flow [2023-08-04 05:36:28,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=21, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=18, PETRI_TRANSITIONS=0} [2023-08-04 05:36:28,215 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -12 predicate places. [2023-08-04 05:36:28,215 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 0 transitions, 0 flow [2023-08-04 05:36:28,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:28,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 05:36:28,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 05:36:28,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 05:36:28,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 05:36:28,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-04 05:36:28,424 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 05:36:28,426 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 05:36:28,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 108 transitions, 226 flow [2023-08-04 05:36:28,452 INFO L124 PetriNetUnfolderBase]: 14/224 cut-off events. [2023-08-04 05:36:28,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:28,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 224 events. 14/224 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 623 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 135. Up to 8 conditions per place. [2023-08-04 05:36:28,454 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 108 transitions, 226 flow [2023-08-04 05:36:28,455 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 81 transitions, 172 flow [2023-08-04 05:36:28,455 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:36:28,455 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 81 transitions, 172 flow [2023-08-04 05:36:28,456 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 81 transitions, 172 flow [2023-08-04 05:36:28,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 81 transitions, 172 flow [2023-08-04 05:36:28,467 INFO L124 PetriNetUnfolderBase]: 2/116 cut-off events. [2023-08-04 05:36:28,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:28,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 168 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. [2023-08-04 05:36:28,469 INFO L119 LiptonReduction]: Number of co-enabled transitions 820 [2023-08-04 05:36:31,154 INFO L134 LiptonReduction]: Checked pairs total: 1587 [2023-08-04 05:36:31,154 INFO L136 LiptonReduction]: Total number of compositions: 68 [2023-08-04 05:36:31,156 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 05:36:31,157 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;@1fa744e9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:36:31,157 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 05:36:31,159 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:36:31,160 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-04 05:36:31,160 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:31,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:36:31,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 05:36:31,160 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 05:36:31,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:36:31,160 INFO L85 PathProgramCache]: Analyzing trace with hash 525456588, now seen corresponding path program 1 times [2023-08-04 05:36:31,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:36:31,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226962578] [2023-08-04 05:36:31,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:31,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:36:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:31,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:36:31,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:36:31,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226962578] [2023-08-04 05:36:31,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226962578] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:36:31,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:36:31,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:36:31,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539572056] [2023-08-04 05:36:31,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:36:31,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:36:31,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:36:31,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:36:31,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:36:31,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 176 [2023-08-04 05:36:31,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:31,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:36:31,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 176 [2023-08-04 05:36:31,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:36:31,246 INFO L124 PetriNetUnfolderBase]: 89/187 cut-off events. [2023-08-04 05:36:31,247 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:31,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 187 events. 89/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 654 event pairs, 24 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 368. Up to 168 conditions per place. [2023-08-04 05:36:31,248 INFO L140 encePairwiseOnDemand]: 173/176 looper letters, 20 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2023-08-04 05:36:31,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 102 flow [2023-08-04 05:36:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:36:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:36:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-08-04 05:36:31,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2023-08-04 05:36:31,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-08-04 05:36:31,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-08-04 05:36:31,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:36:31,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-08-04 05:36:31,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:31,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:31,252 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:31,252 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 3 states and 296 transitions. [2023-08-04 05:36:31,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 102 flow [2023-08-04 05:36:31,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:36:31,253 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 54 flow [2023-08-04 05:36:31,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-08-04 05:36:31,254 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 3 predicate places. [2023-08-04 05:36:31,254 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 54 flow [2023-08-04 05:36:31,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:31,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:36:31,255 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 05:36:31,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 05:36:31,255 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 05:36:31,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:36:31,255 INFO L85 PathProgramCache]: Analyzing trace with hash -900012524, now seen corresponding path program 1 times [2023-08-04 05:36:31,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:36:31,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682870858] [2023-08-04 05:36:31,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:36:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:36:31,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:36:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:36:31,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:36:31,284 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:36:31,285 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 05:36:31,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 05:36:31,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 05:36:31,285 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 05:36:31,286 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 05:36:31,286 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 05:36:31,286 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 05:36:31,305 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:36:31,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 128 transitions, 280 flow [2023-08-04 05:36:31,343 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-04 05:36:31,343 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 05:36:31,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 460 events. 30/460 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1945 event pairs, 0 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 335. Up to 18 conditions per place. [2023-08-04 05:36:31,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 128 transitions, 280 flow [2023-08-04 05:36:31,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 128 transitions, 280 flow [2023-08-04 05:36:31,346 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:36:31,346 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 128 transitions, 280 flow [2023-08-04 05:36:31,347 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 128 transitions, 280 flow [2023-08-04 05:36:31,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 128 transitions, 280 flow [2023-08-04 05:36:31,383 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-04 05:36:31,383 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 05:36:31,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 460 events. 30/460 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1945 event pairs, 0 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 335. Up to 18 conditions per place. [2023-08-04 05:36:31,391 INFO L119 LiptonReduction]: Number of co-enabled transitions 4308 [2023-08-04 05:36:34,128 INFO L134 LiptonReduction]: Checked pairs total: 14577 [2023-08-04 05:36:34,129 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-08-04 05:36:34,130 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:36:34,131 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;@1fa744e9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:36:34,131 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 05:36:34,133 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:36:34,133 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-04 05:36:34,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:34,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:36:34,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 05:36:34,134 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:36:34,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:36:34,134 INFO L85 PathProgramCache]: Analyzing trace with hash 24592169, now seen corresponding path program 1 times [2023-08-04 05:36:34,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:36:34,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556442370] [2023-08-04 05:36:34,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:34,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:36:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:36:34,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:36:34,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556442370] [2023-08-04 05:36:34,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556442370] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:36:34,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:36:34,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:36:34,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264128938] [2023-08-04 05:36:34,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:36:34,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:36:34,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:36:34,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:36:34,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:36:34,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 229 [2023-08-04 05:36:34,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:34,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:36:34,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 229 [2023-08-04 05:36:34,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:36:37,108 INFO L124 PetriNetUnfolderBase]: 15750/25070 cut-off events. [2023-08-04 05:36:37,109 INFO L125 PetriNetUnfolderBase]: For 443/443 co-relation queries the response was YES. [2023-08-04 05:36:37,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47231 conditions, 25070 events. 15750/25070 cut-off events. For 443/443 co-relation queries the response was YES. Maximal size of possible extension queue 978. Compared 187918 event pairs, 3042 based on Foata normal form. 0/21121 useless extension candidates. Maximal degree in co-relation 40029. Up to 20155 conditions per place. [2023-08-04 05:36:37,295 INFO L140 encePairwiseOnDemand]: 223/229 looper letters, 49 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2023-08-04 05:36:37,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 269 flow [2023-08-04 05:36:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:36:37,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:36:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-08-04 05:36:37,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5487627365356623 [2023-08-04 05:36:37,298 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-08-04 05:36:37,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-08-04 05:36:37,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:36:37,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-08-04 05:36:37,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:37,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:37,301 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:37,301 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 110 flow. Second operand 3 states and 377 transitions. [2023-08-04 05:36:37,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 269 flow [2023-08-04 05:36:37,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 265 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 05:36:37,306 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 125 flow [2023-08-04 05:36:37,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2023-08-04 05:36:37,308 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-04 05:36:37,308 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 125 flow [2023-08-04 05:36:37,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:37,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:36:37,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 05:36:37,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 05:36:37,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:36:37,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:36:37,309 INFO L85 PathProgramCache]: Analyzing trace with hash 762680554, now seen corresponding path program 1 times [2023-08-04 05:36:37,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:36:37,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261099548] [2023-08-04 05:36:37,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:37,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:36:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:36:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:36:37,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:36:37,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261099548] [2023-08-04 05:36:37,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261099548] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:36:37,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:36:37,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:36:37,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516325113] [2023-08-04 05:36:37,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:36:37,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:36:37,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:36:37,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:36:37,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:36:37,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 229 [2023-08-04 05:36:37,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:37,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:36:37,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 229 [2023-08-04 05:36:37,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:36:40,065 INFO L124 PetriNetUnfolderBase]: 15466/22070 cut-off events. [2023-08-04 05:36:40,065 INFO L125 PetriNetUnfolderBase]: For 2359/2359 co-relation queries the response was YES. [2023-08-04 05:36:40,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47705 conditions, 22070 events. 15466/22070 cut-off events. For 2359/2359 co-relation queries the response was YES. Maximal size of possible extension queue 1077. Compared 144058 event pairs, 14370 based on Foata normal form. 0/18667 useless extension candidates. Maximal degree in co-relation 30910. Up to 21157 conditions per place. [2023-08-04 05:36:40,187 INFO L140 encePairwiseOnDemand]: 226/229 looper letters, 35 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-08-04 05:36:40,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 212 flow [2023-08-04 05:36:40,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:36:40,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:36:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-04 05:36:40,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5065502183406113 [2023-08-04 05:36:40,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-04 05:36:40,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-04 05:36:40,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:36:40,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-04 05:36:40,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:40,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:40,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:40,192 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 125 flow. Second operand 3 states and 348 transitions. [2023-08-04 05:36:40,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 212 flow [2023-08-04 05:36:40,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:36:40,194 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 134 flow [2023-08-04 05:36:40,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-08-04 05:36:40,196 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2023-08-04 05:36:40,197 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 134 flow [2023-08-04 05:36:40,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:36:40,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:36:40,197 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:36:40,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 05:36:40,197 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:36:40,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:36:40,198 INFO L85 PathProgramCache]: Analyzing trace with hash 137348037, now seen corresponding path program 1 times [2023-08-04 05:36:40,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:36:40,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912378367] [2023-08-04 05:36:40,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:36:40,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:36:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:36:40,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:36:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:36:40,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:36:40,240 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:36:40,240 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 05:36:40,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 05:36:40,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 05:36:40,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 05:36:40,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 05:36:40,241 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 05:36:40,242 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 05:36:40,248 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 05:36:40,248 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 05:36:40,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 05:36:40 BasicIcfg [2023-08-04 05:36:40,303 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 05:36:40,303 INFO L158 Benchmark]: Toolchain (without parser) took 18232.40ms. Allocated memory was 507.5MB in the beginning and 1.3GB in the end (delta: 778.0MB). Free memory was 460.2MB in the beginning and 826.6MB in the end (delta: -366.4MB). Peak memory consumption was 413.0MB. Max. memory is 16.0GB. [2023-08-04 05:36:40,303 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 343.9MB. Free memory is still 297.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 05:36:40,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.55ms. Allocated memory is still 507.5MB. Free memory was 459.8MB in the beginning and 437.0MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 05:36:40,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.77ms. Allocated memory is still 507.5MB. Free memory was 437.0MB in the beginning and 434.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:36:40,304 INFO L158 Benchmark]: Boogie Preprocessor took 42.11ms. Allocated memory is still 507.5MB. Free memory was 434.3MB in the beginning and 432.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:36:40,307 INFO L158 Benchmark]: RCFGBuilder took 749.72ms. Allocated memory is still 507.5MB. Free memory was 432.6MB in the beginning and 458.8MB in the end (delta: -26.3MB). Peak memory consumption was 22.6MB. Max. memory is 16.0GB. [2023-08-04 05:36:40,307 INFO L158 Benchmark]: TraceAbstraction took 16914.29ms. Allocated memory was 507.5MB in the beginning and 1.3GB in the end (delta: 778.0MB). Free memory was 457.8MB in the beginning and 826.6MB in the end (delta: -368.8MB). Peak memory consumption was 409.2MB. Max. memory is 16.0GB. [2023-08-04 05:36:40,310 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.12ms. Allocated memory is still 343.9MB. Free memory is still 297.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 472.55ms. Allocated memory is still 507.5MB. Free memory was 459.8MB in the beginning and 437.0MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 45.77ms. Allocated memory is still 507.5MB. Free memory was 437.0MB in the beginning and 434.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 42.11ms. Allocated memory is still 507.5MB. Free memory was 434.3MB in the beginning and 432.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 749.72ms. Allocated memory is still 507.5MB. Free memory was 432.6MB in the beginning and 458.8MB in the end (delta: -26.3MB). Peak memory consumption was 22.6MB. Max. memory is 16.0GB. * TraceAbstraction took 16914.29ms. Allocated memory was 507.5MB in the beginning and 1.3GB in the end (delta: 778.0MB). Free memory was 457.8MB in the beginning and 826.6MB in the end (delta: -368.8MB). Peak memory consumption was 409.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 109 PlacesBefore, 30 PlacesAfterwards, 108 TransitionsBefore, 26 TransitionsAfterwards, 1792 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 3 ChoiceCompositions, 95 TotalNumberOfCompositions, 4285 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2585, independent: 2445, independent conditional: 0, independent unconditional: 2445, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1026, independent: 991, independent conditional: 0, independent unconditional: 991, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2585, independent: 1454, independent conditional: 0, independent unconditional: 1454, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 1026, unknown conditional: 0, unknown unconditional: 1026] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, 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.7s, 85 PlacesBefore, 23 PlacesAfterwards, 81 TransitionsBefore, 18 TransitionsAfterwards, 820 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, 1587 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1004, independent: 918, independent conditional: 0, independent unconditional: 918, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 443, independent: 433, independent conditional: 0, independent unconditional: 433, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1004, independent: 485, independent conditional: 0, independent unconditional: 485, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 443, unknown conditional: 0, unknown unconditional: 443] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 133 PlacesBefore, 51 PlacesAfterwards, 128 TransitionsBefore, 43 TransitionsAfterwards, 4308 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 101 TotalNumberOfCompositions, 14577 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5124, independent: 4839, independent conditional: 0, independent unconditional: 4839, dependent: 285, dependent conditional: 0, dependent unconditional: 285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2177, independent: 2113, independent conditional: 0, independent unconditional: 2113, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5124, independent: 2726, independent conditional: 0, independent unconditional: 2726, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 2177, unknown conditional: 0, unknown unconditional: 2177] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 254, Positive conditional cache size: 0, Positive unconditional cache size: 254, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$read_delayed; [L734] 0 int *z$read_delayed_var; [L735] 0 int z$w_buff0; [L736] 0 _Bool z$w_buff0_used; [L737] 0 int z$w_buff1; [L738] 0 _Bool z$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L822] 0 pthread_t t241[2]; [L823] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t241={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] COND TRUE 0 asdf<2 [L823] FCALL, FORK 0 pthread_create(&t241[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t241[asdf], ((void *)0), P0, ((void *)0))=-1, t241={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L744] 1 z$w_buff1 = z$w_buff0 [L745] 1 z$w_buff0 = 1 [L746] 1 z$w_buff1_used = z$w_buff0_used [L747] 1 z$w_buff0_used = (_Bool)1 [L748] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L748] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L749] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L750] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L751] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t241={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] COND TRUE 0 asdf<2 [L823] FCALL, FORK 0 pthread_create(&t241[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t241[asdf], ((void *)0), P0, ((void *)0))=0, t241={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L744] 2 z$w_buff1 = z$w_buff0 [L745] 2 z$w_buff0 = 1 [L746] 2 z$w_buff1_used = z$w_buff0_used [L747] 2 z$w_buff0_used = (_Bool)1 [L748] CALL 2 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, expression=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=1, z$w_buff1_used=1, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 125 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.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 9 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, 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.5s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 309 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 4/8 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, 145 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: 8.9s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 0 mSDtfsCounter, 128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 27 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 125 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.9s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 7 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 05:36:40,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...