/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_safe031_power.oepc_pso.oepc_rmo.oepc_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 07:25:34,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 07:25:34,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 07:25:34,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 07:25:34,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 07:25:34,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 07:25:34,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 07:25:34,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 07:25:34,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 07:25:34,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 07:25:34,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 07:25:34,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 07:25:34,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 07:25:34,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 07:25:34,856 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 07:25:34,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 07:25:34,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 07:25:34,857 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 07:25:34,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 07:25:34,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 07:25:34,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 07:25:34,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 07:25:34,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 07:25:34,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 07:25:34,858 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 07:25:34,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 07:25:34,859 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 07:25:34,859 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 07:25:34,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 07:25:34,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 07:25:34,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:25:34,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 07:25:34,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 07:25:34,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 07:25:34,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 07:25:34,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 07:25:34,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 07:25:34,861 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 07:25:34,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 07:25:34,862 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 07:25:34,862 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 07:25:34,862 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:25:35,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 07:25:35,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 07:25:35,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 07:25:35,138 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 07:25:35,139 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 07:25:35,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe031_power.oepc_pso.oepc_rmo.oepc_bound2.i [2023-08-04 07:25:36,262 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 07:25:36,510 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 07:25:36,510 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe031_power.oepc_pso.oepc_rmo.oepc_bound2.i [2023-08-04 07:25:36,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40140b7e4/ae94fbf73ccc441a8704dd8bca4d8509/FLAG4e3a980fa [2023-08-04 07:25:36,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40140b7e4/ae94fbf73ccc441a8704dd8bca4d8509 [2023-08-04 07:25:36,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 07:25:36,560 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 07:25:36,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 07:25:36,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 07:25:36,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 07:25:36,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:25:36" (1/1) ... [2023-08-04 07:25:36,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f1dba64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:25:36, skipping insertion in model container [2023-08-04 07:25:36,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:25:36" (1/1) ... [2023-08-04 07:25:36,625 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 07:25:36,742 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_safe031_power.oepc_pso.oepc_rmo.oepc_bound2.i[1013,1026] [2023-08-04 07:25:36,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:25:36,968 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 07:25:36,981 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_safe031_power.oepc_pso.oepc_rmo.oepc_bound2.i[1013,1026] [2023-08-04 07:25:36,993 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 07:25:36,995 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 07:25:37,019 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:25:37,048 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:25:37,048 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:25:37,054 INFO L206 MainTranslator]: Completed translation [2023-08-04 07:25:37,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:25:37 WrapperNode [2023-08-04 07:25:37,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 07:25:37,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 07:25:37,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 07:25:37,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 07:25:37,061 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:25:37" (1/1) ... [2023-08-04 07:25:37,081 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:25:37" (1/1) ... [2023-08-04 07:25:37,103 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2023-08-04 07:25:37,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 07:25:37,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 07:25:37,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 07:25:37,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 07:25:37,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:25:37" (1/1) ... [2023-08-04 07:25:37,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:25:37" (1/1) ... [2023-08-04 07:25:37,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:25:37" (1/1) ... [2023-08-04 07:25:37,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:25:37" (1/1) ... [2023-08-04 07:25:37,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:25:37" (1/1) ... [2023-08-04 07:25:37,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:25:37" (1/1) ... [2023-08-04 07:25:37,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:25:37" (1/1) ... [2023-08-04 07:25:37,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:25:37" (1/1) ... [2023-08-04 07:25:37,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 07:25:37,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 07:25:37,153 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 07:25:37,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 07:25:37,154 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:25:37" (1/1) ... [2023-08-04 07:25:37,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:25:37,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:25:37,190 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:25:37,212 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:25:37,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 07:25:37,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 07:25:37,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 07:25:37,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 07:25:37,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 07:25:37,228 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 07:25:37,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 07:25:37,229 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 07:25:37,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 07:25:37,229 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 07:25:37,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 07:25:37,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 07:25:37,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 07:25:37,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 07:25:37,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 07:25:37,231 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:25:37,401 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 07:25:37,404 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 07:25:37,722 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 07:25:37,876 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 07:25:37,876 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 07:25:37,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:25:37 BoogieIcfgContainer [2023-08-04 07:25:37,878 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 07:25:37,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 07:25:37,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 07:25:37,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 07:25:37,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 07:25:36" (1/3) ... [2023-08-04 07:25:37,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14686dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:25:37, skipping insertion in model container [2023-08-04 07:25:37,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:25:37" (2/3) ... [2023-08-04 07:25:37,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14686dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:25:37, skipping insertion in model container [2023-08-04 07:25:37,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:25:37" (3/3) ... [2023-08-04 07:25:37,886 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe031_power.oepc_pso.oepc_rmo.oepc_bound2.i [2023-08-04 07:25:37,892 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 07:25:37,898 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 07:25:37,898 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 07:25:37,898 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 07:25:37,939 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:25:37,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 127 transitions, 269 flow [2023-08-04 07:25:38,075 INFO L124 PetriNetUnfolderBase]: 30/447 cut-off events. [2023-08-04 07:25:38,075 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:25:38,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 447 events. 30/447 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1962 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 268. Up to 16 conditions per place. [2023-08-04 07:25:38,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 127 transitions, 269 flow [2023-08-04 07:25:38,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 126 transitions, 265 flow [2023-08-04 07:25:38,092 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:25:38,100 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 126 transitions, 265 flow [2023-08-04 07:25:38,102 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 126 transitions, 265 flow [2023-08-04 07:25:38,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 126 transitions, 265 flow [2023-08-04 07:25:38,192 INFO L124 PetriNetUnfolderBase]: 30/446 cut-off events. [2023-08-04 07:25:38,192 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:25:38,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 446 events. 30/446 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1955 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 266. Up to 16 conditions per place. [2023-08-04 07:25:38,201 INFO L119 LiptonReduction]: Number of co-enabled transitions 2518 [2023-08-04 07:25:41,438 INFO L134 LiptonReduction]: Checked pairs total: 6006 [2023-08-04 07:25:41,438 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-04 07:25:41,449 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:25:41,454 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;@79048998, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:25:41,455 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 07:25:41,459 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:25:41,459 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-04 07:25:41,459 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:25:41,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:25:41,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 07:25:41,460 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:25:41,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:25:41,465 INFO L85 PathProgramCache]: Analyzing trace with hash 522088880, now seen corresponding path program 1 times [2023-08-04 07:25:41,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:25:41,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513877530] [2023-08-04 07:25:41,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:41,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:25:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:41,699 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:25:41,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:25:41,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513877530] [2023-08-04 07:25:41,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513877530] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:25:41,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:25:41,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:25:41,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707320220] [2023-08-04 07:25:41,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:25:41,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:25:41,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:25:41,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:25:41,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:25:41,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-08-04 07:25:41,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:25:41,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:25:41,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-08-04 07:25:41,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:25:42,160 INFO L124 PetriNetUnfolderBase]: 1677/2771 cut-off events. [2023-08-04 07:25:42,161 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-04 07:25:42,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5433 conditions, 2771 events. 1677/2771 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14862 event pairs, 1008 based on Foata normal form. 0/2339 useless extension candidates. Maximal degree in co-relation 5420. Up to 2570 conditions per place. [2023-08-04 07:25:42,182 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 27 selfloop transitions, 2 changer transitions 1/34 dead transitions. [2023-08-04 07:25:42,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 141 flow [2023-08-04 07:25:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:25:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:25:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-08-04 07:25:42,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5007032348804501 [2023-08-04 07:25:42,198 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-08-04 07:25:42,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-08-04 07:25:42,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:25:42,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-08-04 07:25:42,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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:25:42,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 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:25:42,209 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 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:25:42,211 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 75 flow. Second operand 3 states and 356 transitions. [2023-08-04 07:25:42,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 141 flow [2023-08-04 07:25:42,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 141 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:25:42,215 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 81 flow [2023-08-04 07:25:42,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-04 07:25:42,219 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2023-08-04 07:25:42,220 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 81 flow [2023-08-04 07:25:42,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:25:42,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:25:42,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:25:42,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 07:25:42,221 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:25:42,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:25:42,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1734452009, now seen corresponding path program 1 times [2023-08-04 07:25:42,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:25:42,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501839489] [2023-08-04 07:25:42,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:42,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:25:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:42,299 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:25:42,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:25:42,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501839489] [2023-08-04 07:25:42,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501839489] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:25:42,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793938557] [2023-08-04 07:25:42,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:42,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:25:42,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:25:42,313 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:25:42,320 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:25:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:42,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:25:42,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:25:42,472 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:25:42,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:25:42,494 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:25:42,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793938557] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:25:42,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:25:42,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:25:42,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780583511] [2023-08-04 07:25:42,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:25:42,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:25:42,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:25:42,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:25:42,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:25:42,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 237 [2023-08-04 07:25:42,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 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:25:42,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:25:42,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 237 [2023-08-04 07:25:42,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:25:42,537 INFO L124 PetriNetUnfolderBase]: 6/20 cut-off events. [2023-08-04 07:25:42,538 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 07:25:42,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 20 events. 6/20 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 4/24 useless extension candidates. Maximal degree in co-relation 51. Up to 14 conditions per place. [2023-08-04 07:25:42,541 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 0 selfloop transitions, 0 changer transitions 11/11 dead transitions. [2023-08-04 07:25:42,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 11 transitions, 53 flow [2023-08-04 07:25:42,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:25:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:25:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2023-08-04 07:25:42,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4641350210970464 [2023-08-04 07:25:42,551 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2023-08-04 07:25:42,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2023-08-04 07:25:42,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:25:42,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2023-08-04 07:25:42,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:42,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 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:25:42,557 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 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:25:42,557 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 81 flow. Second operand 4 states and 440 transitions. [2023-08-04 07:25:42,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 11 transitions, 53 flow [2023-08-04 07:25:42,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 11 transitions, 47 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 07:25:42,558 INFO L231 Difference]: Finished difference. Result has 15 places, 0 transitions, 0 flow [2023-08-04 07:25:42,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=15, PETRI_TRANSITIONS=0} [2023-08-04 07:25:42,560 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -22 predicate places. [2023-08-04 07:25:42,560 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 0 transitions, 0 flow [2023-08-04 07:25:42,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 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:25:42,563 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 07:25:42,563 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 07:25:42,564 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 07:25:42,575 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:25:42,769 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:25:42,769 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 07:25:42,771 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 07:25:42,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 127 transitions, 269 flow [2023-08-04 07:25:42,811 INFO L124 PetriNetUnfolderBase]: 30/447 cut-off events. [2023-08-04 07:25:42,811 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:25:42,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 447 events. 30/447 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1962 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 268. Up to 16 conditions per place. [2023-08-04 07:25:42,812 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 127 transitions, 269 flow [2023-08-04 07:25:42,813 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 98 transitions, 211 flow [2023-08-04 07:25:42,813 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:25:42,814 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 98 transitions, 211 flow [2023-08-04 07:25:42,814 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 98 transitions, 211 flow [2023-08-04 07:25:42,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 211 flow [2023-08-04 07:25:42,829 INFO L124 PetriNetUnfolderBase]: 6/215 cut-off events. [2023-08-04 07:25:42,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:25:42,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 215 events. 6/215 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 629 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 152. Up to 8 conditions per place. [2023-08-04 07:25:42,832 INFO L119 LiptonReduction]: Number of co-enabled transitions 1312 [2023-08-04 07:25:45,468 INFO L134 LiptonReduction]: Checked pairs total: 3172 [2023-08-04 07:25:45,469 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-08-04 07:25:45,470 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 07:25:45,471 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;@79048998, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:25:45,471 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 07:25:45,474 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:25:45,474 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-04 07:25:45,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:25:45,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:25:45,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 07:25:45,475 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 07:25:45,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:25:45,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1352894266, now seen corresponding path program 1 times [2023-08-04 07:25:45,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:25:45,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340882998] [2023-08-04 07:25:45,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:45,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:25:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:45,531 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:25:45,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:25:45,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340882998] [2023-08-04 07:25:45,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340882998] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:25:45,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:25:45,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:25:45,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561361918] [2023-08-04 07:25:45,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:25:45,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:25:45,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:25:45,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:25:45,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:25:45,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 205 [2023-08-04 07:25:45,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:25:45,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:25:45,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 205 [2023-08-04 07:25:45,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:25:45,647 INFO L124 PetriNetUnfolderBase]: 467/853 cut-off events. [2023-08-04 07:25:45,647 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-04 07:25:45,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1709 conditions, 853 events. 467/853 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4031 event pairs, 248 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1688. Up to 760 conditions per place. [2023-08-04 07:25:45,652 INFO L140 encePairwiseOnDemand]: 202/205 looper letters, 23 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-04 07:25:45,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 125 flow [2023-08-04 07:25:45,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:25:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:25:45,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-08-04 07:25:45,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5691056910569106 [2023-08-04 07:25:45,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-08-04 07:25:45,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-08-04 07:25:45,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:25:45,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-08-04 07:25:45,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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:25:45,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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:25:45,657 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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:25:45,657 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 67 flow. Second operand 3 states and 350 transitions. [2023-08-04 07:25:45,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 125 flow [2023-08-04 07:25:45,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 125 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:25:45,659 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 75 flow [2023-08-04 07:25:45,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-04 07:25:45,659 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-08-04 07:25:45,660 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 75 flow [2023-08-04 07:25:45,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:25:45,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:25:45,660 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 07:25:45,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 07:25:45,660 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 07:25:45,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:25:45,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1345740150, now seen corresponding path program 1 times [2023-08-04 07:25:45,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:25:45,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768732974] [2023-08-04 07:25:45,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:45,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:25:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:25:45,676 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:25:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:25:45,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:25:45,698 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:25:45,698 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 07:25:45,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 07:25:45,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 07:25:45,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 07:25:45,699 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 07:25:45,700 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 07:25:45,700 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 07:25:45,700 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 07:25:45,725 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:25:45,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 151 transitions, 338 flow [2023-08-04 07:25:45,845 INFO L124 PetriNetUnfolderBase]: 93/1378 cut-off events. [2023-08-04 07:25:45,845 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 07:25:45,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1378 events. 93/1378 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9465 event pairs, 0 based on Foata normal form. 0/1213 useless extension candidates. Maximal degree in co-relation 1001. Up to 54 conditions per place. [2023-08-04 07:25:45,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 151 transitions, 338 flow [2023-08-04 07:25:45,857 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 150 transitions, 332 flow [2023-08-04 07:25:45,857 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:25:45,857 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 150 transitions, 332 flow [2023-08-04 07:25:45,857 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 150 transitions, 332 flow [2023-08-04 07:25:45,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 150 transitions, 332 flow [2023-08-04 07:25:45,972 INFO L124 PetriNetUnfolderBase]: 93/1377 cut-off events. [2023-08-04 07:25:45,973 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-04 07:25:45,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 1377 events. 93/1377 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9454 event pairs, 0 based on Foata normal form. 0/1212 useless extension candidates. Maximal degree in co-relation 998. Up to 54 conditions per place. [2023-08-04 07:25:46,004 INFO L119 LiptonReduction]: Number of co-enabled transitions 6040 [2023-08-04 07:25:49,251 INFO L134 LiptonReduction]: Checked pairs total: 15717 [2023-08-04 07:25:49,251 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-08-04 07:25:49,253 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:25:49,254 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;@79048998, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:25:49,254 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 07:25:49,257 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:25:49,257 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-04 07:25:49,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:25:49,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:25:49,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 07:25:49,257 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:25:49,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:25:49,258 INFO L85 PathProgramCache]: Analyzing trace with hash 875267939, now seen corresponding path program 1 times [2023-08-04 07:25:49,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:25:49,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762312532] [2023-08-04 07:25:49,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:49,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:25:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:49,294 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:25:49,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:25:49,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762312532] [2023-08-04 07:25:49,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762312532] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:25:49,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:25:49,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:25:49,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936250467] [2023-08-04 07:25:49,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:25:49,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:25:49,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:25:49,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:25:49,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:25:49,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 268 [2023-08-04 07:25:49,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:49,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:25:49,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 268 [2023-08-04 07:25:49,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:26:30,946 INFO L124 PetriNetUnfolderBase]: 363272/479295 cut-off events. [2023-08-04 07:26:30,947 INFO L125 PetriNetUnfolderBase]: For 8796/8796 co-relation queries the response was YES. [2023-08-04 07:26:31,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945511 conditions, 479295 events. 363272/479295 cut-off events. For 8796/8796 co-relation queries the response was YES. Maximal size of possible extension queue 11911. Compared 3343188 event pairs, 293960 based on Foata normal form. 0/416422 useless extension candidates. Maximal degree in co-relation 203871. Up to 455689 conditions per place. [2023-08-04 07:26:33,586 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 42 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-08-04 07:26:33,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 226 flow [2023-08-04 07:26:33,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:26:33,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:26:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-04 07:26:33,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5199004975124378 [2023-08-04 07:26:33,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-04 07:26:33,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-04 07:26:33,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:26:33,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-04 07:26:33,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:33,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 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:26:33,592 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 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:26:33,592 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 130 flow. Second operand 3 states and 418 transitions. [2023-08-04 07:26:33,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 226 flow [2023-08-04 07:26:33,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 53 transitions, 222 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 07:26:33,603 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 136 flow [2023-08-04 07:26:33,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2023-08-04 07:26:33,604 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 3 predicate places. [2023-08-04 07:26:33,604 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 136 flow [2023-08-04 07:26:33,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:33,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:26:33,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:26:33,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 07:26:33,605 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:26:33,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:26:33,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1484908758, now seen corresponding path program 1 times [2023-08-04 07:26:33,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:26:33,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283656956] [2023-08-04 07:26:33,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:26:33,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:26:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:26:33,679 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:26:33,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:26:33,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283656956] [2023-08-04 07:26:33,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283656956] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:26:33,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244992164] [2023-08-04 07:26:33,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:26:33,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:26:33,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:26:33,681 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:26:33,688 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:26:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:26:33,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:26:33,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:26:33,788 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:26:33,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:26:33,804 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:26:33,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244992164] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:26:33,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:26:33,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:26:33,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57700515] [2023-08-04 07:26:33,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:26:33,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:26:33,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:26:33,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:26:33,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:26:33,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 268 [2023-08-04 07:26:33,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 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:26:33,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:26:33,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 268 [2023-08-04 07:26:33,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:27:05,644 INFO L124 PetriNetUnfolderBase]: 301714/394725 cut-off events. [2023-08-04 07:27:05,645 INFO L125 PetriNetUnfolderBase]: For 6392/6392 co-relation queries the response was YES. [2023-08-04 07:27:06,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 778262 conditions, 394725 events. 301714/394725 cut-off events. For 6392/6392 co-relation queries the response was YES. Maximal size of possible extension queue 10238. Compared 2642311 event pairs, 190828 based on Foata normal form. 4/344472 useless extension candidates. Maximal degree in co-relation 203798. Up to 375577 conditions per place. [2023-08-04 07:27:08,162 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 47 selfloop transitions, 3 changer transitions 1/60 dead transitions. [2023-08-04 07:27:08,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 60 transitions, 260 flow [2023-08-04 07:27:08,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:27:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:27:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2023-08-04 07:27:08,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5074626865671642 [2023-08-04 07:27:08,164 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2023-08-04 07:27:08,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2023-08-04 07:27:08,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:27:08,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2023-08-04 07:27:08,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 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:27:08,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 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:27:08,169 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 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:27:08,169 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 136 flow. Second operand 4 states and 544 transitions. [2023-08-04 07:27:08,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 60 transitions, 260 flow [2023-08-04 07:27:08,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:27:08,171 INFO L231 Difference]: Finished difference. Result has 68 places, 49 transitions, 148 flow [2023-08-04 07:27:08,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=68, PETRI_TRANSITIONS=49} [2023-08-04 07:27:08,172 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2023-08-04 07:27:08,172 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 49 transitions, 148 flow [2023-08-04 07:27:08,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 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:27:08,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:27:08,173 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:27:08,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 07:27:08,378 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:27:08,379 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:27:08,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:27:08,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1087088306, now seen corresponding path program 1 times [2023-08-04 07:27:08,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:27:08,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122903623] [2023-08-04 07:27:08,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:27:08,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:27:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:27:08,548 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:27:08,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:27:08,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122903623] [2023-08-04 07:27:08,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122903623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:27:08,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:27:08,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 07:27:08,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970980288] [2023-08-04 07:27:08,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:27:08,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:27:08,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:27:08,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:27:08,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:27:08,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 268 [2023-08-04 07:27:08,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 49 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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:27:08,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:27:08,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 268 [2023-08-04 07:27:08,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:27:37,970 INFO L124 PetriNetUnfolderBase]: 259610/340285 cut-off events. [2023-08-04 07:27:37,970 INFO L125 PetriNetUnfolderBase]: For 5801/5801 co-relation queries the response was YES. [2023-08-04 07:27:38,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670846 conditions, 340285 events. 259610/340285 cut-off events. For 5801/5801 co-relation queries the response was YES. Maximal size of possible extension queue 8958. Compared 2292480 event pairs, 42938 based on Foata normal form. 0/304476 useless extension candidates. Maximal degree in co-relation 175737. Up to 297729 conditions per place. [2023-08-04 07:27:39,757 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 63 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2023-08-04 07:27:39,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 75 transitions, 345 flow [2023-08-04 07:27:39,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:27:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:27:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2023-08-04 07:27:39,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5572139303482587 [2023-08-04 07:27:39,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2023-08-04 07:27:39,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2023-08-04 07:27:39,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:27:39,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2023-08-04 07:27:39,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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:27:39,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 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:27:39,762 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 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:27:39,762 INFO L175 Difference]: Start difference. First operand has 68 places, 49 transitions, 148 flow. Second operand 3 states and 448 transitions. [2023-08-04 07:27:39,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 75 transitions, 345 flow [2023-08-04 07:27:39,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 75 transitions, 338 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 07:27:39,764 INFO L231 Difference]: Finished difference. Result has 68 places, 51 transitions, 162 flow [2023-08-04 07:27:39,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=68, PETRI_TRANSITIONS=51} [2023-08-04 07:27:39,765 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2023-08-04 07:27:39,765 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 51 transitions, 162 flow [2023-08-04 07:27:39,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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:27:39,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:27:39,765 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:27:39,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 07:27:39,766 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:27:39,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:27:39,766 INFO L85 PathProgramCache]: Analyzing trace with hash -659574652, now seen corresponding path program 1 times [2023-08-04 07:27:39,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:27:39,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221505637] [2023-08-04 07:27:39,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:27:39,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:27:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:27:39,813 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:27:39,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:27:39,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221505637] [2023-08-04 07:27:39,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221505637] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:27:39,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:27:39,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 07:27:39,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139471653] [2023-08-04 07:27:39,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:27:39,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:27:39,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:27:39,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:27:39,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:27:39,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 268 [2023-08-04 07:27:39,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 51 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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:27:39,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:27:39,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 268 [2023-08-04 07:27:39,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:28:07,942 INFO L124 PetriNetUnfolderBase]: 253322/332109 cut-off events. [2023-08-04 07:28:07,942 INFO L125 PetriNetUnfolderBase]: For 26374/26374 co-relation queries the response was YES. [2023-08-04 07:28:08,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697854 conditions, 332109 events. 253322/332109 cut-off events. For 26374/26374 co-relation queries the response was YES. Maximal size of possible extension queue 9154. Compared 2222889 event pairs, 212698 based on Foata normal form. 0/298268 useless extension candidates. Maximal degree in co-relation 182197. Up to 315145 conditions per place. [2023-08-04 07:28:09,819 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 51 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-08-04 07:28:09,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 293 flow [2023-08-04 07:28:09,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:28:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:28:09,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-08-04 07:28:09,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261194029850746 [2023-08-04 07:28:09,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-08-04 07:28:09,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-08-04 07:28:09,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:28:09,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-08-04 07:28:09,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:28:09,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 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:28:09,824 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 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:28:09,824 INFO L175 Difference]: Start difference. First operand has 68 places, 51 transitions, 162 flow. Second operand 3 states and 423 transitions. [2023-08-04 07:28:09,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 293 flow [2023-08-04 07:28:09,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:28:09,840 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 171 flow [2023-08-04 07:28:09,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2023-08-04 07:28:09,841 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 9 predicate places. [2023-08-04 07:28:09,841 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 171 flow [2023-08-04 07:28:09,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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:28:09,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:28:09,842 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:28:09,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 07:28:09,842 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:28:09,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:28:09,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1181500194, now seen corresponding path program 1 times [2023-08-04 07:28:09,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:28:09,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040695070] [2023-08-04 07:28:09,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:28:09,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:28:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:28:09,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:28:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:28:09,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:28:09,880 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:28:09,880 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 07:28:09,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 07:28:09,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 07:28:09,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 07:28:09,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 07:28:09,881 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 07:28:09,882 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 07:28:09,884 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 07:28:09,884 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 07:28:09,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 07:28:09 BasicIcfg [2023-08-04 07:28:09,929 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 07:28:09,929 INFO L158 Benchmark]: Toolchain (without parser) took 153369.64ms. Allocated memory was 606.1MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 552.0MB in the beginning and 11.2GB in the end (delta: -10.6GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. [2023-08-04 07:28:09,930 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 352.3MB. Free memory is still 301.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 07:28:09,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.56ms. Allocated memory is still 606.1MB. Free memory was 551.6MB in the beginning and 528.6MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 07:28:09,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.41ms. Allocated memory is still 606.1MB. Free memory was 528.6MB in the beginning and 526.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 07:28:09,930 INFO L158 Benchmark]: Boogie Preprocessor took 47.65ms. Allocated memory is still 606.1MB. Free memory was 526.2MB in the beginning and 524.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 07:28:09,931 INFO L158 Benchmark]: RCFGBuilder took 725.84ms. Allocated memory is still 606.1MB. Free memory was 524.1MB in the beginning and 563.1MB in the end (delta: -39.0MB). Peak memory consumption was 35.5MB. Max. memory is 16.0GB. [2023-08-04 07:28:09,931 INFO L158 Benchmark]: TraceAbstraction took 152048.69ms. Allocated memory was 606.1MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 562.0MB in the beginning and 11.2GB in the end (delta: -10.6GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. [2023-08-04 07:28:09,933 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 352.3MB. Free memory is still 301.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 493.56ms. Allocated memory is still 606.1MB. Free memory was 551.6MB in the beginning and 528.6MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 47.41ms. Allocated memory is still 606.1MB. Free memory was 528.6MB in the beginning and 526.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 47.65ms. Allocated memory is still 606.1MB. Free memory was 526.2MB in the beginning and 524.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 725.84ms. Allocated memory is still 606.1MB. Free memory was 524.1MB in the beginning and 563.1MB in the end (delta: -39.0MB). Peak memory consumption was 35.5MB. Max. memory is 16.0GB. * TraceAbstraction took 152048.69ms. Allocated memory was 606.1MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 562.0MB in the beginning and 11.2GB in the end (delta: -10.6GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 128 PlacesBefore, 37 PlacesAfterwards, 126 TransitionsBefore, 31 TransitionsAfterwards, 2518 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 110 TotalNumberOfCompositions, 6006 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2526, independent: 2374, independent conditional: 0, independent unconditional: 2374, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1312, independent: 1276, independent conditional: 0, independent unconditional: 1276, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2526, independent: 1098, independent conditional: 0, independent unconditional: 1098, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 1312, unknown conditional: 0, unknown unconditional: 1312] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 103 PlacesBefore, 33 PlacesAfterwards, 98 TransitionsBefore, 26 TransitionsAfterwards, 1312 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 3172 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1409, independent: 1293, independent conditional: 0, independent unconditional: 1293, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 644, independent: 629, independent conditional: 0, independent unconditional: 629, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1409, independent: 664, independent conditional: 0, independent unconditional: 664, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 644, unknown conditional: 0, unknown unconditional: 644] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 158 PlacesBefore, 61 PlacesAfterwards, 150 TransitionsBefore, 49 TransitionsAfterwards, 6040 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 117 TotalNumberOfCompositions, 15717 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6759, independent: 6505, independent conditional: 0, independent unconditional: 6505, dependent: 254, dependent conditional: 0, dependent unconditional: 254, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3053, independent: 2994, independent conditional: 0, independent unconditional: 2994, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6759, independent: 3511, independent conditional: 0, independent unconditional: 3511, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 3053, unknown conditional: 0, unknown unconditional: 3053] , Statistics on independence cache: Total cache size (in pairs): 288, Positive cache size: 260, Positive conditional cache size: 0, Positive unconditional cache size: 260, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff0_thd3; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$read_delayed; [L728] 0 int *x$read_delayed_var; [L729] 0 int x$w_buff0; [L730] 0 _Bool x$w_buff0_used; [L731] 0 int x$w_buff1; [L732] 0 _Bool x$w_buff1_used; [L734] 0 int y = 0; [L736] 0 int z = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L829] 0 pthread_t t2513[2]; [L830] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t2513={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L830] COND TRUE 0 asdf<2 [L830] FCALL, FORK 0 pthread_create(&t2513[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2513[asdf], ((void *)0), P0, ((void *)0))=-3, t2513={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L830] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t2513={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L830] COND TRUE 0 asdf<2 [L830] FCALL, FORK 0 pthread_create(&t2513[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2513[asdf], ((void *)0), P0, ((void *)0))=-2, t2513={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L830] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2513={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L830] COND FALSE 0 !(asdf<2) [L831] 0 pthread_t t2514[2]; [L832] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, t2514={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L832] COND TRUE 0 asdf<2 [L832] FCALL, FORK 0 pthread_create(&t2514[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2514[asdf], ((void *)0), P1, ((void *)0))=-1, t2513={5:0}, t2514={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L772] 3 x$w_buff1 = x$w_buff0 [L773] 3 x$w_buff0 = 1 [L774] 3 x$w_buff1_used = x$w_buff0_used [L775] 3 x$w_buff0_used = (_Bool)1 [L776] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L776] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, t2514={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] COND TRUE 0 asdf<2 [L832] FCALL, FORK 0 pthread_create(&t2514[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2514[asdf], ((void *)0), P1, ((void *)0))=0, t2513={5:0}, t2514={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 4 x$w_buff1 = x$w_buff0 [L773] 4 x$w_buff0 = 1 [L774] 4 x$w_buff1_used = x$w_buff0_used [L775] 4 x$w_buff0_used = (_Bool)1 [L776] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, expression=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x=0, y=0, z=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 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: 4.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 93 IncrementalHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 1 mSDtfsCounter, 93 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=81occurred in iteration=1, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 51 SizeOfPredicates, 0 NumberOfNonLiveVariables, 151 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 10 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 144.2s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 139.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 356 IncrementalHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 2 mSDtfsCounter, 356 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=171occurred in iteration=4, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 12/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 147 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.9s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 51 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=75occurred 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, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 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:28:09,956 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...