./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe010_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 f4b24e32 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/safe010_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 0b6ad05084ff5d70a22ef215b05587fd59d1867832386446579778aa62df8d63 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:49:27,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:49:27,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:49:27,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:49:27,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:49:27,560 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:49:27,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:49:27,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:49:27,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:49:27,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:49:27,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:49:27,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:49:27,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:49:27,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:49:27,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:49:27,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:49:27,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:49:27,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:49:27,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:49:27,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:49:27,586 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:49:27,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:49:27,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:49:27,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:49:27,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:49:27,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:49:27,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:49:27,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:49:27,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:49:27,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:49:27,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:49:27,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:49:27,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:49:27,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:49:27,599 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:49:27,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:49:27,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:49:27,601 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:49:27,601 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:49:27,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:49:27,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:49:27,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:49:27,604 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:49:27,627 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:49:27,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:49:27,628 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:49:27,628 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:49:27,628 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:49:27,629 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:49:27,629 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:49:27,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:49:27,629 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:49:27,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:49:27,630 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:49:27,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:49:27,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:49:27,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:49:27,631 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:49:27,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:49:27,631 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:49:27,631 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:49:27,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:49:27,632 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:49:27,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:49:27,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:49:27,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:49:27,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:49:27,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:49:27,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:49:27,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:49:27,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:49:27,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:49:27,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:49:27,634 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:49:27,634 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:49:27,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:49:27,634 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 -> 0b6ad05084ff5d70a22ef215b05587fd59d1867832386446579778aa62df8d63 [2022-07-13 21:49:27,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:49:27,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:49:27,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:49:27,849 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:49:27,850 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:49:27,851 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-07-13 21:49:27,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdaa988d5/a1f2100e08f24033bf81fda58ed5ef7d/FLAG0954a27da [2022-07-13 21:49:28,310 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:49:28,311 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-07-13 21:49:28,320 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdaa988d5/a1f2100e08f24033bf81fda58ed5ef7d/FLAG0954a27da [2022-07-13 21:49:28,690 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdaa988d5/a1f2100e08f24033bf81fda58ed5ef7d [2022-07-13 21:49:28,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:49:28,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:49:28,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:49:28,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:49:28,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:49:28,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:49:28" (1/1) ... [2022-07-13 21:49:28,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@356626ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:49:28, skipping insertion in model container [2022-07-13 21:49:28,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:49:28" (1/1) ... [2022-07-13 21:49:28,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:49:28,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:49:28,862 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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-07-13 21:49:29,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:49:29,049 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:49:29,059 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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-07-13 21:49:29,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:49:29,136 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:49:29,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:49:29 WrapperNode [2022-07-13 21:49:29,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:49:29,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:49:29,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:49:29,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:49:29,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:49:29" (1/1) ... [2022-07-13 21:49:29,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:49:29" (1/1) ... [2022-07-13 21:49:29,206 INFO L137 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 259 [2022-07-13 21:49:29,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:49:29,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:49:29,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:49:29,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:49:29,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:49:29" (1/1) ... [2022-07-13 21:49:29,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:49:29" (1/1) ... [2022-07-13 21:49:29,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:49:29" (1/1) ... [2022-07-13 21:49:29,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:49:29" (1/1) ... [2022-07-13 21:49:29,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:49:29" (1/1) ... [2022-07-13 21:49:29,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:49:29" (1/1) ... [2022-07-13 21:49:29,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:49:29" (1/1) ... [2022-07-13 21:49:29,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:49:29,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:49:29,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:49:29,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:49:29,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:49:29" (1/1) ... [2022-07-13 21:49:29,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:49:29,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:49:29,293 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-13 21:49:29,313 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-13 21:49:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 21:49:29,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-13 21:49:29,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:49:29,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 21:49:29,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 21:49:29,331 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-13 21:49:29,331 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-13 21:49:29,331 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-13 21:49:29,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-13 21:49:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:49:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-13 21:49:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:49:29,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:49:29,334 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 21:49:29,471 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:49:29,479 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:49:29,853 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:49:30,050 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:49:30,050 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 21:49:30,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:49:30 BoogieIcfgContainer [2022-07-13 21:49:30,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:49:30,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:49:30,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:49:30,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:49:30,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:49:28" (1/3) ... [2022-07-13 21:49:30,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24da3fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:49:30, skipping insertion in model container [2022-07-13 21:49:30,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:49:29" (2/3) ... [2022-07-13 21:49:30,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24da3fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:49:30, skipping insertion in model container [2022-07-13 21:49:30,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:49:30" (3/3) ... [2022-07-13 21:49:30,059 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-07-13 21:49:30,064 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 21:49:30,071 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:49:30,071 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 21:49:30,071 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 21:49:30,109 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-13 21:49:30,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 94 transitions, 198 flow [2022-07-13 21:49:30,167 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2022-07-13 21:49:30,168 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:49:30,170 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-07-13 21:49:30,170 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 94 transitions, 198 flow [2022-07-13 21:49:30,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 92 transitions, 190 flow [2022-07-13 21:49:30,199 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:49:30,204 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@3d071fad, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f549fc [2022-07-13 21:49:30,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-13 21:49:30,213 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2022-07-13 21:49:30,214 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:49:30,214 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:49:30,215 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] [2022-07-13 21:49:30,215 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-13 21:49:30,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:49:30,221 INFO L85 PathProgramCache]: Analyzing trace with hash 840746016, now seen corresponding path program 1 times [2022-07-13 21:49:30,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:49:30,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796610798] [2022-07-13 21:49:30,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:49:30,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:49:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:49:30,402 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-13 21:49:30,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:49:30,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796610798] [2022-07-13 21:49:30,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796610798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:49:30,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:49:30,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 21:49:30,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635686626] [2022-07-13 21:49:30,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:49:30,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:49:30,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:49:30,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:49:30,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:49:30,441 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 94 [2022-07-13 21:49:30,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 92 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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-13 21:49:30,446 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:49:30,446 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 94 [2022-07-13 21:49:30,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:49:30,545 INFO L129 PetriNetUnfolder]: 18/163 cut-off events. [2022-07-13 21:49:30,546 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-13 21:49:30,547 INFO L84 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 163 events. 18/163 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 395 event pairs, 2 based on Foata normal form. 6/161 useless extension candidates. Maximal degree in co-relation 168. Up to 31 conditions per place. [2022-07-13 21:49:30,549 INFO L132 encePairwiseOnDemand]: 89/94 looper letters, 10 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2022-07-13 21:49:30,550 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 92 transitions, 217 flow [2022-07-13 21:49:30,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:49:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:49:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2022-07-13 21:49:30,574 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9326241134751773 [2022-07-13 21:49:30,575 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 263 transitions. [2022-07-13 21:49:30,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 263 transitions. [2022-07-13 21:49:30,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:49:30,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 263 transitions. [2022-07-13 21:49:30,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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-13 21:49:30,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 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-13 21:49:30,593 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 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-13 21:49:30,595 INFO L186 Difference]: Start difference. First operand has 97 places, 92 transitions, 190 flow. Second operand 3 states and 263 transitions. [2022-07-13 21:49:30,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 92 transitions, 217 flow [2022-07-13 21:49:30,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 92 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-13 21:49:30,604 INFO L242 Difference]: Finished difference. Result has 95 places, 88 transitions, 184 flow [2022-07-13 21:49:30,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2022-07-13 21:49:30,609 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, -2 predicate places. [2022-07-13 21:49:30,609 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 184 flow [2022-07-13 21:49:30,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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-13 21:49:30,611 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:49:30,611 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] [2022-07-13 21:49:30,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:49:30,612 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-13 21:49:30,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:49:30,612 INFO L85 PathProgramCache]: Analyzing trace with hash 88413764, now seen corresponding path program 1 times [2022-07-13 21:49:30,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:49:30,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19894268] [2022-07-13 21:49:30,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:49:30,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:49:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:49:30,866 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-13 21:49:30,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:49:30,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19894268] [2022-07-13 21:49:30,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19894268] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:49:30,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:49:30,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:49:30,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277920211] [2022-07-13 21:49:30,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:49:30,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:49:30,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:49:30,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:49:30,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:49:30,870 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 94 [2022-07-13 21:49:30,871 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 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-13 21:49:30,871 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:49:30,871 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 94 [2022-07-13 21:49:30,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:49:31,142 INFO L129 PetriNetUnfolder]: 114/467 cut-off events. [2022-07-13 21:49:31,143 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-07-13 21:49:31,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 467 events. 114/467 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2351 event pairs, 25 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 683. Up to 105 conditions per place. [2022-07-13 21:49:31,148 INFO L132 encePairwiseOnDemand]: 88/94 looper letters, 15 selfloop transitions, 2 changer transitions 37/118 dead transitions. [2022-07-13 21:49:31,148 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 118 transitions, 348 flow [2022-07-13 21:49:31,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:49:31,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:49:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 722 transitions. [2022-07-13 21:49:31,152 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8534278959810875 [2022-07-13 21:49:31,152 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 722 transitions. [2022-07-13 21:49:31,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 722 transitions. [2022-07-13 21:49:31,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:49:31,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 722 transitions. [2022-07-13 21:49:31,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 80.22222222222223) internal successors, (722), 9 states have internal predecessors, (722), 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-13 21:49:31,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 94.0) internal successors, (940), 10 states have internal predecessors, (940), 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-13 21:49:31,157 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 94.0) internal successors, (940), 10 states have internal predecessors, (940), 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-13 21:49:31,158 INFO L186 Difference]: Start difference. First operand has 95 places, 88 transitions, 184 flow. Second operand 9 states and 722 transitions. [2022-07-13 21:49:31,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 118 transitions, 348 flow [2022-07-13 21:49:31,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 118 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-13 21:49:31,161 INFO L242 Difference]: Finished difference. Result has 108 places, 78 transitions, 180 flow [2022-07-13 21:49:31,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=180, PETRI_PLACES=108, PETRI_TRANSITIONS=78} [2022-07-13 21:49:31,162 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 11 predicate places. [2022-07-13 21:49:31,162 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 78 transitions, 180 flow [2022-07-13 21:49:31,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 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-13 21:49:31,163 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:49:31,163 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-13 21:49:31,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:49:31,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-13 21:49:31,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:49:31,165 INFO L85 PathProgramCache]: Analyzing trace with hash -469601021, now seen corresponding path program 1 times [2022-07-13 21:49:31,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:49:31,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308237053] [2022-07-13 21:49:31,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:49:31,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:49:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:49:31,412 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-13 21:49:31,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:49:31,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308237053] [2022-07-13 21:49:31,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308237053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:49:31,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:49:31,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 21:49:31,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894962886] [2022-07-13 21:49:31,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:49:31,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:49:31,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:49:31,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:49:31,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:49:31,416 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 94 [2022-07-13 21:49:31,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 78 transitions, 180 flow. Second operand has 10 states, 10 states have (on average 73.3) internal successors, (733), 10 states have internal predecessors, (733), 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-13 21:49:31,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:49:31,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 94 [2022-07-13 21:49:31,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:49:31,686 INFO L129 PetriNetUnfolder]: 99/315 cut-off events. [2022-07-13 21:49:31,686 INFO L130 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-07-13 21:49:31,687 INFO L84 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 315 events. 99/315 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1248 event pairs, 25 based on Foata normal form. 9/317 useless extension candidates. Maximal degree in co-relation 563. Up to 108 conditions per place. [2022-07-13 21:49:31,688 INFO L132 encePairwiseOnDemand]: 83/94 looper letters, 17 selfloop transitions, 8 changer transitions 35/121 dead transitions. [2022-07-13 21:49:31,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 121 transitions, 418 flow [2022-07-13 21:49:31,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 21:49:31,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-13 21:49:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1143 transitions. [2022-07-13 21:49:31,691 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8106382978723404 [2022-07-13 21:49:31,691 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1143 transitions. [2022-07-13 21:49:31,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1143 transitions. [2022-07-13 21:49:31,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:49:31,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1143 transitions. [2022-07-13 21:49:31,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 76.2) internal successors, (1143), 15 states have internal predecessors, (1143), 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-13 21:49:31,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 94.0) internal successors, (1504), 16 states have internal predecessors, (1504), 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-13 21:49:31,697 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 94.0) internal successors, (1504), 16 states have internal predecessors, (1504), 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-13 21:49:31,697 INFO L186 Difference]: Start difference. First operand has 108 places, 78 transitions, 180 flow. Second operand 15 states and 1143 transitions. [2022-07-13 21:49:31,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 121 transitions, 418 flow [2022-07-13 21:49:31,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 121 transitions, 378 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-07-13 21:49:31,701 INFO L242 Difference]: Finished difference. Result has 109 places, 82 transitions, 236 flow [2022-07-13 21:49:31,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=236, PETRI_PLACES=109, PETRI_TRANSITIONS=82} [2022-07-13 21:49:31,702 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 12 predicate places. [2022-07-13 21:49:31,703 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 82 transitions, 236 flow [2022-07-13 21:49:31,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 73.3) internal successors, (733), 10 states have internal predecessors, (733), 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-13 21:49:31,703 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:49:31,703 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] [2022-07-13 21:49:31,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:49:31,704 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-13 21:49:31,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:49:31,704 INFO L85 PathProgramCache]: Analyzing trace with hash -870504972, now seen corresponding path program 1 times [2022-07-13 21:49:31,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:49:31,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897255329] [2022-07-13 21:49:31,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:49:31,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:49:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:49:31,846 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-13 21:49:31,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:49:31,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897255329] [2022-07-13 21:49:31,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897255329] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:49:31,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:49:31,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:49:31,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38660243] [2022-07-13 21:49:31,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:49:31,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:49:31,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:49:31,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:49:31,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:49:31,848 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 94 [2022-07-13 21:49:31,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 82 transitions, 236 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-13 21:49:31,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:49:31,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 94 [2022-07-13 21:49:31,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:49:32,081 INFO L129 PetriNetUnfolder]: 103/348 cut-off events. [2022-07-13 21:49:32,082 INFO L130 PetriNetUnfolder]: For 545/548 co-relation queries the response was YES. [2022-07-13 21:49:32,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 348 events. 103/348 cut-off events. For 545/548 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1463 event pairs, 26 based on Foata normal form. 10/340 useless extension candidates. Maximal degree in co-relation 853. Up to 68 conditions per place. [2022-07-13 21:49:32,084 INFO L132 encePairwiseOnDemand]: 86/94 looper letters, 17 selfloop transitions, 4 changer transitions 29/113 dead transitions. [2022-07-13 21:49:32,084 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 113 transitions, 494 flow [2022-07-13 21:49:32,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:49:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:49:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 778 transitions. [2022-07-13 21:49:32,087 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8276595744680851 [2022-07-13 21:49:32,087 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 778 transitions. [2022-07-13 21:49:32,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 778 transitions. [2022-07-13 21:49:32,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:49:32,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 778 transitions. [2022-07-13 21:49:32,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 77.8) internal successors, (778), 10 states have internal predecessors, (778), 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-13 21:49:32,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 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-13 21:49:32,093 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 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-13 21:49:32,093 INFO L186 Difference]: Start difference. First operand has 109 places, 82 transitions, 236 flow. Second operand 10 states and 778 transitions. [2022-07-13 21:49:32,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 113 transitions, 494 flow [2022-07-13 21:49:32,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 113 transitions, 468 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-07-13 21:49:32,099 INFO L242 Difference]: Finished difference. Result has 112 places, 80 transitions, 241 flow [2022-07-13 21:49:32,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=241, PETRI_PLACES=112, PETRI_TRANSITIONS=80} [2022-07-13 21:49:32,100 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 15 predicate places. [2022-07-13 21:49:32,100 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 80 transitions, 241 flow [2022-07-13 21:49:32,100 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-13 21:49:32,100 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:49:32,101 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] [2022-07-13 21:49:32,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 21:49:32,101 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-13 21:49:32,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:49:32,101 INFO L85 PathProgramCache]: Analyzing trace with hash 962395624, now seen corresponding path program 1 times [2022-07-13 21:49:32,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:49:32,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232533064] [2022-07-13 21:49:32,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:49:32,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:49:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:49:32,236 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-13 21:49:32,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:49:32,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232533064] [2022-07-13 21:49:32,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232533064] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:49:32,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:49:32,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:49:32,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191066173] [2022-07-13 21:49:32,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:49:32,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:49:32,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:49:32,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:49:32,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:49:32,239 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 94 [2022-07-13 21:49:32,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 80 transitions, 241 flow. Second operand has 9 states, 9 states have (on average 69.88888888888889) internal successors, (629), 9 states have internal predecessors, (629), 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-13 21:49:32,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:49:32,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 94 [2022-07-13 21:49:32,240 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:49:32,650 INFO L129 PetriNetUnfolder]: 237/696 cut-off events. [2022-07-13 21:49:32,651 INFO L130 PetriNetUnfolder]: For 863/866 co-relation queries the response was YES. [2022-07-13 21:49:32,653 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 696 events. 237/696 cut-off events. For 863/866 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3995 event pairs, 27 based on Foata normal form. 3/684 useless extension candidates. Maximal degree in co-relation 1585. Up to 146 conditions per place. [2022-07-13 21:49:32,655 INFO L132 encePairwiseOnDemand]: 80/94 looper letters, 43 selfloop transitions, 9 changer transitions 65/173 dead transitions. [2022-07-13 21:49:32,655 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 173 transitions, 801 flow [2022-07-13 21:49:32,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 21:49:32,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-07-13 21:49:32,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1342 transitions. [2022-07-13 21:49:32,658 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.793144208037825 [2022-07-13 21:49:32,658 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1342 transitions. [2022-07-13 21:49:32,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1342 transitions. [2022-07-13 21:49:32,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:49:32,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1342 transitions. [2022-07-13 21:49:32,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 74.55555555555556) internal successors, (1342), 18 states have internal predecessors, (1342), 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-13 21:49:32,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 94.0) internal successors, (1786), 19 states have internal predecessors, (1786), 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-13 21:49:32,664 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 94.0) internal successors, (1786), 19 states have internal predecessors, (1786), 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-13 21:49:32,664 INFO L186 Difference]: Start difference. First operand has 112 places, 80 transitions, 241 flow. Second operand 18 states and 1342 transitions. [2022-07-13 21:49:32,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 173 transitions, 801 flow [2022-07-13 21:49:32,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 173 transitions, 755 flow, removed 15 selfloop flow, removed 15 redundant places. [2022-07-13 21:49:32,668 INFO L242 Difference]: Finished difference. Result has 122 places, 85 transitions, 316 flow [2022-07-13 21:49:32,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=316, PETRI_PLACES=122, PETRI_TRANSITIONS=85} [2022-07-13 21:49:32,669 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 25 predicate places. [2022-07-13 21:49:32,669 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 85 transitions, 316 flow [2022-07-13 21:49:32,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 69.88888888888889) internal successors, (629), 9 states have internal predecessors, (629), 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-13 21:49:32,669 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:49:32,669 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] [2022-07-13 21:49:32,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:49:32,670 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-13 21:49:32,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:49:32,670 INFO L85 PathProgramCache]: Analyzing trace with hash -984693500, now seen corresponding path program 2 times [2022-07-13 21:49:32,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:49:32,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017879998] [2022-07-13 21:49:32,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:49:32,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:49:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:49:32,742 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-13 21:49:32,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:49:32,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017879998] [2022-07-13 21:49:32,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017879998] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:49:32,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:49:32,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:49:32,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516068668] [2022-07-13 21:49:32,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:49:32,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:49:32,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:49:32,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:49:32,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:49:32,744 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 94 [2022-07-13 21:49:32,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 85 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 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-13 21:49:32,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:49:32,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 94 [2022-07-13 21:49:32,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:49:32,893 INFO L129 PetriNetUnfolder]: 97/331 cut-off events. [2022-07-13 21:49:32,894 INFO L130 PetriNetUnfolder]: For 856/862 co-relation queries the response was YES. [2022-07-13 21:49:32,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 331 events. 97/331 cut-off events. For 856/862 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1318 event pairs, 7 based on Foata normal form. 16/343 useless extension candidates. Maximal degree in co-relation 1020. Up to 67 conditions per place. [2022-07-13 21:49:32,896 INFO L132 encePairwiseOnDemand]: 86/94 looper letters, 21 selfloop transitions, 5 changer transitions 27/115 dead transitions. [2022-07-13 21:49:32,896 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 115 transitions, 622 flow [2022-07-13 21:49:32,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:49:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:49:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 709 transitions. [2022-07-13 21:49:32,898 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8380614657210402 [2022-07-13 21:49:32,898 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 709 transitions. [2022-07-13 21:49:32,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 709 transitions. [2022-07-13 21:49:32,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:49:32,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 709 transitions. [2022-07-13 21:49:32,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 78.77777777777777) internal successors, (709), 9 states have internal predecessors, (709), 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-13 21:49:32,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 94.0) internal successors, (940), 10 states have internal predecessors, (940), 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-13 21:49:32,902 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 94.0) internal successors, (940), 10 states have internal predecessors, (940), 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-13 21:49:32,902 INFO L186 Difference]: Start difference. First operand has 122 places, 85 transitions, 316 flow. Second operand 9 states and 709 transitions. [2022-07-13 21:49:32,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 115 transitions, 622 flow [2022-07-13 21:49:32,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 115 transitions, 550 flow, removed 23 selfloop flow, removed 12 redundant places. [2022-07-13 21:49:32,906 INFO L242 Difference]: Finished difference. Result has 111 places, 81 transitions, 270 flow [2022-07-13 21:49:32,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=270, PETRI_PLACES=111, PETRI_TRANSITIONS=81} [2022-07-13 21:49:32,906 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 14 predicate places. [2022-07-13 21:49:32,907 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 81 transitions, 270 flow [2022-07-13 21:49:32,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 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-13 21:49:32,907 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:49:32,907 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] [2022-07-13 21:49:32,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:49:32,908 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-13 21:49:32,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:49:32,908 INFO L85 PathProgramCache]: Analyzing trace with hash 89874638, now seen corresponding path program 1 times [2022-07-13 21:49:32,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:49:32,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463679424] [2022-07-13 21:49:32,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:49:32,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:49:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:49:32,979 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-13 21:49:32,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:49:32,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463679424] [2022-07-13 21:49:32,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463679424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:49:32,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:49:32,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:49:32,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575034852] [2022-07-13 21:49:32,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:49:32,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:49:32,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:49:32,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:49:32,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:49:32,982 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 94 [2022-07-13 21:49:32,983 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 81 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 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-13 21:49:32,983 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:49:32,983 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 94 [2022-07-13 21:49:32,983 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:49:33,108 INFO L129 PetriNetUnfolder]: 23/144 cut-off events. [2022-07-13 21:49:33,109 INFO L130 PetriNetUnfolder]: For 261/261 co-relation queries the response was YES. [2022-07-13 21:49:33,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 144 events. 23/144 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 288 event pairs, 3 based on Foata normal form. 5/147 useless extension candidates. Maximal degree in co-relation 388. Up to 17 conditions per place. [2022-07-13 21:49:33,110 INFO L132 encePairwiseOnDemand]: 86/94 looper letters, 15 selfloop transitions, 7 changer transitions 15/99 dead transitions. [2022-07-13 21:49:33,110 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 99 transitions, 467 flow [2022-07-13 21:49:33,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:49:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:49:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 768 transitions. [2022-07-13 21:49:33,113 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8170212765957446 [2022-07-13 21:49:33,113 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 768 transitions. [2022-07-13 21:49:33,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 768 transitions. [2022-07-13 21:49:33,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:49:33,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 768 transitions. [2022-07-13 21:49:33,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 76.8) internal successors, (768), 10 states have internal predecessors, (768), 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-13 21:49:33,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 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-13 21:49:33,117 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 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-13 21:49:33,117 INFO L186 Difference]: Start difference. First operand has 111 places, 81 transitions, 270 flow. Second operand 10 states and 768 transitions. [2022-07-13 21:49:33,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 99 transitions, 467 flow [2022-07-13 21:49:33,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 99 transitions, 372 flow, removed 39 selfloop flow, removed 13 redundant places. [2022-07-13 21:49:33,120 INFO L242 Difference]: Finished difference. Result has 109 places, 81 transitions, 254 flow [2022-07-13 21:49:33,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=254, PETRI_PLACES=109, PETRI_TRANSITIONS=81} [2022-07-13 21:49:33,121 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 12 predicate places. [2022-07-13 21:49:33,121 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 81 transitions, 254 flow [2022-07-13 21:49:33,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 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-13 21:49:33,122 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:49:33,122 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] [2022-07-13 21:49:33,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:49:33,122 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-13 21:49:33,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:49:33,123 INFO L85 PathProgramCache]: Analyzing trace with hash -684190178, now seen corresponding path program 1 times [2022-07-13 21:49:33,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:49:33,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94946153] [2022-07-13 21:49:33,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:49:33,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:49:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:49:33,424 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-13 21:49:33,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:49:33,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94946153] [2022-07-13 21:49:33,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94946153] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:49:33,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:49:33,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 21:49:33,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430952354] [2022-07-13 21:49:33,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:49:33,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 21:49:33,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:49:33,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 21:49:33,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-13 21:49:33,427 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 94 [2022-07-13 21:49:33,428 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 81 transitions, 254 flow. Second operand has 14 states, 14 states have (on average 69.5) internal successors, (973), 14 states have internal predecessors, (973), 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-13 21:49:33,428 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:49:33,428 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 94 [2022-07-13 21:49:33,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:49:33,596 INFO L129 PetriNetUnfolder]: 5/122 cut-off events. [2022-07-13 21:49:33,596 INFO L130 PetriNetUnfolder]: For 96/100 co-relation queries the response was YES. [2022-07-13 21:49:33,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 122 events. 5/122 cut-off events. For 96/100 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 166 event pairs, 0 based on Foata normal form. 3/125 useless extension candidates. Maximal degree in co-relation 247. Up to 12 conditions per place. [2022-07-13 21:49:33,597 INFO L132 encePairwiseOnDemand]: 83/94 looper letters, 16 selfloop transitions, 7 changer transitions 9/90 dead transitions. [2022-07-13 21:49:33,597 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 90 transitions, 340 flow [2022-07-13 21:49:33,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 21:49:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-13 21:49:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 917 transitions. [2022-07-13 21:49:33,599 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7504091653027823 [2022-07-13 21:49:33,599 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 917 transitions. [2022-07-13 21:49:33,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 917 transitions. [2022-07-13 21:49:33,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:49:33,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 917 transitions. [2022-07-13 21:49:33,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 70.53846153846153) internal successors, (917), 13 states have internal predecessors, (917), 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-13 21:49:33,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 94.0) internal successors, (1316), 14 states have internal predecessors, (1316), 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-13 21:49:33,604 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 94.0) internal successors, (1316), 14 states have internal predecessors, (1316), 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-13 21:49:33,604 INFO L186 Difference]: Start difference. First operand has 109 places, 81 transitions, 254 flow. Second operand 13 states and 917 transitions. [2022-07-13 21:49:33,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 90 transitions, 340 flow [2022-07-13 21:49:33,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 90 transitions, 287 flow, removed 15 selfloop flow, removed 14 redundant places. [2022-07-13 21:49:33,606 INFO L242 Difference]: Finished difference. Result has 107 places, 79 transitions, 213 flow [2022-07-13 21:49:33,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=213, PETRI_PLACES=107, PETRI_TRANSITIONS=79} [2022-07-13 21:49:33,607 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 10 predicate places. [2022-07-13 21:49:33,607 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 79 transitions, 213 flow [2022-07-13 21:49:33,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 69.5) internal successors, (973), 14 states have internal predecessors, (973), 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-13 21:49:33,608 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:49:33,608 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] [2022-07-13 21:49:33,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 21:49:33,608 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-13 21:49:33,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:49:33,609 INFO L85 PathProgramCache]: Analyzing trace with hash -376990720, now seen corresponding path program 2 times [2022-07-13 21:49:33,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:49:33,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561512480] [2022-07-13 21:49:33,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:49:33,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:49:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:49:33,640 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:49:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:49:33,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:49:33,691 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:49:33,691 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-07-13 21:49:33,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-13 21:49:33,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-07-13 21:49:33,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-07-13 21:49:33,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-13 21:49:33,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 21:49:33,694 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2022-07-13 21:49:33,698 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-13 21:49:33,699 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 21:49:33,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 09:49:33 BasicIcfg [2022-07-13 21:49:33,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 21:49:33,771 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 21:49:33,771 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 21:49:33,771 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 21:49:33,772 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:49:30" (3/4) ... [2022-07-13 21:49:33,773 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 21:49:33,845 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 21:49:33,845 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 21:49:33,846 INFO L158 Benchmark]: Toolchain (without parser) took 5152.11ms. Allocated memory was 92.3MB in the beginning and 188.7MB in the end (delta: 96.5MB). Free memory was 58.1MB in the beginning and 147.8MB in the end (delta: -89.8MB). Peak memory consumption was 106.8MB. Max. memory is 16.1GB. [2022-07-13 21:49:33,846 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 92.3MB. Free memory was 48.6MB in the beginning and 48.5MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:49:33,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.21ms. Allocated memory was 92.3MB in the beginning and 127.9MB in the end (delta: 35.7MB). Free memory was 57.9MB in the beginning and 90.5MB in the end (delta: -32.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 21:49:33,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.52ms. Allocated memory is still 127.9MB. Free memory was 89.9MB in the beginning and 87.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:49:33,847 INFO L158 Benchmark]: Boogie Preprocessor took 52.50ms. Allocated memory is still 127.9MB. Free memory was 87.3MB in the beginning and 85.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:49:33,847 INFO L158 Benchmark]: RCFGBuilder took 792.84ms. Allocated memory is still 127.9MB. Free memory was 85.2MB in the beginning and 65.5MB in the end (delta: 19.6MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2022-07-13 21:49:33,847 INFO L158 Benchmark]: TraceAbstraction took 3716.57ms. Allocated memory was 127.9MB in the beginning and 188.7MB in the end (delta: 60.8MB). Free memory was 64.9MB in the beginning and 54.6MB in the end (delta: 10.2MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2022-07-13 21:49:33,847 INFO L158 Benchmark]: Witness Printer took 74.10ms. Allocated memory is still 188.7MB. Free memory was 54.6MB in the beginning and 147.8MB in the end (delta: -93.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2022-07-13 21:49:33,849 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.19ms. Allocated memory is still 92.3MB. Free memory was 48.6MB in the beginning and 48.5MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.21ms. Allocated memory was 92.3MB in the beginning and 127.9MB in the end (delta: 35.7MB). Free memory was 57.9MB in the beginning and 90.5MB in the end (delta: -32.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.52ms. Allocated memory is still 127.9MB. Free memory was 89.9MB in the beginning and 87.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.50ms. Allocated memory is still 127.9MB. Free memory was 87.3MB in the beginning and 85.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 792.84ms. Allocated memory is still 127.9MB. Free memory was 85.2MB in the beginning and 65.5MB in the end (delta: 19.6MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3716.57ms. Allocated memory was 127.9MB in the beginning and 188.7MB in the end (delta: 60.8MB). Free memory was 64.9MB in the beginning and 54.6MB in the end (delta: 10.2MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. * Witness Printer took 74.10ms. Allocated memory is still 188.7MB. Free memory was 54.6MB in the beginning and 147.8MB in the end (delta: -93.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L711] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L712] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L714] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L718] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L719] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L720] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L721] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L726] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L727] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L728] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L729] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L730] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2009; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2009, ((void *)0), P0, ((void *)0))=-1, t2009={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2010; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2010, ((void *)0), P1, ((void *)0))=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0: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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 795]: 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: 793]: 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, 112 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: 3.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 341 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 320 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 479 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 760 IncrementalHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 68 mSDtfsCounter, 760 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred in iteration=5, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 589 NumberOfCodeBlocks, 589 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 2725 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 21:49:33,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE