./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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 ../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 21:25:14,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:25:14,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:25:14,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:25:14,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:25:14,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:25:14,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:25:14,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:25:14,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:25:14,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:25:14,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:25:14,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:25:14,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:25:14,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:25:14,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:25:14,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:25:14,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:25:14,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:25:14,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:25:14,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:25:14,358 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:25:14,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:25:14,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:25:14,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:25:14,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:25:14,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:25:14,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:25:14,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:25:14,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:25:14,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:25:14,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:25:14,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:25:14,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:25:14,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:25:14,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:25:14,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:25:14,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:25:14,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:25:14,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:25:14,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:25:14,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:25:14,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:25:14,379 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 21:25:14,400 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:25:14,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:25:14,400 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:25:14,401 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:25:14,401 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:25:14,401 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:25:14,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:25:14,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:25:14,402 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:25:14,402 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:25:14,403 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:25:14,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:25:14,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:25:14,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:25:14,403 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:25:14,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:25:14,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:25:14,404 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:25:14,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:25:14,405 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:25:14,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:25:14,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:25:14,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:25:14,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:25:14,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:25:14,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:25:14,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:25:14,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:25:14,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:25:14,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:25:14,407 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:25:14,407 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:25:14,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:25:14,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae [2022-07-22 21:25:14,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:25:14,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:25:14,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:25:14,609 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:25:14,610 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:25:14,611 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-07-22 21:25:14,649 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd09dfc18/52584d14ed27452592c36ee36ddd4bb8/FLAG69e04456a [2022-07-22 21:25:15,029 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:25:15,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-07-22 21:25:15,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd09dfc18/52584d14ed27452592c36ee36ddd4bb8/FLAG69e04456a [2022-07-22 21:25:15,048 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd09dfc18/52584d14ed27452592c36ee36ddd4bb8 [2022-07-22 21:25:15,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:25:15,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:25:15,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:25:15,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:25:15,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:25:15,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:25:15" (1/1) ... [2022-07-22 21:25:15,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:15, skipping insertion in model container [2022-07-22 21:25:15,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:25:15" (1/1) ... [2022-07-22 21:25:15,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:25:15,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:25:15,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-07-22 21:25:15,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:25:15,387 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:25:15,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-07-22 21:25:15,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:25:15,455 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:25:15,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:15 WrapperNode [2022-07-22 21:25:15,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:25:15,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:25:15,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:25:15,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:25:15,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:15" (1/1) ... [2022-07-22 21:25:15,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:15" (1/1) ... [2022-07-22 21:25:15,510 INFO L137 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 168 [2022-07-22 21:25:15,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:25:15,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:25:15,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:25:15,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:25:15,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:15" (1/1) ... [2022-07-22 21:25:15,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:15" (1/1) ... [2022-07-22 21:25:15,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:15" (1/1) ... [2022-07-22 21:25:15,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:15" (1/1) ... [2022-07-22 21:25:15,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:15" (1/1) ... [2022-07-22 21:25:15,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:15" (1/1) ... [2022-07-22 21:25:15,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:15" (1/1) ... [2022-07-22 21:25:15,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:25:15,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:25:15,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:25:15,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:25:15,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:15" (1/1) ... [2022-07-22 21:25:15,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:25:15,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:25:15,589 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) [2022-07-22 21:25:15,610 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 [2022-07-22 21:25:15,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:25:15,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 21:25:15,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:25:15,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:25:15,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:25:15,649 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-22 21:25:15,649 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-22 21:25:15,649 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-22 21:25:15,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-22 21:25:15,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:25:15,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 21:25:15,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:25:15,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:25:15,651 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 21:25:15,746 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:25:15,747 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:25:16,089 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:25:16,353 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:25:16,354 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 21:25:16,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:25:16 BoogieIcfgContainer [2022-07-22 21:25:16,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:25:16,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:25:16,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:25:16,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:25:16,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:25:15" (1/3) ... [2022-07-22 21:25:16,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d4367e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:25:16, skipping insertion in model container [2022-07-22 21:25:16,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:15" (2/3) ... [2022-07-22 21:25:16,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d4367e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:25:16, skipping insertion in model container [2022-07-22 21:25:16,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:25:16" (3/3) ... [2022-07-22 21:25:16,362 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-07-22 21:25:16,367 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:25:16,373 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:25:16,374 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-22 21:25:16,374 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:25:16,419 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-22 21:25:16,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 204 flow [2022-07-22 21:25:16,482 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2022-07-22 21:25:16,482 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:25:16,485 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-07-22 21:25:16,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 97 transitions, 204 flow [2022-07-22 21:25:16,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 95 transitions, 196 flow [2022-07-22 21:25:16,495 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:25:16,499 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b97100c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6011ef7a [2022-07-22 21:25:16,499 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-22 21:25:16,507 INFO L129 PetriNetUnfolder]: 0/57 cut-off events. [2022-07-22 21:25:16,508 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:25:16,508 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:16,508 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:16,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-22 21:25:16,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:16,512 INFO L85 PathProgramCache]: Analyzing trace with hash -608487488, now seen corresponding path program 1 times [2022-07-22 21:25:16,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:16,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442061463] [2022-07-22 21:25:16,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:16,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:25:16,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:16,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442061463] [2022-07-22 21:25:16,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442061463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:16,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:16,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 21:25:16,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619887364] [2022-07-22 21:25:16,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:16,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:25:16,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:16,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:25:16,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:25:16,793 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 97 [2022-07-22 21:25:16,796 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 196 flow. Second operand has 3 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) [2022-07-22 21:25:16,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:16,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 97 [2022-07-22 21:25:16,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:16,878 INFO L129 PetriNetUnfolder]: 10/133 cut-off events. [2022-07-22 21:25:16,879 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 21:25:16,880 INFO L84 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 133 events. 10/133 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 233 event pairs, 2 based on Foata normal form. 6/132 useless extension candidates. Maximal degree in co-relation 119. Up to 17 conditions per place. [2022-07-22 21:25:16,881 INFO L132 encePairwiseOnDemand]: 92/97 looper letters, 7 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2022-07-22 21:25:16,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 93 transitions, 210 flow [2022-07-22 21:25:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:25:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:25:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2022-07-22 21:25:16,898 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9347079037800687 [2022-07-22 21:25:16,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2022-07-22 21:25:16,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2022-07-22 21:25:16,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:16,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2022-07-22 21:25:16,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:16,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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) [2022-07-22 21:25:16,913 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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) [2022-07-22 21:25:16,915 INFO L186 Difference]: Start difference. First operand has 100 places, 95 transitions, 196 flow. Second operand 3 states and 272 transitions. [2022-07-22 21:25:16,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 93 transitions, 210 flow [2022-07-22 21:25:16,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 93 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:25:16,921 INFO L242 Difference]: Finished difference. Result has 98 places, 91 transitions, 190 flow [2022-07-22 21:25:16,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=98, PETRI_TRANSITIONS=91} [2022-07-22 21:25:16,925 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2022-07-22 21:25:16,926 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 190 flow [2022-07-22 21:25:16,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2022-07-22 21:25:16,927 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:16,927 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:16,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:25:16,927 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)] === [2022-07-22 21:25:16,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1133223224, now seen corresponding path program 1 times [2022-07-22 21:25:16,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:16,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352035525] [2022-07-22 21:25:16,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:16,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:25:17,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:17,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352035525] [2022-07-22 21:25:17,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352035525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:17,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:17,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:25:17,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349263311] [2022-07-22 21:25:17,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:17,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:25:17,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:17,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:25:17,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:25:17,150 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 97 [2022-07-22 21:25:17,151 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 73.85714285714286) internal successors, (517), 7 states have internal predecessors, (517), 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) [2022-07-22 21:25:17,151 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:17,151 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 97 [2022-07-22 21:25:17,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:17,480 INFO L129 PetriNetUnfolder]: 273/974 cut-off events. [2022-07-22 21:25:17,480 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-07-22 21:25:17,482 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 974 events. 273/974 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 6250 event pairs, 28 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1463. Up to 108 conditions per place. [2022-07-22 21:25:17,484 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 25 selfloop transitions, 5 changer transitions 62/153 dead transitions. [2022-07-22 21:25:17,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 153 transitions, 486 flow [2022-07-22 21:25:17,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 21:25:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-22 21:25:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1022 transitions. [2022-07-22 21:25:17,487 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8104678826328311 [2022-07-22 21:25:17,487 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1022 transitions. [2022-07-22 21:25:17,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1022 transitions. [2022-07-22 21:25:17,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:17,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1022 transitions. [2022-07-22 21:25:17,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 78.61538461538461) internal successors, (1022), 13 states have internal predecessors, (1022), 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) [2022-07-22 21:25:17,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 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) [2022-07-22 21:25:17,492 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 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) [2022-07-22 21:25:17,493 INFO L186 Difference]: Start difference. First operand has 98 places, 91 transitions, 190 flow. Second operand 13 states and 1022 transitions. [2022-07-22 21:25:17,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 153 transitions, 486 flow [2022-07-22 21:25:17,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 153 transitions, 476 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:25:17,495 INFO L242 Difference]: Finished difference. Result has 120 places, 84 transitions, 238 flow [2022-07-22 21:25:17,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=238, PETRI_PLACES=120, PETRI_TRANSITIONS=84} [2022-07-22 21:25:17,496 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 20 predicate places. [2022-07-22 21:25:17,496 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 84 transitions, 238 flow [2022-07-22 21:25:17,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.85714285714286) internal successors, (517), 7 states have internal predecessors, (517), 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) [2022-07-22 21:25:17,497 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:17,497 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:17,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:25:17,498 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)] === [2022-07-22 21:25:17,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:17,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1165718378, now seen corresponding path program 1 times [2022-07-22 21:25:17,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:17,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532309502] [2022-07-22 21:25:17,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:17,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:25:17,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:17,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532309502] [2022-07-22 21:25:17,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532309502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:17,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:17,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:25:17,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717931604] [2022-07-22 21:25:17,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:17,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:25:17,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:17,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:25:17,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:25:17,603 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 97 [2022-07-22 21:25:17,604 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 84 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 74.42857142857143) internal successors, (521), 7 states have internal predecessors, (521), 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) [2022-07-22 21:25:17,604 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:17,604 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 97 [2022-07-22 21:25:17,604 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:17,839 INFO L129 PetriNetUnfolder]: 93/324 cut-off events. [2022-07-22 21:25:17,839 INFO L130 PetriNetUnfolder]: For 468/468 co-relation queries the response was YES. [2022-07-22 21:25:17,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 324 events. 93/324 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1323 event pairs, 23 based on Foata normal form. 8/308 useless extension candidates. Maximal degree in co-relation 827. Up to 62 conditions per place. [2022-07-22 21:25:17,841 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 21 selfloop transitions, 6 changer transitions 27/115 dead transitions. [2022-07-22 21:25:17,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 115 transitions, 512 flow [2022-07-22 21:25:17,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 21:25:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-22 21:25:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 990 transitions. [2022-07-22 21:25:17,844 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7850911974623315 [2022-07-22 21:25:17,844 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 990 transitions. [2022-07-22 21:25:17,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 990 transitions. [2022-07-22 21:25:17,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:17,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 990 transitions. [2022-07-22 21:25:17,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 76.15384615384616) internal successors, (990), 13 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:25:17,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 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) [2022-07-22 21:25:17,848 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 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) [2022-07-22 21:25:17,849 INFO L186 Difference]: Start difference. First operand has 120 places, 84 transitions, 238 flow. Second operand 13 states and 990 transitions. [2022-07-22 21:25:17,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 115 transitions, 512 flow [2022-07-22 21:25:17,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 115 transitions, 466 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-07-22 21:25:17,853 INFO L242 Difference]: Finished difference. Result has 119 places, 85 transitions, 265 flow [2022-07-22 21:25:17,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=265, PETRI_PLACES=119, PETRI_TRANSITIONS=85} [2022-07-22 21:25:17,854 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 19 predicate places. [2022-07-22 21:25:17,854 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 85 transitions, 265 flow [2022-07-22 21:25:17,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.42857142857143) internal successors, (521), 7 states have internal predecessors, (521), 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) [2022-07-22 21:25:17,855 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:17,855 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:17,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 21:25:17,855 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)] === [2022-07-22 21:25:17,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:17,856 INFO L85 PathProgramCache]: Analyzing trace with hash -191243276, now seen corresponding path program 1 times [2022-07-22 21:25:17,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:17,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334865810] [2022-07-22 21:25:17,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:25:17,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:17,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334865810] [2022-07-22 21:25:17,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334865810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:17,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:17,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:25:17,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534512436] [2022-07-22 21:25:17,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:17,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:25:17,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:17,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:25:17,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:25:17,991 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 97 [2022-07-22 21:25:17,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 85 transitions, 265 flow. Second operand has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 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) [2022-07-22 21:25:17,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:17,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 97 [2022-07-22 21:25:17,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:18,198 INFO L129 PetriNetUnfolder]: 232/663 cut-off events. [2022-07-22 21:25:18,198 INFO L130 PetriNetUnfolder]: For 886/942 co-relation queries the response was YES. [2022-07-22 21:25:18,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1593 conditions, 663 events. 232/663 cut-off events. For 886/942 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3790 event pairs, 14 based on Foata normal form. 20/658 useless extension candidates. Maximal degree in co-relation 1535. Up to 131 conditions per place. [2022-07-22 21:25:18,201 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 22 selfloop transitions, 5 changer transitions 42/137 dead transitions. [2022-07-22 21:25:18,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 137 transitions, 614 flow [2022-07-22 21:25:18,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:25:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:25:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 833 transitions. [2022-07-22 21:25:18,204 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8587628865979381 [2022-07-22 21:25:18,204 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 833 transitions. [2022-07-22 21:25:18,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 833 transitions. [2022-07-22 21:25:18,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:18,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 833 transitions. [2022-07-22 21:25:18,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 83.3) internal successors, (833), 10 states have internal predecessors, (833), 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) [2022-07-22 21:25:18,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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) [2022-07-22 21:25:18,211 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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) [2022-07-22 21:25:18,211 INFO L186 Difference]: Start difference. First operand has 119 places, 85 transitions, 265 flow. Second operand 10 states and 833 transitions. [2022-07-22 21:25:18,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 137 transitions, 614 flow [2022-07-22 21:25:18,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 137 transitions, 579 flow, removed 11 selfloop flow, removed 13 redundant places. [2022-07-22 21:25:18,216 INFO L242 Difference]: Finished difference. Result has 112 places, 87 transitions, 283 flow [2022-07-22 21:25:18,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=283, PETRI_PLACES=112, PETRI_TRANSITIONS=87} [2022-07-22 21:25:18,217 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 12 predicate places. [2022-07-22 21:25:18,218 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 87 transitions, 283 flow [2022-07-22 21:25:18,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 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) [2022-07-22 21:25:18,219 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:18,219 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:18,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:25:18,219 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)] === [2022-07-22 21:25:18,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:18,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1068390141, now seen corresponding path program 1 times [2022-07-22 21:25:18,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:18,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940010207] [2022-07-22 21:25:18,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:18,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:25:18,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:18,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940010207] [2022-07-22 21:25:18,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940010207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:18,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:18,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:25:18,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333357620] [2022-07-22 21:25:18,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:18,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:25:18,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:18,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:25:18,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:25:18,321 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 97 [2022-07-22 21:25:18,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 87 transitions, 283 flow. Second operand has 8 states, 8 states have (on average 74.375) internal successors, (595), 8 states have internal predecessors, (595), 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) [2022-07-22 21:25:18,322 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:18,322 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 97 [2022-07-22 21:25:18,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:18,527 INFO L129 PetriNetUnfolder]: 92/583 cut-off events. [2022-07-22 21:25:18,527 INFO L130 PetriNetUnfolder]: For 469/470 co-relation queries the response was YES. [2022-07-22 21:25:18,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 583 events. 92/583 cut-off events. For 469/470 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3869 event pairs, 28 based on Foata normal form. 3/559 useless extension candidates. Maximal degree in co-relation 1324. Up to 110 conditions per place. [2022-07-22 21:25:18,529 INFO L132 encePairwiseOnDemand]: 87/97 looper letters, 29 selfloop transitions, 5 changer transitions 17/114 dead transitions. [2022-07-22 21:25:18,530 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 114 transitions, 488 flow [2022-07-22 21:25:18,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:25:18,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:25:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 697 transitions. [2022-07-22 21:25:18,531 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7983963344788088 [2022-07-22 21:25:18,531 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 697 transitions. [2022-07-22 21:25:18,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 697 transitions. [2022-07-22 21:25:18,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:18,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 697 transitions. [2022-07-22 21:25:18,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 77.44444444444444) internal successors, (697), 9 states have internal predecessors, (697), 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) [2022-07-22 21:25:18,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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) [2022-07-22 21:25:18,534 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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) [2022-07-22 21:25:18,534 INFO L186 Difference]: Start difference. First operand has 112 places, 87 transitions, 283 flow. Second operand 9 states and 697 transitions. [2022-07-22 21:25:18,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 114 transitions, 488 flow [2022-07-22 21:25:18,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 114 transitions, 480 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-07-22 21:25:18,537 INFO L242 Difference]: Finished difference. Result has 118 places, 86 transitions, 298 flow [2022-07-22 21:25:18,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=298, PETRI_PLACES=118, PETRI_TRANSITIONS=86} [2022-07-22 21:25:18,538 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 18 predicate places. [2022-07-22 21:25:18,538 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 86 transitions, 298 flow [2022-07-22 21:25:18,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 74.375) internal successors, (595), 8 states have internal predecessors, (595), 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) [2022-07-22 21:25:18,538 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:18,538 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:18,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 21:25:18,539 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)] === [2022-07-22 21:25:18,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:18,539 INFO L85 PathProgramCache]: Analyzing trace with hash 892648061, now seen corresponding path program 2 times [2022-07-22 21:25:18,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:18,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687747328] [2022-07-22 21:25:18,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:18,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:25:18,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:18,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687747328] [2022-07-22 21:25:18,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687747328] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:18,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:18,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:25:18,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384292337] [2022-07-22 21:25:18,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:18,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:25:18,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:18,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:25:18,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:25:18,662 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 97 [2022-07-22 21:25:18,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 86 transitions, 298 flow. Second operand has 7 states, 7 states have (on average 74.71428571428571) internal successors, (523), 7 states have internal predecessors, (523), 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) [2022-07-22 21:25:18,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:18,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 97 [2022-07-22 21:25:18,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:18,773 INFO L129 PetriNetUnfolder]: 58/388 cut-off events. [2022-07-22 21:25:18,773 INFO L130 PetriNetUnfolder]: For 443/444 co-relation queries the response was YES. [2022-07-22 21:25:18,775 INFO L84 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 388 events. 58/388 cut-off events. For 443/444 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2086 event pairs, 18 based on Foata normal form. 4/374 useless extension candidates. Maximal degree in co-relation 921. Up to 68 conditions per place. [2022-07-22 21:25:18,776 INFO L132 encePairwiseOnDemand]: 90/97 looper letters, 19 selfloop transitions, 3 changer transitions 13/98 dead transitions. [2022-07-22 21:25:18,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 98 transitions, 416 flow [2022-07-22 21:25:18,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:25:18,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:25:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 539 transitions. [2022-07-22 21:25:18,778 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7938144329896907 [2022-07-22 21:25:18,778 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 539 transitions. [2022-07-22 21:25:18,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 539 transitions. [2022-07-22 21:25:18,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:18,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 539 transitions. [2022-07-22 21:25:18,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 77.0) internal successors, (539), 7 states have internal predecessors, (539), 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) [2022-07-22 21:25:18,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 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) [2022-07-22 21:25:18,780 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 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) [2022-07-22 21:25:18,781 INFO L186 Difference]: Start difference. First operand has 118 places, 86 transitions, 298 flow. Second operand 7 states and 539 transitions. [2022-07-22 21:25:18,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 98 transitions, 416 flow [2022-07-22 21:25:18,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 98 transitions, 375 flow, removed 10 selfloop flow, removed 11 redundant places. [2022-07-22 21:25:18,784 INFO L242 Difference]: Finished difference. Result has 112 places, 83 transitions, 262 flow [2022-07-22 21:25:18,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=112, PETRI_TRANSITIONS=83} [2022-07-22 21:25:18,786 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 12 predicate places. [2022-07-22 21:25:18,787 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 83 transitions, 262 flow [2022-07-22 21:25:18,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.71428571428571) internal successors, (523), 7 states have internal predecessors, (523), 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) [2022-07-22 21:25:18,788 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:18,788 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:18,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 21:25:18,788 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)] === [2022-07-22 21:25:18,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:18,789 INFO L85 PathProgramCache]: Analyzing trace with hash -594827523, now seen corresponding path program 3 times [2022-07-22 21:25:18,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:18,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254955087] [2022-07-22 21:25:18,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:18,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:18,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:25:18,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:18,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254955087] [2022-07-22 21:25:18,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254955087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:18,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:18,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:25:18,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448128517] [2022-07-22 21:25:18,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:18,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:25:18,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:18,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:25:18,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:25:18,903 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 97 [2022-07-22 21:25:18,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 83 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 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) [2022-07-22 21:25:18,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:18,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 97 [2022-07-22 21:25:18,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:19,019 INFO L129 PetriNetUnfolder]: 27/168 cut-off events. [2022-07-22 21:25:19,019 INFO L130 PetriNetUnfolder]: For 227/227 co-relation queries the response was YES. [2022-07-22 21:25:19,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 168 events. 27/168 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 452 event pairs, 6 based on Foata normal form. 5/171 useless extension candidates. Maximal degree in co-relation 412. Up to 27 conditions per place. [2022-07-22 21:25:19,020 INFO L132 encePairwiseOnDemand]: 89/97 looper letters, 12 selfloop transitions, 7 changer transitions 16/100 dead transitions. [2022-07-22 21:25:19,020 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 100 transitions, 434 flow [2022-07-22 21:25:19,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:25:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:25:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 807 transitions. [2022-07-22 21:25:19,023 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.831958762886598 [2022-07-22 21:25:19,023 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 807 transitions. [2022-07-22 21:25:19,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 807 transitions. [2022-07-22 21:25:19,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:19,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 807 transitions. [2022-07-22 21:25:19,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 80.7) internal successors, (807), 10 states have internal predecessors, (807), 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) [2022-07-22 21:25:19,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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) [2022-07-22 21:25:19,026 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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) [2022-07-22 21:25:19,026 INFO L186 Difference]: Start difference. First operand has 112 places, 83 transitions, 262 flow. Second operand 10 states and 807 transitions. [2022-07-22 21:25:19,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 100 transitions, 434 flow [2022-07-22 21:25:19,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 100 transitions, 341 flow, removed 38 selfloop flow, removed 15 redundant places. [2022-07-22 21:25:19,028 INFO L242 Difference]: Finished difference. Result has 109 places, 82 transitions, 236 flow [2022-07-22 21:25:19,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=236, PETRI_PLACES=109, PETRI_TRANSITIONS=82} [2022-07-22 21:25:19,028 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places. [2022-07-22 21:25:19,029 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 82 transitions, 236 flow [2022-07-22 21:25:19,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 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) [2022-07-22 21:25:19,029 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:19,029 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:19,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 21:25:19,029 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)] === [2022-07-22 21:25:19,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:19,030 INFO L85 PathProgramCache]: Analyzing trace with hash -693939682, now seen corresponding path program 1 times [2022-07-22 21:25:19,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:19,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480260905] [2022-07-22 21:25:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:19,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:25:19,055 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 21:25:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:25:19,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 21:25:19,101 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 21:25:19,102 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-07-22 21:25:19,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-22 21:25:19,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-07-22 21:25:19,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-07-22 21:25:19,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-22 21:25:19,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 21:25:19,104 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-07-22 21:25:19,108 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-22 21:25:19,108 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 21:25:19,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 09:25:19 BasicIcfg [2022-07-22 21:25:19,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 21:25:19,181 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 21:25:19,181 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 21:25:19,181 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 21:25:19,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:25:16" (3/4) ... [2022-07-22 21:25:19,182 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 21:25:19,272 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 21:25:19,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 21:25:19,273 INFO L158 Benchmark]: Toolchain (without parser) took 4221.73ms. Allocated memory was 109.1MB in the beginning and 182.5MB in the end (delta: 73.4MB). Free memory was 68.5MB in the beginning and 65.3MB in the end (delta: 3.2MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. [2022-07-22 21:25:19,273 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory was 86.3MB in the beginning and 86.2MB in the end (delta: 113.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 21:25:19,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.71ms. Allocated memory is still 109.1MB. Free memory was 68.3MB in the beginning and 71.1MB in the end (delta: -2.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 21:25:19,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.01ms. Allocated memory is still 109.1MB. Free memory was 71.1MB in the beginning and 68.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 21:25:19,274 INFO L158 Benchmark]: Boogie Preprocessor took 41.14ms. Allocated memory is still 109.1MB. Free memory was 68.6MB in the beginning and 66.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 21:25:19,274 INFO L158 Benchmark]: RCFGBuilder took 802.18ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 66.5MB in the beginning and 84.7MB in the end (delta: -18.3MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2022-07-22 21:25:19,274 INFO L158 Benchmark]: TraceAbstraction took 2823.18ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 83.8MB in the beginning and 85.2MB in the end (delta: -1.4MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2022-07-22 21:25:19,274 INFO L158 Benchmark]: Witness Printer took 91.29ms. Allocated memory is still 182.5MB. Free memory was 85.2MB in the beginning and 65.3MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-22 21:25:19,276 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.18ms. Allocated memory is still 109.1MB. Free memory was 86.3MB in the beginning and 86.2MB in the end (delta: 113.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.71ms. Allocated memory is still 109.1MB. Free memory was 68.3MB in the beginning and 71.1MB in the end (delta: -2.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.01ms. Allocated memory is still 109.1MB. Free memory was 71.1MB in the beginning and 68.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.14ms. Allocated memory is still 109.1MB. Free memory was 68.6MB in the beginning and 66.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 802.18ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 66.5MB in the beginning and 84.7MB in the end (delta: -18.3MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2823.18ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 83.8MB in the beginning and 85.2MB in the end (delta: -1.4MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. * Witness Printer took 91.29ms. Allocated memory is still 182.5MB. Free memory was 85.2MB in the beginning and 65.3MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L721] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L722] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L723] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L724] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=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, y=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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, y=0] [L813] 0 pthread_t t1633; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1633={5:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0] [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1633, ((void *)0), P0, ((void *)0))=-1, t1633={5:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0] [L815] 0 pthread_t t1634; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0] [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1634, ((void *)0), P1, ((void *)0))=0, t1633={5:0}, t1634={3:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, y=0] [L782] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=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, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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, y=2] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] EXPR 1 !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) [L750] 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) [L751] EXPR 1 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)) [L751] 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)) [L752] EXPR 1 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)) [L752] 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)) [L753] EXPR 1 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)) [L753] 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)) [L754] EXPR 1 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)) [L754] 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)) [L755] EXPR 1 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)) [L755] 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)) [L756] EXPR 1 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)) [L756] 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)) [L757] 1 __unbuffered_p0_EAX = x [L758] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=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, y=2] [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 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) [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 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 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] 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 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=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, y=2] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=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, y=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice0=65, weak$$choice2=255, x=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, y=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=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, y=2] [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] 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) [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L824] 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 [L825] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L826] 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 [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice0=65, weak$$choice2=255, x=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, y=2] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=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, y=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=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, y=2] - 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: 816]: 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: 814]: 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, 116 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 478 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 568 IncrementalHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 68 mSDtfsCounter, 568 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298occurred in iteration=5, InterpolantAutomatonStates: 65, 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.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 473 ConstructedInterpolants, 0 QuantifiedInterpolants, 1947 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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! [2022-07-22 21:25:19,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- 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