./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe013_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 6c24879c 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/safe013_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 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:09:29,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:09:29,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:09:29,812 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:09:29,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:09:29,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:09:29,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:09:29,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:09:29,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:09:29,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:09:29,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:09:29,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:09:29,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:09:29,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:09:29,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:09:29,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:09:29,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:09:29,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:09:29,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:09:29,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:09:29,848 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:09:29,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:09:29,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:09:29,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:09:29,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:09:29,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:09:29,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:09:29,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:09:29,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:09:29,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:09:29,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:09:29,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:09:29,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:09:29,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:09:29,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:09:29,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:09:29,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:09:29,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:09:29,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:09:29,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:09:29,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:09:29,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:09:29,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:09:29,902 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:09:29,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:09:29,904 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:09:29,904 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:09:29,904 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:09:29,905 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:09:29,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:09:29,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:09:29,905 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:09:29,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:09:29,907 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:09:29,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:09:29,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:09:29,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:09:29,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:09:29,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:09:29,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:09:29,908 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:09:29,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:09:29,909 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:09:29,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:09:29,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:09:29,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:09:29,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:09:29,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:09:29,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:09:29,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:09:29,911 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:09:29,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:09:29,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:09:29,911 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:09:29,912 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:09:29,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:09:29,912 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 -> 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 [2022-07-12 10:09:30,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:09:30,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:09:30,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:09:30,166 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:09:30,166 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:09:30,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-07-12 10:09:30,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33448230/ef89fab2bb6c4ab39cf618ae4b9d2799/FLAGd578e54ae [2022-07-12 10:09:30,748 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:09:30,749 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-07-12 10:09:30,771 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33448230/ef89fab2bb6c4ab39cf618ae4b9d2799/FLAGd578e54ae [2022-07-12 10:09:31,077 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33448230/ef89fab2bb6c4ab39cf618ae4b9d2799 [2022-07-12 10:09:31,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:09:31,080 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:09:31,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:09:31,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:09:31,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:09:31,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:09:31" (1/1) ... [2022-07-12 10:09:31,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@467442e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:31, skipping insertion in model container [2022-07-12 10:09:31,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:09:31" (1/1) ... [2022-07-12 10:09:31,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:09:31,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:09:31,322 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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-07-12 10:09:31,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:09:31,465 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:09:31,475 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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-07-12 10:09:31,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:09:31,552 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:09:31,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:31 WrapperNode [2022-07-12 10:09:31,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:09:31,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:09:31,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:09:31,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:09:31,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:31" (1/1) ... [2022-07-12 10:09:31,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:31" (1/1) ... [2022-07-12 10:09:31,607 INFO L137 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-07-12 10:09:31,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:09:31,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:09:31,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:09:31,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:09:31,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:31" (1/1) ... [2022-07-12 10:09:31,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:31" (1/1) ... [2022-07-12 10:09:31,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:31" (1/1) ... [2022-07-12 10:09:31,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:31" (1/1) ... [2022-07-12 10:09:31,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:31" (1/1) ... [2022-07-12 10:09:31,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:31" (1/1) ... [2022-07-12 10:09:31,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:31" (1/1) ... [2022-07-12 10:09:31,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:09:31,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:09:31,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:09:31,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:09:31,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:31" (1/1) ... [2022-07-12 10:09:31,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:09:31,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:09:31,737 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-12 10:09:31,761 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-12 10:09:31,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:09:31,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:09:31,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:09:31,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:09:31,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:09:31,786 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-12 10:09:31,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-12 10:09:31,788 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-12 10:09:31,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-12 10:09:31,788 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-12 10:09:31,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-12 10:09:31,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:09:31,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:09:31,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:09:31,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:09:31,791 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:09:31,930 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:09:31,932 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:09:32,368 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:09:32,660 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:09:32,660 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 10:09:32,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:09:32 BoogieIcfgContainer [2022-07-12 10:09:32,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:09:32,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:09:32,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:09:32,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:09:32,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:09:31" (1/3) ... [2022-07-12 10:09:32,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73726099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:09:32, skipping insertion in model container [2022-07-12 10:09:32,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:31" (2/3) ... [2022-07-12 10:09:32,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73726099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:09:32, skipping insertion in model container [2022-07-12 10:09:32,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:09:32" (3/3) ... [2022-07-12 10:09:32,672 INFO L111 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-07-12 10:09:32,677 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:09:32,686 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:09:32,687 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 10:09:32,687 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:09:32,749 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-12 10:09:32,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-07-12 10:09:32,849 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2022-07-12 10:09:32,850 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:09:32,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-07-12 10:09:32,854 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-07-12 10:09:32,859 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-07-12 10:09:32,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:09:32,885 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@1af6c71f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@36900d0e [2022-07-12 10:09:32,885 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-12 10:09:32,896 INFO L129 PetriNetUnfolder]: 0/59 cut-off events. [2022-07-12 10:09:32,896 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:09:32,897 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:32,897 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] [2022-07-12 10:09:32,898 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:32,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:32,902 INFO L85 PathProgramCache]: Analyzing trace with hash 67631088, now seen corresponding path program 1 times [2022-07-12 10:09:32,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:32,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385421412] [2022-07-12 10:09:32,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:32,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:33,238 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-12 10:09:33,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:33,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385421412] [2022-07-12 10:09:33,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385421412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:33,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:33,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:09:33,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337134359] [2022-07-12 10:09:33,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:33,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:09:33,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:33,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:09:33,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:09:33,285 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 114 [2022-07-12 10:09:33,290 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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-12 10:09:33,290 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:33,290 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 114 [2022-07-12 10:09:33,292 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:33,471 INFO L129 PetriNetUnfolder]: 37/222 cut-off events. [2022-07-12 10:09:33,471 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-07-12 10:09:33,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 222 events. 37/222 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 694 event pairs, 7 based on Foata normal form. 11/217 useless extension candidates. Maximal degree in co-relation 263. Up to 51 conditions per place. [2022-07-12 10:09:33,476 INFO L132 encePairwiseOnDemand]: 109/114 looper letters, 11 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2022-07-12 10:09:33,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 111 transitions, 260 flow [2022-07-12 10:09:33,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:09:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:09:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-07-12 10:09:33,495 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2022-07-12 10:09:33,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2022-07-12 10:09:33,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2022-07-12 10:09:33,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:33,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2022-07-12 10:09:33,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-12 10:09:33,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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-12 10:09:33,517 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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-12 10:09:33,519 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 321 transitions. [2022-07-12 10:09:33,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 111 transitions, 260 flow [2022-07-12 10:09:33,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 111 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-12 10:09:33,528 INFO L242 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-07-12 10:09:33,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-07-12 10:09:33,533 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-07-12 10:09:33,535 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-07-12 10:09:33,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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-12 10:09:33,536 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:33,536 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:33,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:09:33,536 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:33,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:33,538 INFO L85 PathProgramCache]: Analyzing trace with hash -764172337, now seen corresponding path program 1 times [2022-07-12 10:09:33,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:33,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510897442] [2022-07-12 10:09:33,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:33,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:33,815 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-12 10:09:33,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:33,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510897442] [2022-07-12 10:09:33,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510897442] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:33,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:33,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:09:33,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771421804] [2022-07-12 10:09:33,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:33,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:09:33,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:33,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:09:33,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:09:33,824 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-07-12 10:09:33,825 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:33,825 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:33,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-07-12 10:09:33,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:34,644 INFO L129 PetriNetUnfolder]: 1109/3098 cut-off events. [2022-07-12 10:09:34,645 INFO L130 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2022-07-12 10:09:34,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5064 conditions, 3098 events. 1109/3098 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 25976 event pairs, 271 based on Foata normal form. 0/3005 useless extension candidates. Maximal degree in co-relation 5010. Up to 679 conditions per place. [2022-07-12 10:09:34,665 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 28 selfloop transitions, 5 changer transitions 61/169 dead transitions. [2022-07-12 10:09:34,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 169 transitions, 532 flow [2022-07-12 10:09:34,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:09:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:09:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 886 transitions. [2022-07-12 10:09:34,669 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8635477582846004 [2022-07-12 10:09:34,669 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 886 transitions. [2022-07-12 10:09:34,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 886 transitions. [2022-07-12 10:09:34,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:34,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 886 transitions. [2022-07-12 10:09:34,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.44444444444444) internal successors, (886), 9 states have internal predecessors, (886), 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-12 10:09:34,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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-12 10:09:34,677 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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-12 10:09:34,677 INFO L186 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 886 transitions. [2022-07-12 10:09:34,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 169 transitions, 532 flow [2022-07-12 10:09:34,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 169 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:09:34,682 INFO L242 Difference]: Finished difference. Result has 129 places, 98 transitions, 255 flow [2022-07-12 10:09:34,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=255, PETRI_PLACES=129, PETRI_TRANSITIONS=98} [2022-07-12 10:09:34,683 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-07-12 10:09:34,683 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 98 transitions, 255 flow [2022-07-12 10:09:34,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:34,684 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:34,684 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:34,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:09:34,685 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:34,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:34,685 INFO L85 PathProgramCache]: Analyzing trace with hash -830862450, now seen corresponding path program 1 times [2022-07-12 10:09:34,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:34,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082297087] [2022-07-12 10:09:34,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:34,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:34,863 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-12 10:09:34,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:34,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082297087] [2022-07-12 10:09:34,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082297087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:34,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:34,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:09:34,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384673982] [2022-07-12 10:09:34,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:34,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:09:34,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:34,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:09:34,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:09:34,870 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-07-12 10:09:34,871 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 98 transitions, 255 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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-12 10:09:34,871 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:34,871 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-07-12 10:09:34,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:35,462 INFO L129 PetriNetUnfolder]: 697/1488 cut-off events. [2022-07-12 10:09:35,462 INFO L130 PetriNetUnfolder]: For 1653/1653 co-relation queries the response was YES. [2022-07-12 10:09:35,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3981 conditions, 1488 events. 697/1488 cut-off events. For 1653/1653 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9243 event pairs, 75 based on Foata normal form. 30/1469 useless extension candidates. Maximal degree in co-relation 3920. Up to 454 conditions per place. [2022-07-12 10:09:35,475 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 30 selfloop transitions, 6 changer transitions 49/160 dead transitions. [2022-07-12 10:09:35,475 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 160 transitions, 688 flow [2022-07-12 10:09:35,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:09:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:09:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1244 transitions. [2022-07-12 10:09:35,479 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8394062078272605 [2022-07-12 10:09:35,479 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1244 transitions. [2022-07-12 10:09:35,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1244 transitions. [2022-07-12 10:09:35,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:35,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1244 transitions. [2022-07-12 10:09:35,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.6923076923077) internal successors, (1244), 13 states have internal predecessors, (1244), 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-12 10:09:35,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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-12 10:09:35,488 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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-12 10:09:35,488 INFO L186 Difference]: Start difference. First operand has 129 places, 98 transitions, 255 flow. Second operand 13 states and 1244 transitions. [2022-07-12 10:09:35,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 160 transitions, 688 flow [2022-07-12 10:09:35,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 160 transitions, 652 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-07-12 10:09:35,507 INFO L242 Difference]: Finished difference. Result has 130 places, 99 transitions, 288 flow [2022-07-12 10:09:35,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=288, PETRI_PLACES=130, PETRI_TRANSITIONS=99} [2022-07-12 10:09:35,509 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 11 predicate places. [2022-07-12 10:09:35,509 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 99 transitions, 288 flow [2022-07-12 10:09:35,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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-12 10:09:35,511 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:35,511 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:35,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:09:35,512 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:35,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1326470898, now seen corresponding path program 1 times [2022-07-12 10:09:35,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:35,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576323640] [2022-07-12 10:09:35,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:35,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:35,695 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-12 10:09:35,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:35,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576323640] [2022-07-12 10:09:35,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576323640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:35,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:35,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:09:35,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847116506] [2022-07-12 10:09:35,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:35,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:09:35,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:35,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:09:35,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:09:35,703 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-07-12 10:09:35,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 99 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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-12 10:09:35,704 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:35,704 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-07-12 10:09:35,704 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:36,294 INFO L129 PetriNetUnfolder]: 670/1482 cut-off events. [2022-07-12 10:09:36,294 INFO L130 PetriNetUnfolder]: For 2993/2993 co-relation queries the response was YES. [2022-07-12 10:09:36,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4422 conditions, 1482 events. 670/1482 cut-off events. For 2993/2993 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9435 event pairs, 62 based on Foata normal form. 39/1474 useless extension candidates. Maximal degree in co-relation 4352. Up to 417 conditions per place. [2022-07-12 10:09:36,306 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 30 selfloop transitions, 8 changer transitions 52/165 dead transitions. [2022-07-12 10:09:36,306 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 165 transitions, 793 flow [2022-07-12 10:09:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:09:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:09:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1249 transitions. [2022-07-12 10:09:36,311 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8427800269905533 [2022-07-12 10:09:36,311 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1249 transitions. [2022-07-12 10:09:36,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1249 transitions. [2022-07-12 10:09:36,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:36,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1249 transitions. [2022-07-12 10:09:36,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.07692307692308) internal successors, (1249), 13 states have internal predecessors, (1249), 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-12 10:09:36,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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-12 10:09:36,323 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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-12 10:09:36,323 INFO L186 Difference]: Start difference. First operand has 130 places, 99 transitions, 288 flow. Second operand 13 states and 1249 transitions. [2022-07-12 10:09:36,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 165 transitions, 793 flow [2022-07-12 10:09:36,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 165 transitions, 691 flow, removed 40 selfloop flow, removed 11 redundant places. [2022-07-12 10:09:36,340 INFO L242 Difference]: Finished difference. Result has 132 places, 100 transitions, 305 flow [2022-07-12 10:09:36,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=305, PETRI_PLACES=132, PETRI_TRANSITIONS=100} [2022-07-12 10:09:36,343 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 13 predicate places. [2022-07-12 10:09:36,343 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 100 transitions, 305 flow [2022-07-12 10:09:36,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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-12 10:09:36,344 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:36,344 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:36,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:09:36,344 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:36,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:36,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1400569395, now seen corresponding path program 1 times [2022-07-12 10:09:36,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:36,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065137970] [2022-07-12 10:09:36,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:36,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:36,487 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-12 10:09:36,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:36,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065137970] [2022-07-12 10:09:36,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065137970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:36,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:36,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:09:36,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859929211] [2022-07-12 10:09:36,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:36,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:09:36,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:36,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:09:36,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:09:36,491 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-07-12 10:09:36,491 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 100 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 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-12 10:09:36,491 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:36,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-07-12 10:09:36,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:37,211 INFO L129 PetriNetUnfolder]: 834/1858 cut-off events. [2022-07-12 10:09:37,212 INFO L130 PetriNetUnfolder]: For 4054/4066 co-relation queries the response was YES. [2022-07-12 10:09:37,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5534 conditions, 1858 events. 834/1858 cut-off events. For 4054/4066 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11987 event pairs, 123 based on Foata normal form. 36/1814 useless extension candidates. Maximal degree in co-relation 5461. Up to 324 conditions per place. [2022-07-12 10:09:37,227 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 49 selfloop transitions, 19 changer transitions 68/209 dead transitions. [2022-07-12 10:09:37,228 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 209 transitions, 1218 flow [2022-07-12 10:09:37,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 10:09:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-12 10:09:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1604 transitions. [2022-07-12 10:09:37,232 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8276573787409701 [2022-07-12 10:09:37,233 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1604 transitions. [2022-07-12 10:09:37,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1604 transitions. [2022-07-12 10:09:37,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:37,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1604 transitions. [2022-07-12 10:09:37,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 94.3529411764706) internal successors, (1604), 17 states have internal predecessors, (1604), 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-12 10:09:37,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 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-12 10:09:37,241 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 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-12 10:09:37,241 INFO L186 Difference]: Start difference. First operand has 132 places, 100 transitions, 305 flow. Second operand 17 states and 1604 transitions. [2022-07-12 10:09:37,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 209 transitions, 1218 flow [2022-07-12 10:09:37,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 209 transitions, 1022 flow, removed 68 selfloop flow, removed 11 redundant places. [2022-07-12 10:09:37,259 INFO L242 Difference]: Finished difference. Result has 144 places, 113 transitions, 505 flow [2022-07-12 10:09:37,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=505, PETRI_PLACES=144, PETRI_TRANSITIONS=113} [2022-07-12 10:09:37,261 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 25 predicate places. [2022-07-12 10:09:37,262 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 113 transitions, 505 flow [2022-07-12 10:09:37,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 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-12 10:09:37,263 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:37,263 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:37,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:09:37,264 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:37,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:37,265 INFO L85 PathProgramCache]: Analyzing trace with hash -517693363, now seen corresponding path program 2 times [2022-07-12 10:09:37,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:37,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41138467] [2022-07-12 10:09:37,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:37,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:37,431 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-12 10:09:37,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:37,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41138467] [2022-07-12 10:09:37,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41138467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:37,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:37,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:09:37,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097575708] [2022-07-12 10:09:37,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:37,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:09:37,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:37,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:09:37,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:09:37,435 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-07-12 10:09:37,436 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 113 transitions, 505 flow. Second operand has 8 states, 8 states have (on average 89.0) internal successors, (712), 8 states have internal predecessors, (712), 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-12 10:09:37,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:37,436 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-07-12 10:09:37,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:37,982 INFO L129 PetriNetUnfolder]: 744/1683 cut-off events. [2022-07-12 10:09:37,982 INFO L130 PetriNetUnfolder]: For 11506/11506 co-relation queries the response was YES. [2022-07-12 10:09:37,992 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6745 conditions, 1683 events. 744/1683 cut-off events. For 11506/11506 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10733 event pairs, 145 based on Foata normal form. 40/1626 useless extension candidates. Maximal degree in co-relation 6663. Up to 321 conditions per place. [2022-07-12 10:09:37,999 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 32 selfloop transitions, 10 changer transitions 62/177 dead transitions. [2022-07-12 10:09:38,000 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 177 transitions, 1296 flow [2022-07-12 10:09:38,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:09:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:09:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1038 transitions. [2022-07-12 10:09:38,003 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8277511961722488 [2022-07-12 10:09:38,003 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1038 transitions. [2022-07-12 10:09:38,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1038 transitions. [2022-07-12 10:09:38,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:38,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1038 transitions. [2022-07-12 10:09:38,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.36363636363636) internal successors, (1038), 11 states have internal predecessors, (1038), 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-12 10:09:38,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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-12 10:09:38,009 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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-12 10:09:38,009 INFO L186 Difference]: Start difference. First operand has 144 places, 113 transitions, 505 flow. Second operand 11 states and 1038 transitions. [2022-07-12 10:09:38,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 177 transitions, 1296 flow [2022-07-12 10:09:38,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 177 transitions, 1094 flow, removed 101 selfloop flow, removed 9 redundant places. [2022-07-12 10:09:38,035 INFO L242 Difference]: Finished difference. Result has 141 places, 102 transitions, 381 flow [2022-07-12 10:09:38,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=381, PETRI_PLACES=141, PETRI_TRANSITIONS=102} [2022-07-12 10:09:38,036 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 22 predicate places. [2022-07-12 10:09:38,036 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 102 transitions, 381 flow [2022-07-12 10:09:38,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.0) internal successors, (712), 8 states have internal predecessors, (712), 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-12 10:09:38,037 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:38,037 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:38,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:09:38,037 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:38,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:38,038 INFO L85 PathProgramCache]: Analyzing trace with hash -374121981, now seen corresponding path program 1 times [2022-07-12 10:09:38,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:38,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28570314] [2022-07-12 10:09:38,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:38,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:38,122 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-12 10:09:38,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:38,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28570314] [2022-07-12 10:09:38,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28570314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:38,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:38,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:09:38,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805056780] [2022-07-12 10:09:38,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:38,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:09:38,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:09:38,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:09:38,130 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-07-12 10:09:38,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 102 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 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-12 10:09:38,131 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:38,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-07-12 10:09:38,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:38,673 INFO L129 PetriNetUnfolder]: 1217/2515 cut-off events. [2022-07-12 10:09:38,673 INFO L130 PetriNetUnfolder]: For 5908/6172 co-relation queries the response was YES. [2022-07-12 10:09:38,681 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6580 conditions, 2515 events. 1217/2515 cut-off events. For 5908/6172 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 17149 event pairs, 96 based on Foata normal form. 76/2481 useless extension candidates. Maximal degree in co-relation 6555. Up to 704 conditions per place. [2022-07-12 10:09:38,688 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 32 selfloop transitions, 7 changer transitions 48/169 dead transitions. [2022-07-12 10:09:38,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 169 transitions, 847 flow [2022-07-12 10:09:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:09:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:09:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 991 transitions. [2022-07-12 10:09:38,691 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8692982456140351 [2022-07-12 10:09:38,691 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 991 transitions. [2022-07-12 10:09:38,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 991 transitions. [2022-07-12 10:09:38,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:38,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 991 transitions. [2022-07-12 10:09:38,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.1) internal successors, (991), 10 states have internal predecessors, (991), 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-12 10:09:38,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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-12 10:09:38,697 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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-12 10:09:38,697 INFO L186 Difference]: Start difference. First operand has 141 places, 102 transitions, 381 flow. Second operand 10 states and 991 transitions. [2022-07-12 10:09:38,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 169 transitions, 847 flow [2022-07-12 10:09:38,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 169 transitions, 705 flow, removed 27 selfloop flow, removed 16 redundant places. [2022-07-12 10:09:38,705 INFO L242 Difference]: Finished difference. Result has 134 places, 106 transitions, 364 flow [2022-07-12 10:09:38,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=364, PETRI_PLACES=134, PETRI_TRANSITIONS=106} [2022-07-12 10:09:38,706 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 15 predicate places. [2022-07-12 10:09:38,706 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 106 transitions, 364 flow [2022-07-12 10:09:38,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 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-12 10:09:38,706 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:38,707 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:38,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:09:38,707 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:38,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:38,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2110825476, now seen corresponding path program 1 times [2022-07-12 10:09:38,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:38,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187989564] [2022-07-12 10:09:38,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:38,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:38,816 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-12 10:09:38,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:38,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187989564] [2022-07-12 10:09:38,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187989564] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:38,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:38,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:09:38,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5938163] [2022-07-12 10:09:38,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:38,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:09:38,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:38,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:09:38,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:09:38,820 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-07-12 10:09:38,820 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 106 transitions, 364 flow. Second operand has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 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-12 10:09:38,821 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:38,821 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-07-12 10:09:38,821 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:39,243 INFO L129 PetriNetUnfolder]: 599/1525 cut-off events. [2022-07-12 10:09:39,243 INFO L130 PetriNetUnfolder]: For 2461/2542 co-relation queries the response was YES. [2022-07-12 10:09:39,249 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4649 conditions, 1525 events. 599/1525 cut-off events. For 2461/2542 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10312 event pairs, 66 based on Foata normal form. 82/1564 useless extension candidates. Maximal degree in co-relation 4629. Up to 387 conditions per place. [2022-07-12 10:09:39,254 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 39 selfloop transitions, 11 changer transitions 42/174 dead transitions. [2022-07-12 10:09:39,255 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 174 transitions, 943 flow [2022-07-12 10:09:39,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:09:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:09:39,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1086 transitions. [2022-07-12 10:09:39,258 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8660287081339713 [2022-07-12 10:09:39,258 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1086 transitions. [2022-07-12 10:09:39,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1086 transitions. [2022-07-12 10:09:39,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:39,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1086 transitions. [2022-07-12 10:09:39,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.72727272727273) internal successors, (1086), 11 states have internal predecessors, (1086), 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-12 10:09:39,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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-12 10:09:39,264 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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-12 10:09:39,264 INFO L186 Difference]: Start difference. First operand has 134 places, 106 transitions, 364 flow. Second operand 11 states and 1086 transitions. [2022-07-12 10:09:39,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 174 transitions, 943 flow [2022-07-12 10:09:39,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 174 transitions, 920 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-07-12 10:09:39,276 INFO L242 Difference]: Finished difference. Result has 142 places, 112 transitions, 458 flow [2022-07-12 10:09:39,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=458, PETRI_PLACES=142, PETRI_TRANSITIONS=112} [2022-07-12 10:09:39,278 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 23 predicate places. [2022-07-12 10:09:39,278 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 112 transitions, 458 flow [2022-07-12 10:09:39,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 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-12 10:09:39,279 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:39,279 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:39,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:09:39,281 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:39,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:39,281 INFO L85 PathProgramCache]: Analyzing trace with hash -289492209, now seen corresponding path program 1 times [2022-07-12 10:09:39,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:39,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426738502] [2022-07-12 10:09:39,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:39,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:39,457 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-12 10:09:39,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:39,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426738502] [2022-07-12 10:09:39,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426738502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:39,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:39,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:09:39,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459669631] [2022-07-12 10:09:39,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:39,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:09:39,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:39,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:09:39,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:09:39,460 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-07-12 10:09:39,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 112 transitions, 458 flow. Second operand has 8 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 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-12 10:09:39,461 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:39,461 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-07-12 10:09:39,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:39,845 INFO L129 PetriNetUnfolder]: 397/1115 cut-off events. [2022-07-12 10:09:39,846 INFO L130 PetriNetUnfolder]: For 3153/3241 co-relation queries the response was YES. [2022-07-12 10:09:39,851 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3797 conditions, 1115 events. 397/1115 cut-off events. For 3153/3241 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7798 event pairs, 66 based on Foata normal form. 57/1129 useless extension candidates. Maximal degree in co-relation 3774. Up to 227 conditions per place. [2022-07-12 10:09:39,854 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 26 selfloop transitions, 14 changer transitions 34/156 dead transitions. [2022-07-12 10:09:39,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 156 transitions, 884 flow [2022-07-12 10:09:39,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:09:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:09:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1252 transitions. [2022-07-12 10:09:39,858 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.844804318488529 [2022-07-12 10:09:39,858 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1252 transitions. [2022-07-12 10:09:39,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1252 transitions. [2022-07-12 10:09:39,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:39,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1252 transitions. [2022-07-12 10:09:39,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.3076923076923) internal successors, (1252), 13 states have internal predecessors, (1252), 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-12 10:09:39,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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-12 10:09:39,865 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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-12 10:09:39,865 INFO L186 Difference]: Start difference. First operand has 142 places, 112 transitions, 458 flow. Second operand 13 states and 1252 transitions. [2022-07-12 10:09:39,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 156 transitions, 884 flow [2022-07-12 10:09:39,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 156 transitions, 834 flow, removed 19 selfloop flow, removed 6 redundant places. [2022-07-12 10:09:39,900 INFO L242 Difference]: Finished difference. Result has 151 places, 112 transitions, 463 flow [2022-07-12 10:09:39,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=463, PETRI_PLACES=151, PETRI_TRANSITIONS=112} [2022-07-12 10:09:39,901 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 32 predicate places. [2022-07-12 10:09:39,902 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 112 transitions, 463 flow [2022-07-12 10:09:39,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 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-12 10:09:39,902 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:39,903 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:39,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:09:39,903 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:39,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:39,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1755253851, now seen corresponding path program 1 times [2022-07-12 10:09:39,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:39,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713230593] [2022-07-12 10:09:39,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:39,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:40,022 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-12 10:09:40,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:40,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713230593] [2022-07-12 10:09:40,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713230593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:40,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:40,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:09:40,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086200939] [2022-07-12 10:09:40,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:40,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:09:40,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:40,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:09:40,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:09:40,025 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-07-12 10:09:40,026 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 112 transitions, 463 flow. Second operand has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 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-12 10:09:40,026 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:40,026 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-07-12 10:09:40,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:40,212 INFO L129 PetriNetUnfolder]: 106/672 cut-off events. [2022-07-12 10:09:40,213 INFO L130 PetriNetUnfolder]: For 1765/1858 co-relation queries the response was YES. [2022-07-12 10:09:40,217 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 672 events. 106/672 cut-off events. For 1765/1858 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5039 event pairs, 10 based on Foata normal form. 6/630 useless extension candidates. Maximal degree in co-relation 1902. Up to 137 conditions per place. [2022-07-12 10:09:40,223 INFO L132 encePairwiseOnDemand]: 106/114 looper letters, 19 selfloop transitions, 4 changer transitions 15/123 dead transitions. [2022-07-12 10:09:40,224 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 123 transitions, 565 flow [2022-07-12 10:09:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:09:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:09:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 659 transitions. [2022-07-12 10:09:40,227 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8258145363408521 [2022-07-12 10:09:40,227 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 659 transitions. [2022-07-12 10:09:40,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 659 transitions. [2022-07-12 10:09:40,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:40,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 659 transitions. [2022-07-12 10:09:40,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 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-12 10:09:40,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 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-12 10:09:40,233 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 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-12 10:09:40,233 INFO L186 Difference]: Start difference. First operand has 151 places, 112 transitions, 463 flow. Second operand 7 states and 659 transitions. [2022-07-12 10:09:40,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 123 transitions, 565 flow [2022-07-12 10:09:40,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 123 transitions, 470 flow, removed 32 selfloop flow, removed 17 redundant places. [2022-07-12 10:09:40,246 INFO L242 Difference]: Finished difference. Result has 140 places, 105 transitions, 340 flow [2022-07-12 10:09:40,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=140, PETRI_TRANSITIONS=105} [2022-07-12 10:09:40,248 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 21 predicate places. [2022-07-12 10:09:40,248 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 105 transitions, 340 flow [2022-07-12 10:09:40,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 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-12 10:09:40,249 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:40,249 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:40,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:09:40,250 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:40,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:40,250 INFO L85 PathProgramCache]: Analyzing trace with hash 8651161, now seen corresponding path program 2 times [2022-07-12 10:09:40,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:40,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065383641] [2022-07-12 10:09:40,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:40,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:40,515 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-12 10:09:40,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:40,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065383641] [2022-07-12 10:09:40,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065383641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:40,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:40,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:09:40,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971870375] [2022-07-12 10:09:40,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:40,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:09:40,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:40,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:09:40,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:09:40,520 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-07-12 10:09:40,521 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 105 transitions, 340 flow. Second operand has 10 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 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-12 10:09:40,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:40,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-07-12 10:09:40,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:40,752 INFO L129 PetriNetUnfolder]: 45/382 cut-off events. [2022-07-12 10:09:40,752 INFO L130 PetriNetUnfolder]: For 194/207 co-relation queries the response was YES. [2022-07-12 10:09:40,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 382 events. 45/382 cut-off events. For 194/207 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2260 event pairs, 1 based on Foata normal form. 3/365 useless extension candidates. Maximal degree in co-relation 783. Up to 67 conditions per place. [2022-07-12 10:09:40,755 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 19 selfloop transitions, 4 changer transitions 10/118 dead transitions. [2022-07-12 10:09:40,756 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 118 transitions, 448 flow [2022-07-12 10:09:40,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:09:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:09:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 835 transitions. [2022-07-12 10:09:40,758 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8138401559454191 [2022-07-12 10:09:40,758 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 835 transitions. [2022-07-12 10:09:40,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 835 transitions. [2022-07-12 10:09:40,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:40,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 835 transitions. [2022-07-12 10:09:40,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.77777777777777) internal successors, (835), 9 states have internal predecessors, (835), 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-12 10:09:40,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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-12 10:09:40,762 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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-12 10:09:40,762 INFO L186 Difference]: Start difference. First operand has 140 places, 105 transitions, 340 flow. Second operand 9 states and 835 transitions. [2022-07-12 10:09:40,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 118 transitions, 448 flow [2022-07-12 10:09:40,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 118 transitions, 394 flow, removed 12 selfloop flow, removed 13 redundant places. [2022-07-12 10:09:40,766 INFO L242 Difference]: Finished difference. Result has 137 places, 107 transitions, 329 flow [2022-07-12 10:09:40,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=329, PETRI_PLACES=137, PETRI_TRANSITIONS=107} [2022-07-12 10:09:40,767 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 18 predicate places. [2022-07-12 10:09:40,768 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 107 transitions, 329 flow [2022-07-12 10:09:40,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 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-12 10:09:40,768 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:40,768 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:40,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 10:09:40,769 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:40,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:40,769 INFO L85 PathProgramCache]: Analyzing trace with hash 701921235, now seen corresponding path program 3 times [2022-07-12 10:09:40,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:40,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376616588] [2022-07-12 10:09:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:40,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:40,973 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-12 10:09:40,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:40,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376616588] [2022-07-12 10:09:40,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376616588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:40,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:40,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:09:40,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725284859] [2022-07-12 10:09:40,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:40,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:09:40,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:40,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:09:40,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:09:40,977 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-07-12 10:09:40,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 107 transitions, 329 flow. Second operand has 10 states, 10 states have (on average 90.1) internal successors, (901), 10 states have internal predecessors, (901), 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-12 10:09:40,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:40,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-07-12 10:09:40,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:41,248 INFO L129 PetriNetUnfolder]: 36/311 cut-off events. [2022-07-12 10:09:41,248 INFO L130 PetriNetUnfolder]: For 144/147 co-relation queries the response was YES. [2022-07-12 10:09:41,249 INFO L84 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 311 events. 36/311 cut-off events. For 144/147 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1614 event pairs, 0 based on Foata normal form. 3/301 useless extension candidates. Maximal degree in co-relation 613. Up to 52 conditions per place. [2022-07-12 10:09:41,250 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 18 selfloop transitions, 8 changer transitions 6/116 dead transitions. [2022-07-12 10:09:41,251 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 116 transitions, 427 flow [2022-07-12 10:09:41,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:09:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:09:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1001 transitions. [2022-07-12 10:09:41,257 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7982456140350878 [2022-07-12 10:09:41,257 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1001 transitions. [2022-07-12 10:09:41,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1001 transitions. [2022-07-12 10:09:41,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:41,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1001 transitions. [2022-07-12 10:09:41,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 91.0) internal successors, (1001), 11 states have internal predecessors, (1001), 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-12 10:09:41,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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-12 10:09:41,277 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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-12 10:09:41,277 INFO L186 Difference]: Start difference. First operand has 137 places, 107 transitions, 329 flow. Second operand 11 states and 1001 transitions. [2022-07-12 10:09:41,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 116 transitions, 427 flow [2022-07-12 10:09:41,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 116 transitions, 404 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-07-12 10:09:41,281 INFO L242 Difference]: Finished difference. Result has 141 places, 109 transitions, 355 flow [2022-07-12 10:09:41,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=355, PETRI_PLACES=141, PETRI_TRANSITIONS=109} [2022-07-12 10:09:41,282 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 22 predicate places. [2022-07-12 10:09:41,282 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 109 transitions, 355 flow [2022-07-12 10:09:41,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.1) internal successors, (901), 10 states have internal predecessors, (901), 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-12 10:09:41,283 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:41,283 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:41,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 10:09:41,283 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:41,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:41,284 INFO L85 PathProgramCache]: Analyzing trace with hash -147845307, now seen corresponding path program 4 times [2022-07-12 10:09:41,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:41,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624595310] [2022-07-12 10:09:41,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:41,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:09:41,323 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:09:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:09:41,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:09:41,410 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:09:41,411 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-12 10:09:41,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-12 10:09:41,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-12 10:09:41,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-12 10:09:41,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-12 10:09:41,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-12 10:09:41,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 10:09:41,414 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:41,420 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-12 10:09:41,420 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 10:09:41,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 10:09:41 BasicIcfg [2022-07-12 10:09:41,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 10:09:41,536 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 10:09:41,536 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 10:09:41,536 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 10:09:41,537 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:09:32" (3/4) ... [2022-07-12 10:09:41,538 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 10:09:41,620 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 10:09:41,620 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 10:09:41,621 INFO L158 Benchmark]: Toolchain (without parser) took 10540.99ms. Allocated memory was 94.4MB in the beginning and 402.7MB in the end (delta: 308.3MB). Free memory was 61.1MB in the beginning and 228.0MB in the end (delta: -166.9MB). Peak memory consumption was 140.9MB. Max. memory is 16.1GB. [2022-07-12 10:09:41,621 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 94.4MB. Free memory was 51.0MB in the beginning and 51.0MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:09:41,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.14ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 60.9MB in the beginning and 78.6MB in the end (delta: -17.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 10:09:41,622 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.11ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 76.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:09:41,622 INFO L158 Benchmark]: Boogie Preprocessor took 54.72ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 74.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:09:41,622 INFO L158 Benchmark]: RCFGBuilder took 997.74ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 86.4MB in the end (delta: -12.4MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2022-07-12 10:09:41,623 INFO L158 Benchmark]: TraceAbstraction took 8870.24ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 86.4MB in the beginning and 260.5MB in the end (delta: -174.1MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. [2022-07-12 10:09:41,623 INFO L158 Benchmark]: Witness Printer took 84.07ms. Allocated memory is still 402.7MB. Free memory was 260.5MB in the beginning and 228.0MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-07-12 10:09:41,624 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.22ms. Allocated memory is still 94.4MB. Free memory was 51.0MB in the beginning and 51.0MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.14ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 60.9MB in the beginning and 78.6MB in the end (delta: -17.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.11ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 76.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.72ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 74.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 997.74ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 86.4MB in the end (delta: -12.4MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8870.24ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 86.4MB in the beginning and 260.5MB in the end (delta: -174.1MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. * Witness Printer took 84.07ms. Allocated memory is still 402.7MB. Free memory was 260.5MB in the beginning and 228.0MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L720] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L739] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L740] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2073; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2073, ((void *)0), P0, ((void *)0))=-2, t2073={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2074; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2074, ((void *)0), P1, ((void *)0))=-1, t2073={5:0}, t2074={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2075; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t2075, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2075, ((void *)0), P2, ((void *)0))=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L744] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 836]: 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: 834]: 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 7 procedures, 140 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 662 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 662 mSDsluCounter, 617 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1094 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1377 IncrementalHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 127 mSDtfsCounter, 1377 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred in iteration=5, InterpolantAutomatonStates: 127, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1035 NumberOfCodeBlocks, 1035 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 935 ConstructedInterpolants, 0 QuantifiedInterpolants, 3421 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-12 10:09:41,661 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