/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_safe029_power.opt_pso.opt_rmo.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 07:24:35,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 07:24:35,501 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 07:24:35,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 07:24:35,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 07:24:35,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 07:24:35,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 07:24:35,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 07:24:35,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 07:24:35,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 07:24:35,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 07:24:35,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 07:24:35,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 07:24:35,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 07:24:35,527 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 07:24:35,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 07:24:35,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 07:24:35,528 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 07:24:35,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 07:24:35,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 07:24:35,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 07:24:35,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 07:24:35,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 07:24:35,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 07:24:35,530 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 07:24:35,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 07:24:35,531 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 07:24:35,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 07:24:35,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 07:24:35,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 07:24:35,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:24:35,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 07:24:35,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 07:24:35,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 07:24:35,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 07:24:35,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 07:24:35,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 07:24:35,534 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 07:24:35,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 07:24:35,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 07:24:35,535 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 07:24:35,536 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 07:24:35,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 07:24:35,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 07:24:35,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 07:24:35,808 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 07:24:35,808 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 07:24:35,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe029_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-04 07:24:36,971 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 07:24:37,252 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 07:24:37,253 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe029_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-04 07:24:37,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89aa7f2ae/800bac34c2a241af8b993d58879094e7/FLAG3c3e6a20f [2023-08-04 07:24:37,278 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89aa7f2ae/800bac34c2a241af8b993d58879094e7 [2023-08-04 07:24:37,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 07:24:37,281 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 07:24:37,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 07:24:37,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 07:24:37,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 07:24:37,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:24:37" (1/1) ... [2023-08-04 07:24:37,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b896bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:37, skipping insertion in model container [2023-08-04 07:24:37,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:24:37" (1/1) ... [2023-08-04 07:24:37,339 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 07:24:37,463 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_safe029_power.opt_pso.opt_rmo.opt_bound2.i[967,980] [2023-08-04 07:24:37,630 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:24:37,638 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 07:24:37,649 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_safe029_power.opt_pso.opt_rmo.opt_bound2.i[967,980] [2023-08-04 07:24:37,669 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 07:24:37,680 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 07:24:37,713 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:24:37,732 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:24:37,732 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:24:37,737 INFO L206 MainTranslator]: Completed translation [2023-08-04 07:24:37,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:37 WrapperNode [2023-08-04 07:24:37,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 07:24:37,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 07:24:37,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 07:24:37,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 07:24:37,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:37" (1/1) ... [2023-08-04 07:24:37,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:37" (1/1) ... [2023-08-04 07:24:37,783 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-04 07:24:37,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 07:24:37,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 07:24:37,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 07:24:37,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 07:24:37,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:37" (1/1) ... [2023-08-04 07:24:37,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:37" (1/1) ... [2023-08-04 07:24:37,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:37" (1/1) ... [2023-08-04 07:24:37,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:37" (1/1) ... [2023-08-04 07:24:37,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:37" (1/1) ... [2023-08-04 07:24:37,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:37" (1/1) ... [2023-08-04 07:24:37,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:37" (1/1) ... [2023-08-04 07:24:37,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:37" (1/1) ... [2023-08-04 07:24:37,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 07:24:37,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 07:24:37,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 07:24:37,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 07:24:37,832 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:37" (1/1) ... [2023-08-04 07:24:37,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:24:37,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:24:37,868 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 07:24:37,869 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 07:24:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 07:24:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 07:24:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 07:24:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 07:24:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 07:24:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 07:24:37,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 07:24:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 07:24:37,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 07:24:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 07:24:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 07:24:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 07:24:37,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 07:24:37,894 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 07:24:38,003 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 07:24:38,005 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 07:24:38,247 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 07:24:38,382 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 07:24:38,382 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-04 07:24:38,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:24:38 BoogieIcfgContainer [2023-08-04 07:24:38,384 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 07:24:38,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 07:24:38,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 07:24:38,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 07:24:38,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 07:24:37" (1/3) ... [2023-08-04 07:24:38,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc4890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:24:38, skipping insertion in model container [2023-08-04 07:24:38,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:37" (2/3) ... [2023-08-04 07:24:38,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc4890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:24:38, skipping insertion in model container [2023-08-04 07:24:38,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:24:38" (3/3) ... [2023-08-04 07:24:38,394 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe029_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-04 07:24:38,402 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 07:24:38,411 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 07:24:38,411 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 07:24:38,411 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 07:24:38,471 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:24:38,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 100 transitions, 210 flow [2023-08-04 07:24:38,610 INFO L124 PetriNetUnfolderBase]: 14/216 cut-off events. [2023-08-04 07:24:38,611 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:38,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 216 events. 14/216 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 603 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2023-08-04 07:24:38,615 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 100 transitions, 210 flow [2023-08-04 07:24:38,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 99 transitions, 206 flow [2023-08-04 07:24:38,624 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:24:38,649 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 99 transitions, 206 flow [2023-08-04 07:24:38,652 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 99 transitions, 206 flow [2023-08-04 07:24:38,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 99 transitions, 206 flow [2023-08-04 07:24:38,704 INFO L124 PetriNetUnfolderBase]: 14/215 cut-off events. [2023-08-04 07:24:38,705 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:38,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 215 events. 14/215 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 599 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 125. Up to 8 conditions per place. [2023-08-04 07:24:38,709 INFO L119 LiptonReduction]: Number of co-enabled transitions 1418 [2023-08-04 07:24:41,488 INFO L134 LiptonReduction]: Checked pairs total: 3471 [2023-08-04 07:24:41,489 INFO L136 LiptonReduction]: Total number of compositions: 89 [2023-08-04 07:24:41,500 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:24:41,505 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;@59c6efed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:24:41,506 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 07:24:41,510 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:24:41,510 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-04 07:24:41,510 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:41,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:41,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 07:24:41,511 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:24:41,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash 436385582, now seen corresponding path program 1 times [2023-08-04 07:24:41,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:41,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578847626] [2023-08-04 07:24:41,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:41,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 07:24:41,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:41,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578847626] [2023-08-04 07:24:41,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578847626] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:24:41,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:24:41,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:24:41,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892242740] [2023-08-04 07:24:41,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:24:41,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:24:41,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:41,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:24:41,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:24:41,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 189 [2023-08-04 07:24:41,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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 07:24:41,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:41,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 189 [2023-08-04 07:24:41,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:41,947 INFO L124 PetriNetUnfolderBase]: 293/540 cut-off events. [2023-08-04 07:24:41,947 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:41,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 540 events. 293/540 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2626 event pairs, 128 based on Foata normal form. 24/448 useless extension candidates. Maximal degree in co-relation 1077. Up to 514 conditions per place. [2023-08-04 07:24:41,955 INFO L140 encePairwiseOnDemand]: 185/189 looper letters, 22 selfloop transitions, 2 changer transitions 1/28 dead transitions. [2023-08-04 07:24:41,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 114 flow [2023-08-04 07:24:41,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:24:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:24:41,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2023-08-04 07:24:41,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48677248677248675 [2023-08-04 07:24:41,969 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 276 transitions. [2023-08-04 07:24:41,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 276 transitions. [2023-08-04 07:24:41,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:41,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 276 transitions. [2023-08-04 07:24:41,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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 07:24:41,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 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 07:24:41,979 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 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 07:24:41,981 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 58 flow. Second operand 3 states and 276 transitions. [2023-08-04 07:24:41,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 114 flow [2023-08-04 07:24:41,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:24:41,984 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 64 flow [2023-08-04 07:24:41,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-04 07:24:41,988 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2023-08-04 07:24:41,988 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 64 flow [2023-08-04 07:24:41,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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 07:24:41,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:41,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:24:41,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 07:24:41,990 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:24:41,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:41,991 INFO L85 PathProgramCache]: Analyzing trace with hash -719647952, now seen corresponding path program 1 times [2023-08-04 07:24:41,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:41,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64985028] [2023-08-04 07:24:41,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:41,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:42,091 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 07:24:42,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:42,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64985028] [2023-08-04 07:24:42,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64985028] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:24:42,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569944618] [2023-08-04 07:24:42,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:42,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:24:42,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:24:42,097 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 07:24:42,112 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 07:24:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:42,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:24:42,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:24:42,273 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 07:24:42,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:24:42,294 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 07:24:42,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569944618] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:24:42,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:24:42,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:24:42,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156372746] [2023-08-04 07:24:42,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:24:42,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:24:42,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:42,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:24:42,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:24:42,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 189 [2023-08-04 07:24:42,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 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 07:24:42,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:42,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 189 [2023-08-04 07:24:42,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:42,331 INFO L124 PetriNetUnfolderBase]: 6/21 cut-off events. [2023-08-04 07:24:42,331 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 07:24:42,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 21 events. 6/21 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 4/25 useless extension candidates. Maximal degree in co-relation 52. Up to 14 conditions per place. [2023-08-04 07:24:42,332 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2023-08-04 07:24:42,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 12 transitions, 55 flow [2023-08-04 07:24:42,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:24:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:24:42,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 340 transitions. [2023-08-04 07:24:42,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497354497354497 [2023-08-04 07:24:42,339 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 340 transitions. [2023-08-04 07:24:42,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 340 transitions. [2023-08-04 07:24:42,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:42,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 340 transitions. [2023-08-04 07:24:42,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:42,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 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 07:24:42,343 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 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 07:24:42,343 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 64 flow. Second operand 4 states and 340 transitions. [2023-08-04 07:24:42,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 12 transitions, 55 flow [2023-08-04 07:24:42,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 12 transitions, 49 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 07:24:42,344 INFO L231 Difference]: Finished difference. Result has 15 places, 0 transitions, 0 flow [2023-08-04 07:24:42,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=15, PETRI_TRANSITIONS=0} [2023-08-04 07:24:42,345 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -14 predicate places. [2023-08-04 07:24:42,345 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 0 transitions, 0 flow [2023-08-04 07:24:42,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 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 07:24:42,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 07:24:42,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 07:24:42,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 07:24:42,357 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 07:24:42,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:24:42,554 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 07:24:42,556 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 07:24:42,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 100 transitions, 210 flow [2023-08-04 07:24:42,577 INFO L124 PetriNetUnfolderBase]: 14/216 cut-off events. [2023-08-04 07:24:42,578 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:42,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 216 events. 14/216 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 603 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2023-08-04 07:24:42,578 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 100 transitions, 210 flow [2023-08-04 07:24:42,579 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 73 transitions, 156 flow [2023-08-04 07:24:42,579 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:24:42,579 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 73 transitions, 156 flow [2023-08-04 07:24:42,580 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 73 transitions, 156 flow [2023-08-04 07:24:42,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 73 transitions, 156 flow [2023-08-04 07:24:42,588 INFO L124 PetriNetUnfolderBase]: 2/108 cut-off events. [2023-08-04 07:24:42,588 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:42,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 157 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. [2023-08-04 07:24:42,589 INFO L119 LiptonReduction]: Number of co-enabled transitions 622 [2023-08-04 07:24:44,668 INFO L134 LiptonReduction]: Checked pairs total: 1595 [2023-08-04 07:24:44,669 INFO L136 LiptonReduction]: Total number of compositions: 60 [2023-08-04 07:24:44,671 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 07:24:44,671 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;@59c6efed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:24:44,672 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 07:24:44,674 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:24:44,674 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-04 07:24:44,674 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:44,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:44,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 07:24:44,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 07:24:44,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:44,675 INFO L85 PathProgramCache]: Analyzing trace with hash 494007751, now seen corresponding path program 1 times [2023-08-04 07:24:44,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:44,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796026269] [2023-08-04 07:24:44,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:44,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:44,713 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 07:24:44,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:44,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796026269] [2023-08-04 07:24:44,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796026269] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:24:44,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:24:44,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:24:44,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493447971] [2023-08-04 07:24:44,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:24:44,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:24:44,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:44,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:24:44,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:24:44,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 160 [2023-08-04 07:24:44,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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 07:24:44,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:44,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 160 [2023-08-04 07:24:44,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:44,763 INFO L124 PetriNetUnfolderBase]: 55/138 cut-off events. [2023-08-04 07:24:44,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:44,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 138 events. 55/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 547 event pairs, 16 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 265. Up to 108 conditions per place. [2023-08-04 07:24:44,764 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 16 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-08-04 07:24:44,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 22 transitions, 90 flow [2023-08-04 07:24:44,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:24:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:24:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2023-08-04 07:24:44,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2023-08-04 07:24:44,766 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions. [2023-08-04 07:24:44,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions. [2023-08-04 07:24:44,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:44,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions. [2023-08-04 07:24:44,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 07:24:44,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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 07:24:44,769 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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 07:24:44,769 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 3 states and 268 transitions. [2023-08-04 07:24:44,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 22 transitions, 90 flow [2023-08-04 07:24:44,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 90 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:24:44,770 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 54 flow [2023-08-04 07:24:44,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, 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 07:24:44,771 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 3 predicate places. [2023-08-04 07:24:44,771 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 54 flow [2023-08-04 07:24:44,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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 07:24:44,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:44,772 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 07:24:44,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 07:24:44,772 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 07:24:44,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:44,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1875851406, now seen corresponding path program 1 times [2023-08-04 07:24:44,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:44,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700004955] [2023-08-04 07:24:44,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:44,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:24:44,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:24:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:24:44,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:24:44,821 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:24:44,822 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 07:24:44,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 07:24:44,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 07:24:44,822 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 07:24:44,823 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 07:24:44,823 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 07:24:44,823 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 07:24:44,847 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:24:44,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 117 transitions, 258 flow [2023-08-04 07:24:44,906 INFO L124 PetriNetUnfolderBase]: 30/449 cut-off events. [2023-08-04 07:24:44,906 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 07:24:44,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 449 events. 30/449 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1896 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 324. Up to 18 conditions per place. [2023-08-04 07:24:44,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 117 transitions, 258 flow [2023-08-04 07:24:44,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 116 transitions, 252 flow [2023-08-04 07:24:44,909 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:24:44,909 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 116 transitions, 252 flow [2023-08-04 07:24:44,909 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 116 transitions, 252 flow [2023-08-04 07:24:44,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 116 transitions, 252 flow [2023-08-04 07:24:44,944 INFO L124 PetriNetUnfolderBase]: 30/448 cut-off events. [2023-08-04 07:24:44,944 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 07:24:44,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 448 events. 30/448 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1891 event pairs, 0 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 321. Up to 18 conditions per place. [2023-08-04 07:24:44,951 INFO L119 LiptonReduction]: Number of co-enabled transitions 3344 [2023-08-04 07:24:47,721 INFO L134 LiptonReduction]: Checked pairs total: 9207 [2023-08-04 07:24:47,721 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-04 07:24:47,723 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:24:47,724 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;@59c6efed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:24:47,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 07:24:47,726 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:24:47,727 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-08-04 07:24:47,727 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:47,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:47,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 07:24:47,727 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 07:24:47,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:47,728 INFO L85 PathProgramCache]: Analyzing trace with hash 709409893, now seen corresponding path program 1 times [2023-08-04 07:24:47,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:47,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719125214] [2023-08-04 07:24:47,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:47,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:47,785 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 07:24:47,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:47,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719125214] [2023-08-04 07:24:47,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719125214] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:24:47,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:24:47,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:24:47,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124973719] [2023-08-04 07:24:47,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:24:47,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:24:47,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:47,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:24:47,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:24:47,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 209 [2023-08-04 07:24:47,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:47,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:47,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 209 [2023-08-04 07:24:47,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:50,017 INFO L124 PetriNetUnfolderBase]: 15012/21856 cut-off events. [2023-08-04 07:24:50,018 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2023-08-04 07:24:50,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43010 conditions, 21856 events. 15012/21856 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 139352 event pairs, 10800 based on Foata normal form. 620/18543 useless extension candidates. Maximal degree in co-relation 9495. Up to 20629 conditions per place. [2023-08-04 07:24:50,168 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 33 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-04 07:24:50,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 174 flow [2023-08-04 07:24:50,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:24:50,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:24:50,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-08-04 07:24:50,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2023-08-04 07:24:50,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-08-04 07:24:50,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-08-04 07:24:50,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:50,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-08-04 07:24:50,172 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 07:24:50,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 07:24:50,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 07:24:50,173 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 96 flow. Second operand 3 states and 319 transitions. [2023-08-04 07:24:50,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 174 flow [2023-08-04 07:24:50,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 42 transitions, 172 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 07:24:50,178 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 104 flow [2023-08-04 07:24:50,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-04 07:24:50,182 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2023-08-04 07:24:50,183 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 104 flow [2023-08-04 07:24:50,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:50,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:50,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:24:50,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 07:24:50,184 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 07:24:50,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:50,185 INFO L85 PathProgramCache]: Analyzing trace with hash -335057389, now seen corresponding path program 1 times [2023-08-04 07:24:50,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:50,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778732525] [2023-08-04 07:24:50,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:50,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:50,257 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 07:24:50,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:50,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778732525] [2023-08-04 07:24:50,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778732525] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:24:50,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080731578] [2023-08-04 07:24:50,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:50,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:24:50,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:24:50,261 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 07:24:50,285 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 07:24:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:50,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:24:50,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:24:50,357 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 07:24:50,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:24:50,370 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 07:24:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080731578] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:24:50,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:24:50,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:24:50,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302659926] [2023-08-04 07:24:50,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:24:50,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:24:50,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:50,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:24:50,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:24:50,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 209 [2023-08-04 07:24:50,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 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 07:24:50,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:50,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 209 [2023-08-04 07:24:50,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:52,214 INFO L124 PetriNetUnfolderBase]: 12690/18190 cut-off events. [2023-08-04 07:24:52,214 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2023-08-04 07:24:52,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35789 conditions, 18190 events. 12690/18190 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 110884 event pairs, 5964 based on Foata normal form. 4/15057 useless extension candidates. Maximal degree in co-relation 9501. Up to 17113 conditions per place. [2023-08-04 07:24:52,321 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 38 selfloop transitions, 3 changer transitions 1/49 dead transitions. [2023-08-04 07:24:52,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 210 flow [2023-08-04 07:24:52,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:24:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:24:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2023-08-04 07:24:52,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4964114832535885 [2023-08-04 07:24:52,323 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 415 transitions. [2023-08-04 07:24:52,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 415 transitions. [2023-08-04 07:24:52,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:52,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 415 transitions. [2023-08-04 07:24:52,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 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 07:24:52,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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 07:24:52,327 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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 07:24:52,327 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 104 flow. Second operand 4 states and 415 transitions. [2023-08-04 07:24:52,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 210 flow [2023-08-04 07:24:52,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:24:52,330 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 116 flow [2023-08-04 07:24:52,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-08-04 07:24:52,333 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-08-04 07:24:52,336 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 116 flow [2023-08-04 07:24:52,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 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 07:24:52,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:52,337 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:24:52,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-04 07:24:52,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-04 07:24:52,542 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 07:24:52,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:52,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1686121470, now seen corresponding path program 1 times [2023-08-04 07:24:52,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:52,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336182216] [2023-08-04 07:24:52,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:52,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 07:24:52,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:52,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336182216] [2023-08-04 07:24:52,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336182216] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:24:52,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:24:52,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 07:24:52,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319934801] [2023-08-04 07:24:52,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:24:52,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:24:52,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:52,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:24:52,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:24:52,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 209 [2023-08-04 07:24:52,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 07:24:52,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:52,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 209 [2023-08-04 07:24:52,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:54,140 INFO L124 PetriNetUnfolderBase]: 10842/15639 cut-off events. [2023-08-04 07:24:54,141 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2023-08-04 07:24:54,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30758 conditions, 15639 events. 10842/15639 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 94476 event pairs, 2442 based on Foata normal form. 0/13350 useless extension candidates. Maximal degree in co-relation 14357. Up to 13633 conditions per place. [2023-08-04 07:24:54,203 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 45 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-08-04 07:24:54,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 55 transitions, 251 flow [2023-08-04 07:24:54,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:24:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:24:54,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-08-04 07:24:54,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5422647527910686 [2023-08-04 07:24:54,205 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-08-04 07:24:54,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-08-04 07:24:54,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:54,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-08-04 07:24:54,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:54,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 07:24:54,209 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 07:24:54,209 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 116 flow. Second operand 3 states and 340 transitions. [2023-08-04 07:24:54,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 55 transitions, 251 flow [2023-08-04 07:24:54,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 244 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 07:24:54,213 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 130 flow [2023-08-04 07:24:54,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2023-08-04 07:24:54,215 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-08-04 07:24:54,215 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 130 flow [2023-08-04 07:24:54,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 07:24:54,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:54,215 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:24:54,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 07:24:54,216 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 07:24:54,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:54,216 INFO L85 PathProgramCache]: Analyzing trace with hash -729778764, now seen corresponding path program 1 times [2023-08-04 07:24:54,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:54,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868464351] [2023-08-04 07:24:54,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:54,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 07:24:54,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:54,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868464351] [2023-08-04 07:24:54,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868464351] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:24:54,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:24:54,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 07:24:54,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52194310] [2023-08-04 07:24:54,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:24:54,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:24:54,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:54,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:24:54,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:24:54,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 209 [2023-08-04 07:24:54,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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 07:24:54,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:54,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 209 [2023-08-04 07:24:54,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:55,449 INFO L124 PetriNetUnfolderBase]: 10698/15127 cut-off events. [2023-08-04 07:24:55,450 INFO L125 PetriNetUnfolderBase]: For 1289/1289 co-relation queries the response was YES. [2023-08-04 07:24:55,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32614 conditions, 15127 events. 10698/15127 cut-off events. For 1289/1289 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 89639 event pairs, 8154 based on Foata normal form. 0/12886 useless extension candidates. Maximal degree in co-relation 15309. Up to 14281 conditions per place. [2023-08-04 07:24:55,533 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 42 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-08-04 07:24:55,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 243 flow [2023-08-04 07:24:55,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:24:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:24:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-08-04 07:24:55,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518341307814992 [2023-08-04 07:24:55,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-08-04 07:24:55,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-08-04 07:24:55,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:55,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-08-04 07:24:55,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 07:24:55,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 07:24:55,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 07:24:55,538 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 130 flow. Second operand 3 states and 325 transitions. [2023-08-04 07:24:55,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 243 flow [2023-08-04 07:24:55,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 51 transitions, 239 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:24:55,540 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 141 flow [2023-08-04 07:24:55,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-08-04 07:24:55,542 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2023-08-04 07:24:55,542 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 141 flow [2023-08-04 07:24:55,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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 07:24:55,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:55,542 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:24:55,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 07:24:55,543 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 07:24:55,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:55,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1538770137, now seen corresponding path program 1 times [2023-08-04 07:24:55,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:55,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44406164] [2023-08-04 07:24:55,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:55,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:24:55,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:24:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:24:55,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:24:55,600 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:24:55,601 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 07:24:55,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 07:24:55,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 07:24:55,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 07:24:55,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 07:24:55,604 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 07:24:55,605 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 07:24:55,606 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 07:24:55,606 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 07:24:55,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 07:24:55 BasicIcfg [2023-08-04 07:24:55,674 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 07:24:55,679 INFO L158 Benchmark]: Toolchain (without parser) took 18393.35ms. Allocated memory was 350.2MB in the beginning and 1.3GB in the end (delta: 983.6MB). Free memory was 299.9MB in the beginning and 425.7MB in the end (delta: -125.8MB). Peak memory consumption was 859.7MB. Max. memory is 16.0GB. [2023-08-04 07:24:55,679 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 350.2MB. Free memory is still 299.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 07:24:55,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.92ms. Allocated memory is still 350.2MB. Free memory was 299.9MB in the beginning and 277.2MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 07:24:55,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.43ms. Allocated memory is still 350.2MB. Free memory was 277.2MB in the beginning and 274.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 07:24:55,682 INFO L158 Benchmark]: Boogie Preprocessor took 45.38ms. Allocated memory is still 350.2MB. Free memory was 274.5MB in the beginning and 272.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 07:24:55,683 INFO L158 Benchmark]: RCFGBuilder took 553.16ms. Allocated memory was 350.2MB in the beginning and 474.0MB in the end (delta: 123.7MB). Free memory was 272.6MB in the beginning and 428.2MB in the end (delta: -155.6MB). Peak memory consumption was 27.7MB. Max. memory is 16.0GB. [2023-08-04 07:24:55,683 INFO L158 Benchmark]: TraceAbstraction took 17288.00ms. Allocated memory was 474.0MB in the beginning and 1.3GB in the end (delta: 859.8MB). Free memory was 428.2MB in the beginning and 425.7MB in the end (delta: 2.5MB). Peak memory consumption was 861.3MB. Max. memory is 16.0GB. [2023-08-04 07:24:55,685 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 350.2MB. Free memory is still 299.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 455.92ms. Allocated memory is still 350.2MB. Free memory was 299.9MB in the beginning and 277.2MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.43ms. Allocated memory is still 350.2MB. Free memory was 277.2MB in the beginning and 274.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.38ms. Allocated memory is still 350.2MB. Free memory was 274.5MB in the beginning and 272.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 553.16ms. Allocated memory was 350.2MB in the beginning and 474.0MB in the end (delta: 123.7MB). Free memory was 272.6MB in the beginning and 428.2MB in the end (delta: -155.6MB). Peak memory consumption was 27.7MB. Max. memory is 16.0GB. * TraceAbstraction took 17288.00ms. Allocated memory was 474.0MB in the beginning and 1.3GB in the end (delta: 859.8MB). Free memory was 428.2MB in the beginning and 425.7MB in the end (delta: 2.5MB). Peak memory consumption was 861.3MB. 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: 2.8s, 100 PlacesBefore, 29 PlacesAfterwards, 99 TransitionsBefore, 25 TransitionsAfterwards, 1418 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 3 ChoiceCompositions, 89 TotalNumberOfCompositions, 3471 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1575, independent: 1452, independent conditional: 0, independent unconditional: 1452, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 767, independent: 745, independent conditional: 0, independent unconditional: 745, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1575, independent: 707, independent conditional: 0, independent unconditional: 707, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 767, unknown conditional: 0, unknown unconditional: 767] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, 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.1s, 77 PlacesBefore, 23 PlacesAfterwards, 73 TransitionsBefore, 18 TransitionsAfterwards, 622 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 60 TotalNumberOfCompositions, 1595 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 804, independent: 708, independent conditional: 0, independent unconditional: 708, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 319, independent: 310, independent conditional: 0, independent unconditional: 310, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 804, independent: 398, independent conditional: 0, independent unconditional: 398, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 319, unknown conditional: 0, unknown unconditional: 319] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 34, Positive conditional cache size: 0, Positive unconditional cache size: 34, 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, 121 PlacesBefore, 46 PlacesAfterwards, 116 TransitionsBefore, 38 TransitionsAfterwards, 3344 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 9207 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3691, independent: 3489, independent conditional: 0, independent unconditional: 3489, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1686, independent: 1644, independent conditional: 0, independent unconditional: 1644, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3691, independent: 1845, independent conditional: 0, independent unconditional: 1845, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 1686, unknown conditional: 0, unknown unconditional: 1686] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 135, Positive conditional cache size: 0, Positive unconditional cache size: 135, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475[2]; [L791] 0 int asdf=0; VAL [__unbuffered_cnt=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L791] COND TRUE 0 asdf<2 [L791] FCALL, FORK 0 pthread_create(&t2475[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475[asdf], ((void *)0), P0, ((void *)0))=-1, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L791] 0 asdf++ VAL [__unbuffered_cnt=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L791] COND TRUE 0 asdf<2 [L791] FCALL, FORK 0 pthread_create(&t2475[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475[asdf], ((void *)0), P0, ((void *)0))=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L791] 0 asdf++ VAL [__unbuffered_cnt=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L791] COND FALSE 0 !(asdf<2) [L792] 0 pthread_t t2476[2]; [L793] 0 int asdf=0; VAL [__unbuffered_cnt=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L793] COND TRUE 0 asdf<2 [L793] FCALL, FORK 0 pthread_create(&t2476[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476[asdf], ((void *)0), P1, ((void *)0))=1, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 3 x$w_buff1 = x$w_buff0 [L755] 3 x$w_buff0 = 2 [L756] 3 x$w_buff1_used = x$w_buff0_used [L757] 3 x$w_buff0_used = (_Bool)1 [L758] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L758] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L793] 0 asdf++ VAL [__unbuffered_cnt=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L793] COND TRUE 0 asdf<2 [L793] FCALL, FORK 0 pthread_create(&t2476[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476[asdf], ((void *)0), P1, ((void *)0))=2, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 4 x$w_buff1 = x$w_buff0 [L755] 4 x$w_buff0 = 2 [L756] 4 x$w_buff1_used = x$w_buff0_used [L757] 4 x$w_buff0_used = (_Bool)1 [L758] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND TRUE 4 !expression [L18] 4 reach_error() VAL [\old(expression)=1, __unbuffered_cnt=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=2, x$w_buff1_used=1, x=0, y=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 114 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.1s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 2 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=1, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 51 SizeOfPredicates, 0 NumberOfNonLiveVariables, 143 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.8s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 329 IncrementalHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 3 mSDtfsCounter, 329 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=4, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 144 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 12/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 114 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.3s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 34 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 07:24:55,716 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...