./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix009.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix009.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 f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:44:36,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:44:36,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:44:36,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:44:36,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:44:36,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:44:36,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:44:36,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:44:36,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:44:36,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:44:36,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:44:36,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:44:36,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:44:36,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:44:36,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:44:36,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:44:36,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:44:36,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:44:36,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:44:36,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:44:36,915 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:44:36,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:44:36,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:44:36,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:44:36,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:44:36,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:44:36,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:44:36,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:44:36,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:44:36,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:44:36,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:44:36,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:44:36,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:44:36,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:44:36,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:44:36,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:44:36,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:44:36,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:44:36,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:44:36,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:44:36,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:44:36,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:44:36,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:44:36,952 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:44:36,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:44:36,953 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:44:36,953 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:44:36,954 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:44:36,954 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:44:36,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:44:36,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:44:36,955 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:44:36,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:44:36,955 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:44:36,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:44:36,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:44:36,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:44:36,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:44:36,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:44:36,957 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:44:36,957 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:44:36,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:44:36,958 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:44:36,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:44:36,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:44:36,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:44:36,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:44:36,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:44:36,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:44:36,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:44:36,959 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:44:36,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:44:36,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:44:36,960 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:44:36,960 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:44:36,961 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:44:36,961 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 -> f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 [2022-07-13 21:44:37,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:44:37,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:44:37,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:44:37,207 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:44:37,209 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:44:37,210 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix009.opt.i [2022-07-13 21:44:37,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae4a1a0cb/be786c09c3bd4a21ac11be5c25fa51c9/FLAG081e2832a [2022-07-13 21:44:37,776 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:44:37,777 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix009.opt.i [2022-07-13 21:44:37,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae4a1a0cb/be786c09c3bd4a21ac11be5c25fa51c9/FLAG081e2832a [2022-07-13 21:44:38,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae4a1a0cb/be786c09c3bd4a21ac11be5c25fa51c9 [2022-07-13 21:44:38,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:44:38,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:44:38,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:44:38,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:44:38,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:44:38,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:44:38" (1/1) ... [2022-07-13 21:44:38,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af87bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:38, skipping insertion in model container [2022-07-13 21:44:38,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:44:38" (1/1) ... [2022-07-13 21:44:38,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:44:38,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:44:38,527 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/mix009.opt.i[987,1000] [2022-07-13 21:44:38,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:44:38,764 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:44:38,779 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/mix009.opt.i[987,1000] [2022-07-13 21:44:38,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:44:38,881 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:44:38,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:38 WrapperNode [2022-07-13 21:44:38,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:44:38,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:44:38,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:44:38,886 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:44:38,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:38" (1/1) ... [2022-07-13 21:44:38,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:38" (1/1) ... [2022-07-13 21:44:38,975 INFO L137 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 266 [2022-07-13 21:44:38,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:44:38,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:44:38,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:44:38,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:44:38,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:38" (1/1) ... [2022-07-13 21:44:38,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:38" (1/1) ... [2022-07-13 21:44:38,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:38" (1/1) ... [2022-07-13 21:44:38,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:38" (1/1) ... [2022-07-13 21:44:39,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:38" (1/1) ... [2022-07-13 21:44:39,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:38" (1/1) ... [2022-07-13 21:44:39,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:38" (1/1) ... [2022-07-13 21:44:39,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:44:39,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:44:39,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:44:39,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:44:39,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:38" (1/1) ... [2022-07-13 21:44:39,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:44:39,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:44:39,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 21:44:39,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 21:44:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 21:44:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-13 21:44:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:44:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 21:44:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 21:44:39,110 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-13 21:44:39,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-13 21:44:39,111 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-13 21:44:39,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-13 21:44:39,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:44:39,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-13 21:44:39,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:44:39,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:44:39,114 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 21:44:39,251 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:44:39,252 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:44:39,747 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:44:40,120 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:44:40,120 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 21:44:40,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:44:40 BoogieIcfgContainer [2022-07-13 21:44:40,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:44:40,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:44:40,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:44:40,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:44:40,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:44:38" (1/3) ... [2022-07-13 21:44:40,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f92e9e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:44:40, skipping insertion in model container [2022-07-13 21:44:40,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:38" (2/3) ... [2022-07-13 21:44:40,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f92e9e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:44:40, skipping insertion in model container [2022-07-13 21:44:40,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:44:40" (3/3) ... [2022-07-13 21:44:40,132 INFO L111 eAbstractionObserver]: Analyzing ICFG mix009.opt.i [2022-07-13 21:44:40,140 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 21:44:40,149 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:44:40,150 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 21:44:40,150 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 21:44:40,222 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-13 21:44:40,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 100 transitions, 210 flow [2022-07-13 21:44:40,330 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2022-07-13 21:44:40,330 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:44:40,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-07-13 21:44:40,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 100 transitions, 210 flow [2022-07-13 21:44:40,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 98 transitions, 202 flow [2022-07-13 21:44:40,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:44:40,364 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@3d579fe4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@18c1d0be [2022-07-13 21:44:40,364 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-13 21:44:40,390 INFO L129 PetriNetUnfolder]: 0/61 cut-off events. [2022-07-13 21:44:40,390 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:44:40,391 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:40,391 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-13 21:44:40,392 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-13 21:44:40,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:40,398 INFO L85 PathProgramCache]: Analyzing trace with hash -356947808, now seen corresponding path program 1 times [2022-07-13 21:44:40,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:40,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121512376] [2022-07-13 21:44:40,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:40,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:44:40,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:40,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121512376] [2022-07-13 21:44:40,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121512376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:40,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:40,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 21:44:40,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422258346] [2022-07-13 21:44:40,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:40,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:44:40,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:40,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:44:40,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:44:40,773 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 100 [2022-07-13 21:44:40,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 98 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:40,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:40,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 100 [2022-07-13 21:44:40,779 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:40,878 INFO L129 PetriNetUnfolder]: 14/137 cut-off events. [2022-07-13 21:44:40,879 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-13 21:44:40,880 INFO L84 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 137 events. 14/137 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 296 event pairs, 2 based on Foata normal form. 8/137 useless extension candidates. Maximal degree in co-relation 129. Up to 25 conditions per place. [2022-07-13 21:44:40,883 INFO L132 encePairwiseOnDemand]: 95/100 looper letters, 8 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2022-07-13 21:44:40,883 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 96 transitions, 218 flow [2022-07-13 21:44:40,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:44:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:44:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2022-07-13 21:44:40,903 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.93 [2022-07-13 21:44:40,904 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2022-07-13 21:44:40,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2022-07-13 21:44:40,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:40,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2022-07-13 21:44:40,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:40,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:40,924 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:40,925 INFO L186 Difference]: Start difference. First operand has 103 places, 98 transitions, 202 flow. Second operand 3 states and 279 transitions. [2022-07-13 21:44:40,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 96 transitions, 218 flow [2022-07-13 21:44:40,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 96 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-13 21:44:40,934 INFO L242 Difference]: Finished difference. Result has 101 places, 94 transitions, 196 flow [2022-07-13 21:44:40,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=101, PETRI_TRANSITIONS=94} [2022-07-13 21:44:40,940 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -2 predicate places. [2022-07-13 21:44:40,940 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 94 transitions, 196 flow [2022-07-13 21:44:40,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:40,942 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:40,942 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] [2022-07-13 21:44:40,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:44:40,943 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-13 21:44:40,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:40,944 INFO L85 PathProgramCache]: Analyzing trace with hash 980317136, now seen corresponding path program 1 times [2022-07-13 21:44:40,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:40,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769330875] [2022-07-13 21:44:40,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:40,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:44:41,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:41,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769330875] [2022-07-13 21:44:41,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769330875] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:41,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:41,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:44:41,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912320030] [2022-07-13 21:44:41,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:41,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:44:41,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:41,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:44:41,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:44:41,184 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 100 [2022-07-13 21:44:41,184 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 94 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:41,185 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:41,185 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 100 [2022-07-13 21:44:41,185 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:41,636 INFO L129 PetriNetUnfolder]: 210/746 cut-off events. [2022-07-13 21:44:41,636 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-07-13 21:44:41,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 746 events. 210/746 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4332 event pairs, 100 based on Foata normal form. 0/719 useless extension candidates. Maximal degree in co-relation 1119. Up to 189 conditions per place. [2022-07-13 21:44:41,642 INFO L132 encePairwiseOnDemand]: 94/100 looper letters, 23 selfloop transitions, 2 changer transitions 49/139 dead transitions. [2022-07-13 21:44:41,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 139 transitions, 432 flow [2022-07-13 21:44:41,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:44:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:44:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 751 transitions. [2022-07-13 21:44:41,645 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8344444444444444 [2022-07-13 21:44:41,645 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 751 transitions. [2022-07-13 21:44:41,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 751 transitions. [2022-07-13 21:44:41,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:41,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 751 transitions. [2022-07-13 21:44:41,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.44444444444444) internal successors, (751), 9 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:41,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 100.0) internal successors, (1000), 10 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:41,651 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 100.0) internal successors, (1000), 10 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:41,651 INFO L186 Difference]: Start difference. First operand has 101 places, 94 transitions, 196 flow. Second operand 9 states and 751 transitions. [2022-07-13 21:44:41,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 139 transitions, 432 flow [2022-07-13 21:44:41,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 139 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-13 21:44:41,655 INFO L242 Difference]: Finished difference. Result has 114 places, 84 transitions, 192 flow [2022-07-13 21:44:41,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=192, PETRI_PLACES=114, PETRI_TRANSITIONS=84} [2022-07-13 21:44:41,656 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 11 predicate places. [2022-07-13 21:44:41,656 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 84 transitions, 192 flow [2022-07-13 21:44:41,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:41,656 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:41,657 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:44:41,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:44:41,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-13 21:44:41,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:41,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1134880110, now seen corresponding path program 1 times [2022-07-13 21:44:41,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:41,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995581579] [2022-07-13 21:44:41,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:41,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:44:41,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:41,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995581579] [2022-07-13 21:44:41,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995581579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:41,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:41,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:44:41,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915119575] [2022-07-13 21:44:41,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:41,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:44:41,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:41,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:44:41,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:44:41,851 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 100 [2022-07-13 21:44:41,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 84 transitions, 192 flow. Second operand has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:41,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:41,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 100 [2022-07-13 21:44:41,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:42,141 INFO L129 PetriNetUnfolder]: 113/348 cut-off events. [2022-07-13 21:44:42,142 INFO L130 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2022-07-13 21:44:42,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 348 events. 113/348 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1328 event pairs, 31 based on Foata normal form. 10/343 useless extension candidates. Maximal degree in co-relation 642. Up to 106 conditions per place. [2022-07-13 21:44:42,144 INFO L132 encePairwiseOnDemand]: 92/100 looper letters, 18 selfloop transitions, 4 changer transitions 25/112 dead transitions. [2022-07-13 21:44:42,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 112 transitions, 363 flow [2022-07-13 21:44:42,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:44:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:44:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 809 transitions. [2022-07-13 21:44:42,147 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.809 [2022-07-13 21:44:42,147 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 809 transitions. [2022-07-13 21:44:42,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 809 transitions. [2022-07-13 21:44:42,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:42,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 809 transitions. [2022-07-13 21:44:42,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 80.9) internal successors, (809), 10 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:42,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 100.0) internal successors, (1100), 11 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:42,152 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 100.0) internal successors, (1100), 11 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:42,153 INFO L186 Difference]: Start difference. First operand has 114 places, 84 transitions, 192 flow. Second operand 10 states and 809 transitions. [2022-07-13 21:44:42,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 112 transitions, 363 flow [2022-07-13 21:44:42,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 329 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-07-13 21:44:42,157 INFO L242 Difference]: Finished difference. Result has 106 places, 84 transitions, 200 flow [2022-07-13 21:44:42,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=200, PETRI_PLACES=106, PETRI_TRANSITIONS=84} [2022-07-13 21:44:42,158 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 3 predicate places. [2022-07-13 21:44:42,158 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 84 transitions, 200 flow [2022-07-13 21:44:42,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:42,159 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:42,159 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-13 21:44:42,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:44:42,159 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-13 21:44:42,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:42,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1428186632, now seen corresponding path program 1 times [2022-07-13 21:44:42,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:42,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304388082] [2022-07-13 21:44:42,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:42,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:44:42,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:42,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304388082] [2022-07-13 21:44:42,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304388082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:42,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:42,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:44:42,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776376182] [2022-07-13 21:44:42,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:42,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:44:42,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:42,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:44:42,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:44:42,276 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 100 [2022-07-13 21:44:42,277 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 84 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:42,277 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:42,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 100 [2022-07-13 21:44:42,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:42,618 INFO L129 PetriNetUnfolder]: 155/452 cut-off events. [2022-07-13 21:44:42,619 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-07-13 21:44:42,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 452 events. 155/452 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2212 event pairs, 14 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 833. Up to 79 conditions per place. [2022-07-13 21:44:42,621 INFO L132 encePairwiseOnDemand]: 91/100 looper letters, 24 selfloop transitions, 5 changer transitions 40/136 dead transitions. [2022-07-13 21:44:42,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 136 transitions, 465 flow [2022-07-13 21:44:42,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:44:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:44:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 861 transitions. [2022-07-13 21:44:42,625 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.861 [2022-07-13 21:44:42,625 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 861 transitions. [2022-07-13 21:44:42,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 861 transitions. [2022-07-13 21:44:42,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:42,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 861 transitions. [2022-07-13 21:44:42,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 86.1) internal successors, (861), 10 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:42,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 100.0) internal successors, (1100), 11 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:42,636 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 100.0) internal successors, (1100), 11 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:42,636 INFO L186 Difference]: Start difference. First operand has 106 places, 84 transitions, 200 flow. Second operand 10 states and 861 transitions. [2022-07-13 21:44:42,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 136 transitions, 465 flow [2022-07-13 21:44:42,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 136 transitions, 431 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-07-13 21:44:42,641 INFO L242 Difference]: Finished difference. Result has 106 places, 85 transitions, 222 flow [2022-07-13 21:44:42,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=222, PETRI_PLACES=106, PETRI_TRANSITIONS=85} [2022-07-13 21:44:42,643 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 3 predicate places. [2022-07-13 21:44:42,643 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 85 transitions, 222 flow [2022-07-13 21:44:42,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:42,645 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:42,645 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-13 21:44:42,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 21:44:42,646 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-13 21:44:42,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:42,646 INFO L85 PathProgramCache]: Analyzing trace with hash -952932775, now seen corresponding path program 1 times [2022-07-13 21:44:42,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:42,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936288080] [2022-07-13 21:44:42,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:42,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:44:42,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:42,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936288080] [2022-07-13 21:44:42,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936288080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:42,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:42,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:44:42,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115358932] [2022-07-13 21:44:42,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:42,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:44:42,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:42,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:44:42,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:44:42,849 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 100 [2022-07-13 21:44:42,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 85 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 81.0) internal successors, (567), 7 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:42,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:42,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 100 [2022-07-13 21:44:42,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:43,044 INFO L129 PetriNetUnfolder]: 33/181 cut-off events. [2022-07-13 21:44:43,044 INFO L130 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2022-07-13 21:44:43,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 181 events. 33/181 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 523 event pairs, 4 based on Foata normal form. 7/187 useless extension candidates. Maximal degree in co-relation 364. Up to 26 conditions per place. [2022-07-13 21:44:43,045 INFO L132 encePairwiseOnDemand]: 92/100 looper letters, 16 selfloop transitions, 7 changer transitions 19/109 dead transitions. [2022-07-13 21:44:43,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 109 transitions, 402 flow [2022-07-13 21:44:43,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:44:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:44:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 834 transitions. [2022-07-13 21:44:43,048 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.834 [2022-07-13 21:44:43,048 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 834 transitions. [2022-07-13 21:44:43,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 834 transitions. [2022-07-13 21:44:43,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:43,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 834 transitions. [2022-07-13 21:44:43,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 83.4) internal successors, (834), 10 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:43,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 100.0) internal successors, (1100), 11 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:43,054 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 100.0) internal successors, (1100), 11 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:43,055 INFO L186 Difference]: Start difference. First operand has 106 places, 85 transitions, 222 flow. Second operand 10 states and 834 transitions. [2022-07-13 21:44:43,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 109 transitions, 402 flow [2022-07-13 21:44:43,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 109 transitions, 356 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-07-13 21:44:43,062 INFO L242 Difference]: Finished difference. Result has 108 places, 85 transitions, 230 flow [2022-07-13 21:44:43,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=230, PETRI_PLACES=108, PETRI_TRANSITIONS=85} [2022-07-13 21:44:43,064 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 5 predicate places. [2022-07-13 21:44:43,064 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 85 transitions, 230 flow [2022-07-13 21:44:43,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.0) internal successors, (567), 7 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:43,065 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:43,065 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] [2022-07-13 21:44:43,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:44:43,066 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-13 21:44:43,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:43,066 INFO L85 PathProgramCache]: Analyzing trace with hash 454218623, now seen corresponding path program 1 times [2022-07-13 21:44:43,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:43,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559481981] [2022-07-13 21:44:43,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:43,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:44:43,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:43,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559481981] [2022-07-13 21:44:43,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559481981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:43,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:43,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:44:43,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026613091] [2022-07-13 21:44:43,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:43,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:44:43,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:43,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:44:43,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:44:43,288 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 100 [2022-07-13 21:44:43,289 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 85 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 80.42857142857143) internal successors, (563), 7 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:43,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:43,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 100 [2022-07-13 21:44:43,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:43,459 INFO L129 PetriNetUnfolder]: 12/159 cut-off events. [2022-07-13 21:44:43,460 INFO L130 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-07-13 21:44:43,460 INFO L84 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 159 events. 12/159 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 341 event pairs, 0 based on Foata normal form. 1/159 useless extension candidates. Maximal degree in co-relation 246. Up to 26 conditions per place. [2022-07-13 21:44:43,461 INFO L132 encePairwiseOnDemand]: 94/100 looper letters, 17 selfloop transitions, 1 changer transitions 11/97 dead transitions. [2022-07-13 21:44:43,461 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 97 transitions, 314 flow [2022-07-13 21:44:43,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 21:44:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-13 21:44:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 576 transitions. [2022-07-13 21:44:43,463 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8228571428571428 [2022-07-13 21:44:43,463 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 576 transitions. [2022-07-13 21:44:43,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 576 transitions. [2022-07-13 21:44:43,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:43,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 576 transitions. [2022-07-13 21:44:43,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 82.28571428571429) internal successors, (576), 7 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:43,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:43,466 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:43,466 INFO L186 Difference]: Start difference. First operand has 108 places, 85 transitions, 230 flow. Second operand 7 states and 576 transitions. [2022-07-13 21:44:43,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 97 transitions, 314 flow [2022-07-13 21:44:43,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 97 transitions, 268 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-07-13 21:44:43,470 INFO L242 Difference]: Finished difference. Result has 102 places, 85 transitions, 197 flow [2022-07-13 21:44:43,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=197, PETRI_PLACES=102, PETRI_TRANSITIONS=85} [2022-07-13 21:44:43,473 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -1 predicate places. [2022-07-13 21:44:43,473 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 85 transitions, 197 flow [2022-07-13 21:44:43,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 80.42857142857143) internal successors, (563), 7 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:43,474 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:43,474 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] [2022-07-13 21:44:43,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:44:43,474 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-13 21:44:43,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:43,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1362565371, now seen corresponding path program 2 times [2022-07-13 21:44:43,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:43,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411787507] [2022-07-13 21:44:43,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:43,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:43,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:44:43,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:43,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411787507] [2022-07-13 21:44:43,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411787507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:43,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:43,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 21:44:43,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992668100] [2022-07-13 21:44:43,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:43,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 21:44:43,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:43,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 21:44:43,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-13 21:44:43,946 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 100 [2022-07-13 21:44:43,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 85 transitions, 197 flow. Second operand has 12 states, 12 states have (on average 74.83333333333333) internal successors, (898), 12 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:43,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:43,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 100 [2022-07-13 21:44:43,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:44,250 INFO L129 PetriNetUnfolder]: 4/131 cut-off events. [2022-07-13 21:44:44,250 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-13 21:44:44,250 INFO L84 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 131 events. 4/131 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 198 event pairs, 0 based on Foata normal form. 1/132 useless extension candidates. Maximal degree in co-relation 190. Up to 11 conditions per place. [2022-07-13 21:44:44,251 INFO L132 encePairwiseOnDemand]: 87/100 looper letters, 15 selfloop transitions, 7 changer transitions 12/97 dead transitions. [2022-07-13 21:44:44,251 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 97 transitions, 297 flow [2022-07-13 21:44:44,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 21:44:44,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-13 21:44:44,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1130 transitions. [2022-07-13 21:44:44,257 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7533333333333333 [2022-07-13 21:44:44,257 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1130 transitions. [2022-07-13 21:44:44,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1130 transitions. [2022-07-13 21:44:44,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:44,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1130 transitions. [2022-07-13 21:44:44,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 75.33333333333333) internal successors, (1130), 15 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:44,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 100.0) internal successors, (1600), 16 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:44,263 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 100.0) internal successors, (1600), 16 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:44,263 INFO L186 Difference]: Start difference. First operand has 102 places, 85 transitions, 197 flow. Second operand 15 states and 1130 transitions. [2022-07-13 21:44:44,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 97 transitions, 297 flow [2022-07-13 21:44:44,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 97 transitions, 282 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-07-13 21:44:44,266 INFO L242 Difference]: Finished difference. Result has 113 places, 85 transitions, 218 flow [2022-07-13 21:44:44,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=218, PETRI_PLACES=113, PETRI_TRANSITIONS=85} [2022-07-13 21:44:44,267 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 10 predicate places. [2022-07-13 21:44:44,267 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 85 transitions, 218 flow [2022-07-13 21:44:44,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 74.83333333333333) internal successors, (898), 12 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:44,268 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:44,268 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] [2022-07-13 21:44:44,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:44:44,268 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-13 21:44:44,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:44,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1598493799, now seen corresponding path program 3 times [2022-07-13 21:44:44,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:44,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466268910] [2022-07-13 21:44:44,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:44,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:44:44,316 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:44:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:44:44,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:44:44,409 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:44:44,410 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-07-13 21:44:44,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-13 21:44:44,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-07-13 21:44:44,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-07-13 21:44:44,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-13 21:44:44,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 21:44:44,413 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-07-13 21:44:44,418 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-13 21:44:44,418 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 21:44:44,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 09:44:44 BasicIcfg [2022-07-13 21:44:44,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 21:44:44,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 21:44:44,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 21:44:44,533 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 21:44:44,534 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:44:40" (3/4) ... [2022-07-13 21:44:44,535 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 21:44:44,645 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 21:44:44,645 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 21:44:44,646 INFO L158 Benchmark]: Toolchain (without parser) took 6357.87ms. Allocated memory was 117.4MB in the beginning and 199.2MB in the end (delta: 81.8MB). Free memory was 76.8MB in the beginning and 73.6MB in the end (delta: 3.2MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. [2022-07-13 21:44:44,646 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 117.4MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:44:44,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.87ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 77.3MB in the end (delta: -630.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 21:44:44,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.19ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 74.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 21:44:44,647 INFO L158 Benchmark]: Boogie Preprocessor took 35.29ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 72.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:44:44,648 INFO L158 Benchmark]: RCFGBuilder took 1110.85ms. Allocated memory was 117.4MB in the beginning and 165.7MB in the end (delta: 48.2MB). Free memory was 71.6MB in the beginning and 76.5MB in the end (delta: -4.9MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2022-07-13 21:44:44,648 INFO L158 Benchmark]: TraceAbstraction took 4407.69ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 76.5MB in the beginning and 100.8MB in the end (delta: -24.4MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2022-07-13 21:44:44,648 INFO L158 Benchmark]: Witness Printer took 112.52ms. Allocated memory is still 199.2MB. Free memory was 100.8MB in the beginning and 73.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-13 21:44:44,650 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 117.4MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 591.87ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 77.3MB in the end (delta: -630.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.19ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 74.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.29ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 72.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1110.85ms. Allocated memory was 117.4MB in the beginning and 165.7MB in the end (delta: 48.2MB). Free memory was 71.6MB in the beginning and 76.5MB in the end (delta: -4.9MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4407.69ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 76.5MB in the beginning and 100.8MB in the end (delta: -24.4MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Witness Printer took 112.52ms. Allocated memory is still 199.2MB. Free memory was 100.8MB in the beginning and 73.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L725] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L726] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L727] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L728] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L729] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L730] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L731] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L734] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L736] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L831] 0 pthread_t t243; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t243={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t243, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t243, ((void *)0), P0, ((void *)0))=-1, t243={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] 0 pthread_t t244; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t243={5:0}, t244={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t244, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t244, ((void *)0), P1, ((void *)0))=0, t243={5:0}, t244={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 2 y$w_buff1 = y$w_buff0 [L780] 2 y$w_buff0 = 1 [L781] 2 y$w_buff1_used = y$w_buff0_used [L782] 2 y$w_buff0_used = (_Bool)1 [L783] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L783] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L784] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L785] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L786] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L787] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 2 y$flush_delayed = weak$$choice2 [L793] 2 y$mem_tmp = y [L794] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 [L794] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L794] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L795] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L795] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L796] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L796] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L797] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L797] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L798] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L799] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L800] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L801] 2 __unbuffered_p1_EAX = y [L802] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L802] 2 y = y$flush_delayed ? y$mem_tmp : y [L803] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EBX = y [L766] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L809] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L810] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L811] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L812] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L813] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={5:0}, t244={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L840] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={5:0}, t244={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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: 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 5 procedures, 120 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 253 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 253 mSDsluCounter, 287 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 474 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 632 IncrementalHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 63 mSDtfsCounter, 632 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=5, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 577 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 491 ConstructedInterpolants, 0 QuantifiedInterpolants, 2730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 21:44:44,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE