./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fd6a5bc5d3f013f4ace97b77d830608c8280eaa5bc8f461c3acae231027617e4 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:38:49,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:38:49,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:38:49,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:38:49,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:38:49,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:38:49,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:38:49,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:38:49,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:38:49,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:38:49,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:38:49,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:38:49,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:38:49,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:38:49,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:38:49,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:38:49,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:38:49,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:38:49,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:38:49,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:38:49,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:38:49,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:38:49,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:38:49,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:38:49,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:38:49,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:38:49,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:38:49,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:38:49,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:38:49,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:38:49,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:38:49,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:38:49,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:38:49,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:38:49,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:38:49,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:38:49,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:38:49,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:38:49,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:38:49,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:38:49,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:38:49,915 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:38:49,936 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:38:49,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:38:49,937 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:38:49,938 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:38:49,938 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:38:49,939 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:38:49,939 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:38:49,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:38:49,940 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:38:49,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:38:49,940 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:38:49,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:38:49,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:38:49,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:38:49,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:38:49,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:38:49,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:38:49,942 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:38:49,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:38:49,942 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:38:49,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:38:49,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:38:49,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:38:49,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:38:49,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:38:49,943 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:38:49,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:38:49,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:38:49,944 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:38:49,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:38:49,944 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:38:49,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:38:49,945 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:38:49,945 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:38:49,945 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:38:49,945 INFO L138 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd6a5bc5d3f013f4ace97b77d830608c8280eaa5bc8f461c3acae231027617e4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:38:50,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:38:50,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:38:50,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:38:50,246 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:38:50,246 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:38:50,247 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2023-08-30 16:38:51,285 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:38:51,529 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:38:51,530 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2023-08-30 16:38:51,545 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ced5e091/0bf9b75456434d469ce81572dd3a4258/FLAGcea40b8d4 [2023-08-30 16:38:51,560 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ced5e091/0bf9b75456434d469ce81572dd3a4258 [2023-08-30 16:38:51,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:38:51,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:38:51,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:38:51,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:38:51,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:38:51,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:38:51" (1/1) ... [2023-08-30 16:38:51,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8f3399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:38:51, skipping insertion in model container [2023-08-30 16:38:51,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:38:51" (1/1) ... [2023-08-30 16:38:51,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:38:51,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:38:51,800 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i[987,1000] [2023-08-30 16:38:51,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:38:52,001 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:38:52,014 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i[987,1000] [2023-08-30 16:38:52,100 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:38:52,123 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:38:52,124 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:38:52,129 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:38:52,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:38:52 WrapperNode [2023-08-30 16:38:52,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:38:52,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:38:52,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:38:52,131 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:38:52,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:38:52" (1/1) ... [2023-08-30 16:38:52,149 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:38:52" (1/1) ... [2023-08-30 16:38:52,181 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2023-08-30 16:38:52,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:38:52,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:38:52,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:38:52,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:38:52,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:38:52" (1/1) ... [2023-08-30 16:38:52,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:38:52" (1/1) ... [2023-08-30 16:38:52,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:38:52" (1/1) ... [2023-08-30 16:38:52,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:38:52" (1/1) ... [2023-08-30 16:38:52,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:38:52" (1/1) ... [2023-08-30 16:38:52,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:38:52" (1/1) ... [2023-08-30 16:38:52,220 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:38:52" (1/1) ... [2023-08-30 16:38:52,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:38:52" (1/1) ... [2023-08-30 16:38:52,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:38:52,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:38:52,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:38:52,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:38:52,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:38:52" (1/1) ... [2023-08-30 16:38:52,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:38:52,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:38:52,266 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-30 16:38:52,295 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-30 16:38:52,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:38:52,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:38:52,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:38:52,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:38:52,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:38:52,311 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:38:52,311 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:38:52,312 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:38:52,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:38:52,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:38:52,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:38:52,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:38:52,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:38:52,313 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:38:52,459 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:38:52,470 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:38:52,803 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:38:52,939 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:38:52,940 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:38:52,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:38:52 BoogieIcfgContainer [2023-08-30 16:38:52,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:38:52,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:38:52,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:38:52,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:38:52,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:38:51" (1/3) ... [2023-08-30 16:38:52,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1a10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:38:52, skipping insertion in model container [2023-08-30 16:38:52,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:38:52" (2/3) ... [2023-08-30 16:38:52,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1a10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:38:52, skipping insertion in model container [2023-08-30 16:38:52,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:38:52" (3/3) ... [2023-08-30 16:38:52,949 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.opt.i [2023-08-30 16:38:52,955 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:38:52,963 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:38:52,964 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:38:52,964 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:38:53,020 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:38:53,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2023-08-30 16:38:53,108 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2023-08-30 16:38:53,109 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:38:53,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-08-30 16:38:53,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2023-08-30 16:38:53,118 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2023-08-30 16:38:53,121 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:38:53,133 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2023-08-30 16:38:53,136 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2023-08-30 16:38:53,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2023-08-30 16:38:53,168 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2023-08-30 16:38:53,168 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:38:53,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-08-30 16:38:53,170 INFO L119 LiptonReduction]: Number of co-enabled transitions 1088 [2023-08-30 16:38:56,293 INFO L134 LiptonReduction]: Checked pairs total: 2899 [2023-08-30 16:38:56,293 INFO L136 LiptonReduction]: Total number of compositions: 85 [2023-08-30 16:38:56,305 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:38:56,311 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;@75e4edb9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:38:56,311 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 16:38:56,315 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-08-30 16:38:56,315 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:38:56,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:38:56,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 16:38:56,316 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:38:56,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:38:56,320 INFO L85 PathProgramCache]: Analyzing trace with hash 421097674, now seen corresponding path program 1 times [2023-08-30 16:38:56,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:38:56,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134194050] [2023-08-30 16:38:56,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:38:56,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:38:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:38:56,696 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-30 16:38:56,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:38:56,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134194050] [2023-08-30 16:38:56,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134194050] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:38:56,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:38:56,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:38:56,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252675587] [2023-08-30 16:38:56,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:38:56,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:38:56,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:38:56,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:38:56,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:38:56,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 176 [2023-08-30 16:38:56,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-30 16:38:56,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:38:56,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 176 [2023-08-30 16:38:56,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:38:56,841 INFO L130 PetriNetUnfolder]: 142/273 cut-off events. [2023-08-30 16:38:56,841 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 16:38:56,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 273 events. 142/273 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1102 event pairs, 18 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 528. Up to 205 conditions per place. [2023-08-30 16:38:56,845 INFO L137 encePairwiseOnDemand]: 172/176 looper letters, 18 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2023-08-30 16:38:56,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 98 flow [2023-08-30 16:38:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:38:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:38:56,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2023-08-30 16:38:56,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962121212121212 [2023-08-30 16:38:56,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2023-08-30 16:38:56,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2023-08-30 16:38:56,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:38:56,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2023-08-30 16:38:56,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-30 16:38:56,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:38:56,869 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:38:56,870 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 44 flow. Second operand 3 states and 262 transitions. [2023-08-30 16:38:56,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 98 flow [2023-08-30 16:38:56,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:38:56,873 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2023-08-30 16:38:56,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-08-30 16:38:56,877 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-08-30 16:38:56,877 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2023-08-30 16:38:56,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-30 16:38:56,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:38:56,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:38:56,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:38:56,879 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:38:56,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:38:56,879 INFO L85 PathProgramCache]: Analyzing trace with hash 947983461, now seen corresponding path program 1 times [2023-08-30 16:38:56,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:38:56,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485166891] [2023-08-30 16:38:56,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:38:56,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:38:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:38:57,104 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-30 16:38:57,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:38:57,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485166891] [2023-08-30 16:38:57,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485166891] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:38:57,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:38:57,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:38:57,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051423290] [2023-08-30 16:38:57,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:38:57,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:38:57,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:38:57,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:38:57,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:38:57,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 176 [2023-08-30 16:38:57,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-30 16:38:57,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:38:57,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 176 [2023-08-30 16:38:57,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:38:57,201 INFO L130 PetriNetUnfolder]: 167/294 cut-off events. [2023-08-30 16:38:57,201 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 16:38:57,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 294 events. 167/294 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 971 event pairs, 65 based on Foata normal form. 4/298 useless extension candidates. Maximal degree in co-relation 612. Up to 267 conditions per place. [2023-08-30 16:38:57,203 INFO L137 encePairwiseOnDemand]: 172/176 looper letters, 21 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-08-30 16:38:57,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 108 flow [2023-08-30 16:38:57,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:38:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:38:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2023-08-30 16:38:57,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4678030303030303 [2023-08-30 16:38:57,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 247 transitions. [2023-08-30 16:38:57,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 247 transitions. [2023-08-30 16:38:57,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:38:57,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 247 transitions. [2023-08-30 16:38:57,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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-30 16:38:57,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:38:57,209 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:38:57,209 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 247 transitions. [2023-08-30 16:38:57,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 108 flow [2023-08-30 16:38:57,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:38:57,211 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 55 flow [2023-08-30 16:38:57,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-08-30 16:38:57,212 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-08-30 16:38:57,212 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2023-08-30 16:38:57,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-30 16:38:57,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:38:57,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:38:57,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:38:57,213 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:38:57,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:38:57,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1297324500, now seen corresponding path program 1 times [2023-08-30 16:38:57,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:38:57,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982031398] [2023-08-30 16:38:57,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:38:57,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:38:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:38:57,369 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-30 16:38:57,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:38:57,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982031398] [2023-08-30 16:38:57,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982031398] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:38:57,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:38:57,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:38:57,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669366757] [2023-08-30 16:38:57,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:38:57,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:38:57,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:38:57,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:38:57,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:38:57,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 176 [2023-08-30 16:38:57,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 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-30 16:38:57,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:38:57,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 176 [2023-08-30 16:38:57,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:38:57,455 INFO L130 PetriNetUnfolder]: 157/278 cut-off events. [2023-08-30 16:38:57,455 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2023-08-30 16:38:57,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 278 events. 157/278 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 880 event pairs, 53 based on Foata normal form. 6/284 useless extension candidates. Maximal degree in co-relation 635. Up to 200 conditions per place. [2023-08-30 16:38:57,458 INFO L137 encePairwiseOnDemand]: 173/176 looper letters, 20 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2023-08-30 16:38:57,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 111 flow [2023-08-30 16:38:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:38:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:38:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2023-08-30 16:38:57,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4640151515151515 [2023-08-30 16:38:57,462 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 245 transitions. [2023-08-30 16:38:57,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 245 transitions. [2023-08-30 16:38:57,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:38:57,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 245 transitions. [2023-08-30 16:38:57,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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-30 16:38:57,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:38:57,467 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:38:57,467 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 3 states and 245 transitions. [2023-08-30 16:38:57,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 111 flow [2023-08-30 16:38:57,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:38:57,468 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 63 flow [2023-08-30 16:38:57,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-08-30 16:38:57,470 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2023-08-30 16:38:57,472 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 63 flow [2023-08-30 16:38:57,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 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-30 16:38:57,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:38:57,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:38:57,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:38:57,474 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:38:57,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:38:57,474 INFO L85 PathProgramCache]: Analyzing trace with hash 448608949, now seen corresponding path program 1 times [2023-08-30 16:38:57,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:38:57,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461498166] [2023-08-30 16:38:57,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:38:57,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:38:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:38:57,687 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-30 16:38:57,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:38:57,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461498166] [2023-08-30 16:38:57,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461498166] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:38:57,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:38:57,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:38:57,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506532959] [2023-08-30 16:38:57,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:38:57,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:38:57,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:38:57,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:38:57,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:38:57,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 176 [2023-08-30 16:38:57,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 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-30 16:38:57,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:38:57,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 176 [2023-08-30 16:38:57,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:38:57,779 INFO L130 PetriNetUnfolder]: 143/256 cut-off events. [2023-08-30 16:38:57,779 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2023-08-30 16:38:57,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 256 events. 143/256 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 797 event pairs, 80 based on Foata normal form. 8/264 useless extension candidates. Maximal degree in co-relation 607. Up to 177 conditions per place. [2023-08-30 16:38:57,782 INFO L137 encePairwiseOnDemand]: 173/176 looper letters, 23 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2023-08-30 16:38:57,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 26 transitions, 133 flow [2023-08-30 16:38:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:38:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:38:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2023-08-30 16:38:57,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2023-08-30 16:38:57,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 248 transitions. [2023-08-30 16:38:57,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 248 transitions. [2023-08-30 16:38:57,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:38:57,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 248 transitions. [2023-08-30 16:38:57,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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-30 16:38:57,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:38:57,790 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:38:57,790 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 63 flow. Second operand 3 states and 248 transitions. [2023-08-30 16:38:57,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 26 transitions, 133 flow [2023-08-30 16:38:57,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 26 transitions, 127 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:38:57,793 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 68 flow [2023-08-30 16:38:57,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-30 16:38:57,794 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2023-08-30 16:38:57,794 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 68 flow [2023-08-30 16:38:57,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 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-30 16:38:57,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:38:57,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:38:57,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:38:57,795 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:38:57,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:38:57,796 INFO L85 PathProgramCache]: Analyzing trace with hash 247100980, now seen corresponding path program 1 times [2023-08-30 16:38:57,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:38:57,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311444600] [2023-08-30 16:38:57,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:38:57,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:38:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:38:58,130 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-30 16:38:58,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:38:58,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311444600] [2023-08-30 16:38:58,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311444600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:38:58,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:38:58,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:38:58,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285242015] [2023-08-30 16:38:58,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:38:58,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:38:58,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:38:58,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:38:58,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:38:58,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 176 [2023-08-30 16:38:58,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 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-30 16:38:58,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:38:58,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 176 [2023-08-30 16:38:58,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:38:58,228 INFO L130 PetriNetUnfolder]: 63/151 cut-off events. [2023-08-30 16:38:58,229 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2023-08-30 16:38:58,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 151 events. 63/151 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 543 event pairs, 29 based on Foata normal form. 23/173 useless extension candidates. Maximal degree in co-relation 345. Up to 64 conditions per place. [2023-08-30 16:38:58,230 INFO L137 encePairwiseOnDemand]: 171/176 looper letters, 28 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2023-08-30 16:38:58,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 35 transitions, 174 flow [2023-08-30 16:38:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:38:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:38:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 333 transitions. [2023-08-30 16:38:58,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47301136363636365 [2023-08-30 16:38:58,232 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 333 transitions. [2023-08-30 16:38:58,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 333 transitions. [2023-08-30 16:38:58,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:38:58,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 333 transitions. [2023-08-30 16:38:58,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 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-30 16:38:58,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:38:58,235 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:38:58,236 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 68 flow. Second operand 4 states and 333 transitions. [2023-08-30 16:38:58,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 35 transitions, 174 flow [2023-08-30 16:38:58,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 35 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:38:58,237 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 92 flow [2023-08-30 16:38:58,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-08-30 16:38:58,238 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2023-08-30 16:38:58,238 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 92 flow [2023-08-30 16:38:58,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 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-30 16:38:58,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:38:58,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:38:58,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:38:58,239 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:38:58,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:38:58,240 INFO L85 PathProgramCache]: Analyzing trace with hash 817851324, now seen corresponding path program 1 times [2023-08-30 16:38:58,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:38:58,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451922528] [2023-08-30 16:38:58,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:38:58,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:38:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:38:58,564 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-30 16:38:58,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:38:58,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451922528] [2023-08-30 16:38:58,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451922528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:38:58,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:38:58,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:38:58,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204758454] [2023-08-30 16:38:58,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:38:58,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:38:58,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:38:58,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:38:58,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:38:58,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 176 [2023-08-30 16:38:58,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 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-30 16:38:58,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:38:58,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 176 [2023-08-30 16:38:58,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:38:58,645 INFO L130 PetriNetUnfolder]: 51/128 cut-off events. [2023-08-30 16:38:58,645 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2023-08-30 16:38:58,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 128 events. 51/128 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 448 event pairs, 29 based on Foata normal form. 9/136 useless extension candidates. Maximal degree in co-relation 357. Up to 64 conditions per place. [2023-08-30 16:38:58,646 INFO L137 encePairwiseOnDemand]: 171/176 looper letters, 20 selfloop transitions, 6 changer transitions 0/29 dead transitions. [2023-08-30 16:38:58,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 168 flow [2023-08-30 16:38:58,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:38:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:38:58,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2023-08-30 16:38:58,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45681818181818185 [2023-08-30 16:38:58,648 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 402 transitions. [2023-08-30 16:38:58,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 402 transitions. [2023-08-30 16:38:58,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:38:58,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 402 transitions. [2023-08-30 16:38:58,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 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-30 16:38:58,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 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-30 16:38:58,651 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 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-30 16:38:58,652 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 92 flow. Second operand 5 states and 402 transitions. [2023-08-30 16:38:58,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 168 flow [2023-08-30 16:38:58,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 152 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 16:38:58,653 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 107 flow [2023-08-30 16:38:58,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-30 16:38:58,654 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2023-08-30 16:38:58,654 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 107 flow [2023-08-30 16:38:58,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 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-30 16:38:58,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:38:58,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:38:58,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:38:58,655 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:38:58,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:38:58,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1380798545, now seen corresponding path program 1 times [2023-08-30 16:38:58,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:38:58,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838372813] [2023-08-30 16:38:58,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:38:58,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:38:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:38:58,878 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-30 16:38:58,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:38:58,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838372813] [2023-08-30 16:38:58,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838372813] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:38:58,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:38:58,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:38:58,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915778181] [2023-08-30 16:38:58,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:38:58,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:38:58,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:38:58,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:38:58,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:38:58,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 176 [2023-08-30 16:38:58,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:38:58,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:38:58,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 176 [2023-08-30 16:38:58,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:38:58,975 INFO L130 PetriNetUnfolder]: 75/190 cut-off events. [2023-08-30 16:38:58,975 INFO L131 PetriNetUnfolder]: For 294/294 co-relation queries the response was YES. [2023-08-30 16:38:58,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 190 events. 75/190 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 762 event pairs, 10 based on Foata normal form. 1/191 useless extension candidates. Maximal degree in co-relation 577. Up to 102 conditions per place. [2023-08-30 16:38:58,976 INFO L137 encePairwiseOnDemand]: 173/176 looper letters, 18 selfloop transitions, 1 changer transitions 21/41 dead transitions. [2023-08-30 16:38:58,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 285 flow [2023-08-30 16:38:58,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:38:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:38:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 334 transitions. [2023-08-30 16:38:58,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744318181818182 [2023-08-30 16:38:58,978 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 334 transitions. [2023-08-30 16:38:58,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 334 transitions. [2023-08-30 16:38:58,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:38:58,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 334 transitions. [2023-08-30 16:38:58,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 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-30 16:38:58,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:38:58,980 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:38:58,981 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 107 flow. Second operand 4 states and 334 transitions. [2023-08-30 16:38:58,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 285 flow [2023-08-30 16:38:58,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 268 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 16:38:58,983 INFO L231 Difference]: Finished difference. Result has 36 places, 18 transitions, 87 flow [2023-08-30 16:38:58,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=36, PETRI_TRANSITIONS=18} [2023-08-30 16:38:58,984 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2023-08-30 16:38:58,984 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 18 transitions, 87 flow [2023-08-30 16:38:58,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:38:58,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:38:58,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:38:58,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:38:58,985 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:38:58,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:38:58,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2093331019, now seen corresponding path program 2 times [2023-08-30 16:38:58,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:38:58,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507221744] [2023-08-30 16:38:58,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:38:58,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:38:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:39:00,262 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-30 16:39:00,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:39:00,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507221744] [2023-08-30 16:39:00,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507221744] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:39:00,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:39:00,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:39:00,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057092896] [2023-08-30 16:39:00,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:39:00,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:39:00,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:39:00,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:39:00,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:39:00,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 176 [2023-08-30 16:39:00,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 18 transitions, 87 flow. Second operand has 7 states, 7 states have (on average 73.0) internal successors, (511), 7 states have internal predecessors, (511), 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-30 16:39:00,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:39:00,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 176 [2023-08-30 16:39:00,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:39:00,456 INFO L130 PetriNetUnfolder]: 10/46 cut-off events. [2023-08-30 16:39:00,456 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2023-08-30 16:39:00,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 46 events. 10/46 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 2 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 152. Up to 13 conditions per place. [2023-08-30 16:39:00,457 INFO L137 encePairwiseOnDemand]: 169/176 looper letters, 12 selfloop transitions, 5 changer transitions 10/29 dead transitions. [2023-08-30 16:39:00,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 29 transitions, 210 flow [2023-08-30 16:39:00,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:39:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:39:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 592 transitions. [2023-08-30 16:39:00,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2023-08-30 16:39:00,459 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 592 transitions. [2023-08-30 16:39:00,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 592 transitions. [2023-08-30 16:39:00,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:39:00,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 592 transitions. [2023-08-30 16:39:00,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 74.0) internal successors, (592), 8 states have internal predecessors, (592), 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-30 16:39:00,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 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-30 16:39:00,463 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 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-30 16:39:00,463 INFO L175 Difference]: Start difference. First operand has 36 places, 18 transitions, 87 flow. Second operand 8 states and 592 transitions. [2023-08-30 16:39:00,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 29 transitions, 210 flow [2023-08-30 16:39:00,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 148 flow, removed 9 selfloop flow, removed 9 redundant places. [2023-08-30 16:39:00,465 INFO L231 Difference]: Finished difference. Result has 35 places, 18 transitions, 72 flow [2023-08-30 16:39:00,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=72, PETRI_PLACES=35, PETRI_TRANSITIONS=18} [2023-08-30 16:39:00,466 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2023-08-30 16:39:00,466 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 18 transitions, 72 flow [2023-08-30 16:39:00,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.0) internal successors, (511), 7 states have internal predecessors, (511), 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-30 16:39:00,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:39:00,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:39:00,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:39:00,467 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:39:00,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:39:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash 466078297, now seen corresponding path program 3 times [2023-08-30 16:39:00,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:39:00,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552082708] [2023-08-30 16:39:00,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:39:00,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:39:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:39:00,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:39:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:39:00,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:39:00,565 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:39:00,565 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-30 16:39:00,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-30 16:39:00,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-30 16:39:00,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-30 16:39:00,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-30 16:39:00,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:39:00,568 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-08-30 16:39:00,572 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:39:00,572 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:39:00,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:39:00 BasicIcfg [2023-08-30 16:39:00,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:39:00,627 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:39:00,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:39:00,628 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:39:00,628 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:38:52" (3/4) ... [2023-08-30 16:39:00,629 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:39:00,676 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:39:00,677 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:39:00,677 INFO L158 Benchmark]: Toolchain (without parser) took 9109.73ms. Allocated memory was 73.4MB in the beginning and 205.5MB in the end (delta: 132.1MB). Free memory was 50.1MB in the beginning and 73.1MB in the end (delta: -23.0MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. [2023-08-30 16:39:00,677 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 60.8MB. Free memory is still 38.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:39:00,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.33ms. Allocated memory is still 73.4MB. Free memory was 49.9MB in the beginning and 45.2MB in the end (delta: 4.7MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2023-08-30 16:39:00,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.87ms. Allocated memory is still 73.4MB. Free memory was 45.2MB in the beginning and 42.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 16:39:00,678 INFO L158 Benchmark]: Boogie Preprocessor took 42.57ms. Allocated memory is still 73.4MB. Free memory was 42.6MB in the beginning and 40.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:39:00,679 INFO L158 Benchmark]: RCFGBuilder took 716.61ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 40.5MB in the beginning and 62.2MB in the end (delta: -21.7MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2023-08-30 16:39:00,679 INFO L158 Benchmark]: TraceAbstraction took 7683.11ms. Allocated memory was 88.1MB in the beginning and 205.5MB in the end (delta: 117.4MB). Free memory was 61.6MB in the beginning and 80.5MB in the end (delta: -18.8MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. [2023-08-30 16:39:00,679 INFO L158 Benchmark]: Witness Printer took 49.34ms. Allocated memory is still 205.5MB. Free memory was 80.5MB in the beginning and 73.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-08-30 16:39:00,681 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 60.8MB. Free memory is still 38.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.33ms. Allocated memory is still 73.4MB. Free memory was 49.9MB in the beginning and 45.2MB in the end (delta: 4.7MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.87ms. Allocated memory is still 73.4MB. Free memory was 45.2MB in the beginning and 42.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.57ms. Allocated memory is still 73.4MB. Free memory was 42.6MB in the beginning and 40.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 716.61ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 40.5MB in the beginning and 62.2MB in the end (delta: -21.7MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7683.11ms. Allocated memory was 88.1MB in the beginning and 205.5MB in the end (delta: 117.4MB). Free memory was 61.6MB in the beginning and 80.5MB in the end (delta: -18.8MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. * Witness Printer took 49.34ms. Allocated memory is still 205.5MB. Free memory was 80.5MB in the beginning and 73.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 94 PlacesBefore, 25 PlacesAfterwards, 89 TransitionsBefore, 19 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, 2899 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1287, independent: 1162, independent conditional: 0, independent unconditional: 1162, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 641, independent: 611, independent conditional: 0, independent unconditional: 611, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1287, independent: 551, independent conditional: 0, independent unconditional: 551, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 641, unknown conditional: 0, unknown unconditional: 641] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t0; [L827] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0, ((void *)0), P0, ((void *)0))=-2, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L828] 0 pthread_t t1; [L829] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1, ((void *)0), P1, ((void *)0))=-1, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 x$flush_delayed = weak$$choice2 [L788] 2 x$mem_tmp = x [L789] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L790] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L791] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L792] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L793] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L795] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = x [L797] 2 x = x$flush_delayed ? x$mem_tmp : x [L798] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L801] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L746] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L805] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L806] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L807] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L808] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] - 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. - UnprovableResult [Line: 829]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 110 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 192 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 431 IncrementalHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 19 mSDtfsCounter, 431 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=6, InterpolantAutomatonStates: 33, 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.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 737 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 16:39:00,699 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE